/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:17:17,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:17:17,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:17:17,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:17:17,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:17:17,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:17:17,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:17:17,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:17:17,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:17:17,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:17:17,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:17:17,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:17:17,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:17:17,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:17:17,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:17:17,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:17:17,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:17:17,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:17:17,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:17:17,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:17:17,250 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:17:17,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:17:17,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:17:17,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:17:17,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:17:17,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:17:17,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:17:17,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:17:17,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:17:17,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:17:17,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:17:17,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:17:17,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:17:17,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:17:17,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:17:17,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:17:17,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:17:17,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:17:17,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:17:17,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:17:17,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:17:17,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:17:17,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:17:17,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:17:17,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:17:17,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:17:17,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:17:17,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:17:17,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:17:17,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:17:17,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:17:17,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:17:17,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:17:17,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:17:17,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:17:17,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:17:17,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:17,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:17:17,281 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:17:17,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:17:17,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:17:17,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:17:17,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:17:17,498 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:17:17,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-15 13:17:17,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77e9815e/bbf0653972d14703a89ed3e24bca0319/FLAGdeb72f5c6 [2022-04-15 13:17:17,903 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:17:17,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-15 13:17:17,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77e9815e/bbf0653972d14703a89ed3e24bca0319/FLAGdeb72f5c6 [2022-04-15 13:17:18,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77e9815e/bbf0653972d14703a89ed3e24bca0319 [2022-04-15 13:17:18,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:17:18,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:17:18,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:18,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:17:18,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:17:18,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4675ad66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18, skipping insertion in model container [2022-04-15 13:17:18,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:17:18,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:17:18,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-04-15 13:17:18,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:18,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:17:18,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-04-15 13:17:18,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:18,549 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:17:18,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18 WrapperNode [2022-04-15 13:17:18,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:18,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:17:18,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:17:18,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:17:18,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:17:18,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:17:18,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:17:18,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:17:18,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (1/1) ... [2022-04-15 13:17:18,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:18,632 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-04-15 13:17:18,650 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-04-15 13:17:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:17:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:17:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:17:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:17:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:17:18,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 13:17:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 13:17:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-15 13:17:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:17:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:17:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 13:17:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 13:17:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:17:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:17:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:17:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:17:18,764 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:17:18,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:17:21,183 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:17:21,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:17:21,187 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-15 13:17:21,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:21 BoogieIcfgContainer [2022-04-15 13:17:21,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:17:21,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:17:21,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:17:21,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:17:21,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:17:18" (1/3) ... [2022-04-15 13:17:21,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc2e576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:21, skipping insertion in model container [2022-04-15 13:17:21,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:18" (2/3) ... [2022-04-15 13:17:21,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc2e576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:21, skipping insertion in model container [2022-04-15 13:17:21,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:21" (3/3) ... [2022-04-15 13:17:21,197 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-04-15 13:17:21,200 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:17:21,200 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:17:21,233 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:17:21,240 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 13:17:21,240 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:17:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:17:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:17:21,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:21,266 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:21,266 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 1 times [2022-04-15 13:17:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764408814] [2022-04-15 13:17:21,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 2 times [2022-04-15 13:17:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:21,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981802112] [2022-04-15 13:17:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67#true} is VALID [2022-04-15 13:17:21,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-15 13:17:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 13:17:21,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 13:17:21,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 13:17:21,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-15 13:17:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-15 13:17:21,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {67#true} is VALID [2022-04-15 13:17:21,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-15 13:17:21,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,435 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-15 13:17:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:17:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 13:17:21,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 13:17:21,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 13:17:21,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-15 13:17:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:17:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-15 13:17:21,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-15 13:17:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:17:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-15 13:17:21,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-15 13:17:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 13:17:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {67#true} is VALID [2022-04-15 13:17:21,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-15 13:17:21,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-15 13:17:21,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,474 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-15 13:17:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 13:17:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {67#true} is VALID [2022-04-15 13:17:21,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-15 13:17:21,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-15 13:17:21,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:21,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67#true} is VALID [2022-04-15 13:17:21,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-15 13:17:21,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret20 := main(); {67#true} is VALID [2022-04-15 13:17:21,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {67#true} is VALID [2022-04-15 13:17:21,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {67#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {67#true} is VALID [2022-04-15 13:17:21,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 13:17:21,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 13:17:21,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 13:17:21,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-15 13:17:21,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {68#false} call #t~ret14 := is_pow2(~n~0); {67#true} is VALID [2022-04-15 13:17:21,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-15 13:17:21,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {67#true} is VALID [2022-04-15 13:17:21,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-15 13:17:21,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,499 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-15 13:17:21,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {68#false} is VALID [2022-04-15 13:17:21,500 INFO L272 TraceCheckUtils]: 18: Hoare triple {68#false} call assume_abort_if_not(#t~ret14); {67#true} is VALID [2022-04-15 13:17:21,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 13:17:21,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 13:17:21,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 13:17:21,503 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-15 13:17:21,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#false} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {68#false} is VALID [2022-04-15 13:17:21,507 INFO L272 TraceCheckUtils]: 24: Hoare triple {68#false} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:21,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-15 13:17:21,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,509 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-15 13:17:21,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {68#false} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {68#false} is VALID [2022-04-15 13:17:21,509 INFO L272 TraceCheckUtils]: 29: Hoare triple {68#false} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:21,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-15 13:17:21,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,510 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-15 13:17:21,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {68#false} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {68#false} is VALID [2022-04-15 13:17:21,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} assume !(~i~1 < ~n~0); {68#false} is VALID [2022-04-15 13:17:21,510 INFO L272 TraceCheckUtils]: 35: Hoare triple {68#false} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:21,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {67#true} is VALID [2022-04-15 13:17:21,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-15 13:17:21,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-15 13:17:21,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,511 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-15 13:17:21,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {68#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {68#false} is VALID [2022-04-15 13:17:21,512 INFO L272 TraceCheckUtils]: 42: Hoare triple {68#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:21,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {67#true} is VALID [2022-04-15 13:17:21,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-15 13:17:21,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 13:17:21,512 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-15 13:17:21,513 INFO L272 TraceCheckUtils]: 47: Hoare triple {68#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {68#false} is VALID [2022-04-15 13:17:21,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {68#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {68#false} is VALID [2022-04-15 13:17:21,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {68#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {68#false} is VALID [2022-04-15 13:17:21,513 INFO L272 TraceCheckUtils]: 50: Hoare triple {68#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {68#false} is VALID [2022-04-15 13:17:21,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-15 13:17:21,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-15 13:17:21,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-15 13:17:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 13:17:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:21,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981802112] [2022-04-15 13:17:21,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981802112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:21,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:21,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:17:21,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764408814] [2022-04-15 13:17:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764408814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:21,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:17:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187934345] [2022-04-15 13:17:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-15 13:17:21,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:21,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:21,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:21,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:17:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:21,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:17:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:17:21,604 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:24,059 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2022-04-15 13:17:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:17:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-15 13:17:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-15 13:17:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-15 13:17:24,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 171 transitions. [2022-04-15 13:17:24,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:24,236 INFO L225 Difference]: With dead ends: 127 [2022-04-15 13:17:24,236 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 13:17:24,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-04-15 13:17:24,240 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 81 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:24,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:17:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 13:17:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-04-15 13:17:24,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:24,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:24,262 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:24,263 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:24,266 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 13:17:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 13:17:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:24,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:24,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-15 13:17:24,268 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-15 13:17:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:24,271 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 13:17:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 13:17:24,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:24,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:24,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:24,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-15 13:17:24,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2022-04-15 13:17:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:24,275 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-15 13:17:24,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:24,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 65 transitions. [2022-04-15 13:17:24,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-15 13:17:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:17:24,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:24,333 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:24,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:17:24,334 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 1 times [2022-04-15 13:17:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:24,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981415000] [2022-04-15 13:17:24,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 2 times [2022-04-15 13:17:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:24,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2987907] [2022-04-15 13:17:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {601#true} is VALID [2022-04-15 13:17:24,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-15 13:17:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 13:17:24,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 13:17:24,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-15 13:17:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-15 13:17:24,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {601#true} is VALID [2022-04-15 13:17:24,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-15 13:17:24,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,480 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-15 13:17:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:17:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 13:17:24,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 13:17:24,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-15 13:17:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:17:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {601#true} is VALID [2022-04-15 13:17:24,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-15 13:17:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:17:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {601#true} is VALID [2022-04-15 13:17:24,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-15 13:17:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 13:17:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {601#true} is VALID [2022-04-15 13:17:24,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-15 13:17:24,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-15 13:17:24,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,503 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #152#return; {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 13:17:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:24,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {601#true} is VALID [2022-04-15 13:17:24,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-15 13:17:24,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #154#return; {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:24,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {601#true} is VALID [2022-04-15 13:17:24,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-15 13:17:24,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret20 := main(); {601#true} is VALID [2022-04-15 13:17:24,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {601#true} is VALID [2022-04-15 13:17:24,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {601#true} is VALID [2022-04-15 13:17:24,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 13:17:24,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 13:17:24,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,514 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-15 13:17:24,514 INFO L272 TraceCheckUtils]: 11: Hoare triple {601#true} call #t~ret14 := is_pow2(~n~0); {601#true} is VALID [2022-04-15 13:17:24,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-15 13:17:24,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {601#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {601#true} is VALID [2022-04-15 13:17:24,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-15 13:17:24,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L272 TraceCheckUtils]: 18: Hoare triple {601#true} call assume_abort_if_not(#t~ret14); {601#true} is VALID [2022-04-15 13:17:24,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 13:17:24,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-15 13:17:24,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {601#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {601#true} is VALID [2022-04-15 13:17:24,516 INFO L272 TraceCheckUtils]: 24: Hoare triple {601#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {639#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:24,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {601#true} is VALID [2022-04-15 13:17:24,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,517 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-15 13:17:24,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {601#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {601#true} is VALID [2022-04-15 13:17:24,518 INFO L272 TraceCheckUtils]: 29: Hoare triple {601#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {639#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:24,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {601#true} is VALID [2022-04-15 13:17:24,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,518 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-15 13:17:24,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {601#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {625#(= main_~i~1 0)} is VALID [2022-04-15 13:17:24,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {625#(= main_~i~1 0)} assume !(~i~1 < ~n~0); {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,519 INFO L272 TraceCheckUtils]: 35: Hoare triple {626#(<= main_~n~0 0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {639#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:24,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {601#true} is VALID [2022-04-15 13:17:24,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-15 13:17:24,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-15 13:17:24,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,521 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #152#return; {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {626#(<= main_~n~0 0)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,522 INFO L272 TraceCheckUtils]: 42: Hoare triple {626#(<= main_~n~0 0)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {639#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:24,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {601#true} is VALID [2022-04-15 13:17:24,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-15 13:17:24,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 13:17:24,523 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #154#return; {626#(<= main_~n~0 0)} is VALID [2022-04-15 13:17:24,523 INFO L272 TraceCheckUtils]: 47: Hoare triple {626#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {636#(<= |check_#in~n| 0)} is VALID [2022-04-15 13:17:24,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {636#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {637#(and (<= check_~n 0) (= check_~i~0 0))} is VALID [2022-04-15 13:17:24,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {637#(and (<= check_~n 0) (= check_~i~0 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {602#false} is VALID [2022-04-15 13:17:24,524 INFO L272 TraceCheckUtils]: 50: Hoare triple {602#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {602#false} is VALID [2022-04-15 13:17:24,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2022-04-15 13:17:24,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2022-04-15 13:17:24,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {602#false} assume !false; {602#false} is VALID [2022-04-15 13:17:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 13:17:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:24,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2987907] [2022-04-15 13:17:24,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2987907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:24,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:24,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:17:24,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:24,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981415000] [2022-04-15 13:17:24,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981415000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:24,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:24,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:17:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820679069] [2022-04-15 13:17:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-15 13:17:24,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:24,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:24,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:24,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:17:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:17:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:17:24,558 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:33,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:17:35,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:17:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:36,213 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 13:17:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:17:36,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-15 13:17:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 13:17:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 13:17:36,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 13:17:36,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:36,310 INFO L225 Difference]: With dead ends: 81 [2022-04-15 13:17:36,310 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 13:17:36,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:17:36,311 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:36,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 305 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 13:17:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 13:17:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-15 13:17:36,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:36,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:36,328 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:36,329 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:36,331 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-15 13:17:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-15 13:17:36,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:36,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:36,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 13:17:36,332 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 13:17:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:36,334 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-15 13:17:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-15 13:17:36,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:36,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:36,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:36,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:17:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-15 13:17:36,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2022-04-15 13:17:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:36,346 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-15 13:17:36,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:36,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 66 transitions. [2022-04-15 13:17:36,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-15 13:17:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 13:17:36,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:36,414 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:17:36,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:17:36,415 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 1 times [2022-04-15 13:17:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:36,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629223237] [2022-04-15 13:17:36,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 2 times [2022-04-15 13:17:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428526191] [2022-04-15 13:17:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1061#true} is VALID [2022-04-15 13:17:36,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 13:17:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:36,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:36,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 13:17:36,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 13:17:36,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1061#true} is VALID [2022-04-15 13:17:36,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 13:17:36,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,669 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 13:17:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:17:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:36,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:36,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 13:17:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:17:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:17:36,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:17:36,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1079#(= (select |#valid| |main_#t~malloc15.base|) 1)} #148#return; {1083#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:17:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:17:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:17:36,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:17:36,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:17:36,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:17:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume !(~space~0 < ~n); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #res := ~space~0; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume true; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,735 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1104#(= |#memory_int| |old(#memory_int)|)} {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 13:17:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume !(~space > 0); {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume true; {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #154#return; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1061#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:36,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {1061#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-15 13:17:36,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:36,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:36,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:36,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 13:17:36,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1079#(= (select |#valid| |main_#t~malloc15.base|) 1)} is VALID [2022-04-15 13:17:36,773 INFO L272 TraceCheckUtils]: 24: Hoare triple {1079#(= (select |#valid| |main_#t~malloc15.base|) 1)} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:17:36,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:17:36,775 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1105#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1079#(= (select |#valid| |main_#t~malloc15.base|) 1)} #148#return; {1083#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:17:36,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:17:36,776 INFO L272 TraceCheckUtils]: 29: Hoare triple {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:17:36,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:17:36,778 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1106#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:17:36,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {1084#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume !(~i~1 < ~n~0); {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,781 INFO L272 TraceCheckUtils]: 37: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume !(~space~0 < ~n); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} #res := ~space~0; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume true; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,783 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1104#(= |#memory_int| |old(#memory_int)|)} {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,784 INFO L272 TraceCheckUtils]: 44: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:36,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume !(~space > 0); {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume true; {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-15 13:17:36,787 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1107#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #154#return; {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:17:36,788 INFO L272 TraceCheckUtils]: 49: Hoare triple {1088#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {1098#(= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)} is VALID [2022-04-15 13:17:36,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {1098#(= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {1099#(= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0)} is VALID [2022-04-15 13:17:36,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {1099#(= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0)} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {1100#(= |check_#t~mem11| check_~sum~0)} is VALID [2022-04-15 13:17:36,789 INFO L272 TraceCheckUtils]: 52: Hoare triple {1100#(= |check_#t~mem11| check_~sum~0)} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {1101#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:36,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {1101#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1102#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:36,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {1102#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 13:17:36,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 13:17:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:17:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:36,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428526191] [2022-04-15 13:17:36,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428526191] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:36,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187916556] [2022-04-15 13:17:36,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:36,793 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-04-15 13:17:36,795 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-04-15 13:17:36,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:17:36,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:36,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 13:17:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:36,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:37,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-04-15 13:17:37,626 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-04-15 13:17:37,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2022-04-15 13:17:37,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {1061#true} is VALID [2022-04-15 13:17:37,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {1061#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1061#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,723 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L272 TraceCheckUtils]: 24: Hoare triple {1061#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-15 13:17:37,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1061#true} {1061#true} #148#return; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {1061#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L272 TraceCheckUtils]: 29: Hoare triple {1061#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1061#true} {1061#true} #150#return; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {1061#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {1061#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {1061#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {1061#true} is VALID [2022-04-15 13:17:37,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#true} assume !(~i~1 < ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,726 INFO L272 TraceCheckUtils]: 37: Hoare triple {1061#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {1061#true} is VALID [2022-04-15 13:17:37,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {1061#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1225#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:17:37,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {1225#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:17:37,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {1229#(<= |upsweep_#in~n| 1)} #res := ~space~0; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:17:37,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {1229#(<= |upsweep_#in~n| 1)} assume true; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:17:37,728 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1229#(<= |upsweep_#in~n| 1)} {1061#true} #152#return; {1239#(<= main_~n~0 1)} is VALID [2022-04-15 13:17:37,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {1239#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {1239#(<= main_~n~0 1)} is VALID [2022-04-15 13:17:37,728 INFO L272 TraceCheckUtils]: 44: Hoare triple {1239#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {1061#true} is VALID [2022-04-15 13:17:37,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {1061#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} is VALID [2022-04-15 13:17:37,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} assume !(~space > 0); {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} is VALID [2022-04-15 13:17:37,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} assume true; {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} is VALID [2022-04-15 13:17:37,731 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1249#(= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0)} {1239#(<= main_~n~0 1)} #154#return; {1259#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~n~0 4) (- 4))) 0) (<= main_~n~0 1))} is VALID [2022-04-15 13:17:37,733 INFO L272 TraceCheckUtils]: 49: Hoare triple {1259#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~n~0 4) (- 4))) 0) (<= main_~n~0 1))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {1263#(exists ((v_main_~n~0_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| |check_#in~a.base|) (+ (- 4) |check_#in~a.offset| (* 4 v_main_~n~0_BEFORE_CALL_2)))) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_2) (<= v_main_~n~0_BEFORE_CALL_2 1)))} is VALID [2022-04-15 13:17:37,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {1263#(exists ((v_main_~n~0_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| |check_#in~a.base|) (+ (- 4) |check_#in~a.offset| (* 4 v_main_~n~0_BEFORE_CALL_2)))) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_2) (<= v_main_~n~0_BEFORE_CALL_2 1)))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {1267#(and (= check_~sum~0 0) (<= 0 check_~i~0) (exists ((v_main_~n~0_BEFORE_CALL_2 Int)) (and (<= check_~n v_main_~n~0_BEFORE_CALL_2) (<= v_main_~n~0_BEFORE_CALL_2 1) (= (select (select |#memory_int| check_~a.base) (+ (- 4) check_~a.offset (* 4 v_main_~n~0_BEFORE_CALL_2))) 0))))} is VALID [2022-04-15 13:17:37,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {1267#(and (= check_~sum~0 0) (<= 0 check_~i~0) (exists ((v_main_~n~0_BEFORE_CALL_2 Int)) (and (<= check_~n v_main_~n~0_BEFORE_CALL_2) (<= v_main_~n~0_BEFORE_CALL_2 1) (= (select (select |#memory_int| check_~a.base) (+ (- 4) check_~a.offset (* 4 v_main_~n~0_BEFORE_CALL_2))) 0))))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {1271#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} is VALID [2022-04-15 13:17:37,737 INFO L272 TraceCheckUtils]: 52: Hoare triple {1271#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {1275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:37,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {1275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:37,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {1279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 13:17:37,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 13:17:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:17:37,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187916556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:37,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:17:37,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2022-04-15 13:17:37,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629223237] [2022-04-15 13:17:37,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629223237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:37,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:37,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:17:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916387379] [2022-04-15 13:17:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-04-15 13:17:37,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:37,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:37,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:37,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:17:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:37,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:17:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:17:37,773 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,677 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 13:17:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:17:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2022-04-15 13:17:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-15 13:17:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-15 13:17:57,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2022-04-15 13:17:57,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:57,757 INFO L225 Difference]: With dead ends: 83 [2022-04-15 13:17:57,757 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 13:17:57,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:17:57,760 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:57,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 494 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-04-15 13:17:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 13:17:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-04-15 13:17:57,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:57,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 13:17:57,787 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 13:17:57,787 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 13:17:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,789 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 13:17:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 13:17:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:57,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:57,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Second operand 81 states. [2022-04-15 13:17:57,791 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Second operand 81 states. [2022-04-15 13:17:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,793 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 13:17:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 13:17:57,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:57,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:57,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:57,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 13:17:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-04-15 13:17:57,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 56 [2022-04-15 13:17:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:57,797 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-04-15 13:17:57,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:57,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 90 transitions. [2022-04-15 13:17:57,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 13:17:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 13:17:57,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:57,883 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:17:57,902 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-04-15 13:17:58,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:58,084 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 1 times [2022-04-15 13:17:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993176546] [2022-04-15 13:17:58,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 2 times [2022-04-15 13:17:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:58,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77433788] [2022-04-15 13:17:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1771#true} is VALID [2022-04-15 13:17:58,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 13:17:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:58,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:58,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 13:17:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 13:17:58,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1771#true} is VALID [2022-04-15 13:17:58,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 13:17:58,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,192 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 13:17:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:17:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:58,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:58,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 13:17:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:17:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:58,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 13:17:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:17:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:58,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 13:17:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:17:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1771#true} is VALID [2022-04-15 13:17:58,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} is VALID [2022-04-15 13:17:58,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-15 13:17:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 13:17:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1771#true} is VALID [2022-04-15 13:17:58,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-15 13:17:58,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-15 13:17:58,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:58,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1771#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-15 13:17:58,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1771#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 13:17:58,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {1771#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:58,262 INFO L272 TraceCheckUtils]: 24: Hoare triple {1771#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {1811#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:58,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:58,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,263 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 13:17:58,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {1771#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:58,265 INFO L272 TraceCheckUtils]: 29: Hoare triple {1771#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {1811#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:58,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:58,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,265 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 13:17:58,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {1771#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {1795#(= main_~i~1 0)} is VALID [2022-04-15 13:17:58,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {1795#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {1796#(and (<= (+ main_~i~1 1) main_~n~0) (= main_~i~1 0))} is VALID [2022-04-15 13:17:58,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {1796#(and (<= (+ main_~i~1 1) main_~n~0) (= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {1797#(<= 1 main_~n~0)} is VALID [2022-04-15 13:17:58,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {1797#(<= 1 main_~n~0)} assume !(~i~1 < ~n~0); {1797#(<= 1 main_~n~0)} is VALID [2022-04-15 13:17:58,273 INFO L272 TraceCheckUtils]: 37: Hoare triple {1797#(<= 1 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {1811#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:58,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1771#true} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {1771#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-15 13:17:58,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {1772#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L272 TraceCheckUtils]: 47: Hoare triple {1772#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {1811#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {1811#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1771#true} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:58,275 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L272 TraceCheckUtils]: 52: Hoare triple {1772#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {1772#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {1772#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L272 TraceCheckUtils]: 55: Hoare triple {1772#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {1772#false} ~cond := #in~cond; {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {1772#false} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 13:17:58,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 13:17:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 13:17:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:58,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77433788] [2022-04-15 13:17:58,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77433788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:58,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563183867] [2022-04-15 13:17:58,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:58,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:58,281 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-04-15 13:17:58,282 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-04-15 13:17:58,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:17:58,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:58,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 13:17:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:58,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-04-15 13:17:59,704 INFO L356 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-04-15 13:17:59,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 10 [2022-04-15 13:17:59,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {1771#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:59,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {1771#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 13:17:59,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {1771#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {1771#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {1771#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L272 TraceCheckUtils]: 29: Hoare triple {1771#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {1771#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {1771#true} is VALID [2022-04-15 13:17:59,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {1771#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {1771#true} is VALID [2022-04-15 13:17:59,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {1771#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {1771#true} is VALID [2022-04-15 13:17:59,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {1771#true} assume !(~i~1 < ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,855 INFO L272 TraceCheckUtils]: 37: Hoare triple {1771#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {1771#true} is VALID [2022-04-15 13:17:59,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {1771#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {1930#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:17:59,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {1930#(<= |upsweep_#in~n| upsweep_~n)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {1930#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:17:59,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {1930#(<= |upsweep_#in~n| upsweep_~n)} assume !(~left~0 < ~n); {1930#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:17:59,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {1930#(<= |upsweep_#in~n| upsweep_~n)} ~space~0 := 2 * ~space~0; {1930#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:17:59,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {1930#(<= |upsweep_#in~n| upsweep_~n)} assume !(~space~0 < ~n); {1943#(<= |upsweep_#in~n| upsweep_~space~0)} is VALID [2022-04-15 13:17:59,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= |upsweep_#in~n| upsweep_~space~0)} #res := ~space~0; {1947#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-15 13:17:59,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= |upsweep_#in~n| |upsweep_#res|)} assume true; {1947#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-15 13:17:59,858 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1947#(<= |upsweep_#in~n| |upsweep_#res|)} {1771#true} #152#return; {1954#(<= main_~n~0 |main_#t~ret19|)} is VALID [2022-04-15 13:17:59,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {1954#(<= main_~n~0 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {1958#(<= main_~n~0 main_~space~1)} is VALID [2022-04-15 13:17:59,859 INFO L272 TraceCheckUtils]: 47: Hoare triple {1958#(<= main_~n~0 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {1771#true} is VALID [2022-04-15 13:17:59,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {1771#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {1965#(and (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space)))} is VALID [2022-04-15 13:17:59,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {1965#(and (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space)))} assume !(~space > 0); {1969#(and (<= (div |downsweep_#in~space| 2) 0) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0))} is VALID [2022-04-15 13:17:59,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {1969#(and (<= (div |downsweep_#in~space| 2) 0) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0))} assume true; {1969#(and (<= (div |downsweep_#in~space| 2) 0) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0))} is VALID [2022-04-15 13:17:59,862 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1969#(and (<= (div |downsweep_#in~space| 2) 0) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|)) 0))} {1958#(<= main_~n~0 main_~space~1)} #154#return; {1976#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~n~0 4) (- 4))) 0) (< (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1))} is VALID [2022-04-15 13:17:59,869 INFO L272 TraceCheckUtils]: 52: Hoare triple {1976#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~n~0 4) (- 4))) 0) (< (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {1980#(exists ((aux_mod_v_main_~n~0_BEFORE_CALL_4_53 Int) (aux_div_v_main_~n~0_BEFORE_CALL_4_53 Int)) (and (<= (+ aux_mod_v_main_~n~0_BEFORE_CALL_4_53 |check_#in~n|) (+ (* 2 aux_div_v_main_~n~0_BEFORE_CALL_4_53) 1)) (= (select (select |#memory_int| |check_#in~a.base|) (+ (* 8 aux_div_v_main_~n~0_BEFORE_CALL_4_53) |check_#in~a.offset| (* aux_mod_v_main_~n~0_BEFORE_CALL_4_53 (- 4)))) 0) (< aux_div_v_main_~n~0_BEFORE_CALL_4_53 1) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_4_53) (< aux_mod_v_main_~n~0_BEFORE_CALL_4_53 2)))} is VALID [2022-04-15 13:17:59,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {1980#(exists ((aux_mod_v_main_~n~0_BEFORE_CALL_4_53 Int) (aux_div_v_main_~n~0_BEFORE_CALL_4_53 Int)) (and (<= (+ aux_mod_v_main_~n~0_BEFORE_CALL_4_53 |check_#in~n|) (+ (* 2 aux_div_v_main_~n~0_BEFORE_CALL_4_53) 1)) (= (select (select |#memory_int| |check_#in~a.base|) (+ (* 8 aux_div_v_main_~n~0_BEFORE_CALL_4_53) |check_#in~a.offset| (* aux_mod_v_main_~n~0_BEFORE_CALL_4_53 (- 4)))) 0) (< aux_div_v_main_~n~0_BEFORE_CALL_4_53 1) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_4_53) (< aux_mod_v_main_~n~0_BEFORE_CALL_4_53 2)))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {1984#(and (exists ((aux_mod_v_main_~n~0_BEFORE_CALL_4_53 Int) (aux_div_v_main_~n~0_BEFORE_CALL_4_53 Int)) (and (= (select (select |#memory_int| check_~a.base) (+ (* 8 aux_div_v_main_~n~0_BEFORE_CALL_4_53) check_~a.offset (* aux_mod_v_main_~n~0_BEFORE_CALL_4_53 (- 4)))) 0) (<= (+ aux_mod_v_main_~n~0_BEFORE_CALL_4_53 check_~n) (+ (* 2 aux_div_v_main_~n~0_BEFORE_CALL_4_53) 1)) (< aux_div_v_main_~n~0_BEFORE_CALL_4_53 1) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_4_53) (< aux_mod_v_main_~n~0_BEFORE_CALL_4_53 2))) (= check_~sum~0 0) (<= 0 check_~i~0))} is VALID [2022-04-15 13:17:59,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {1984#(and (exists ((aux_mod_v_main_~n~0_BEFORE_CALL_4_53 Int) (aux_div_v_main_~n~0_BEFORE_CALL_4_53 Int)) (and (= (select (select |#memory_int| check_~a.base) (+ (* 8 aux_div_v_main_~n~0_BEFORE_CALL_4_53) check_~a.offset (* aux_mod_v_main_~n~0_BEFORE_CALL_4_53 (- 4)))) 0) (<= (+ aux_mod_v_main_~n~0_BEFORE_CALL_4_53 check_~n) (+ (* 2 aux_div_v_main_~n~0_BEFORE_CALL_4_53) 1)) (< aux_div_v_main_~n~0_BEFORE_CALL_4_53 1) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_4_53) (< aux_mod_v_main_~n~0_BEFORE_CALL_4_53 2))) (= check_~sum~0 0) (<= 0 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {1988#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} is VALID [2022-04-15 13:17:59,871 INFO L272 TraceCheckUtils]: 55: Hoare triple {1988#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {1992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:59,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {1992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:59,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {1996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 13:17:59,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 13:17:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:17:59,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:59,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563183867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:59,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:17:59,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2022-04-15 13:17:59,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:59,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993176546] [2022-04-15 13:17:59,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993176546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:59,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:59,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:17:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000592323] [2022-04-15 13:17:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2022-04-15 13:17:59,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:59,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:17:59,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:59,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:17:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:17:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:17:59,950 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:16,020 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-15 13:18:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:18:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2022-04-15 13:18:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 13:18:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 13:18:16,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-15 13:18:16,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:16,094 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:18:16,094 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 13:18:16,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:18:16,095 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:16,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 573 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-04-15 13:18:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 13:18:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-04-15 13:18:16,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:16,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-04-15 13:18:16,136 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-04-15 13:18:16,136 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-04-15 13:18:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:16,138 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 13:18:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 13:18:16,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:16,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:16,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Second operand 99 states. [2022-04-15 13:18:16,140 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Second operand 99 states. [2022-04-15 13:18:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:16,142 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 13:18:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 13:18:16,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:16,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:16,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:16,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-04-15 13:18:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-04-15 13:18:16,145 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 59 [2022-04-15 13:18:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:16,145 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-04-15 13:18:16,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:16,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 95 transitions. [2022-04-15 13:18:16,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-15 13:18:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 13:18:16,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:16,249 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:18:16,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 13:18:16,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:18:16,450 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 1 times [2022-04-15 13:18:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462381386] [2022-04-15 13:18:16,451 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 2 times [2022-04-15 13:18:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:16,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737459185] [2022-04-15 13:18:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {2612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2572#true} is VALID [2022-04-15 13:18:16,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 13:18:16,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:16,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:16,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 13:18:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:18:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 13:18:16,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {2572#true} is VALID [2022-04-15 13:18:16,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 13:18:16,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,549 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 13:18:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:18:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:16,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:16,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 13:18:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:18:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:16,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 13:18:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:18:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:16,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 13:18:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:18:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {2572#true} is VALID [2022-04-15 13:18:16,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-15 13:18:16,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-15 13:18:16,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,572 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2598#(<= main_~n~0 1)} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 13:18:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2614#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {2615#(and (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~right~1))} is VALID [2022-04-15 13:18:16,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#(and (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~right~1))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {2616#(and (= downsweep_~n |downsweep_#in~n|) (<= 2 downsweep_~n))} is VALID [2022-04-15 13:18:16,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {2616#(and (= downsweep_~n |downsweep_#in~n|) (<= 2 downsweep_~n))} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,637 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-15 13:18:16,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:16,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2572#true} is VALID [2022-04-15 13:18:16,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 13:18:16,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 13:18:16,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {2572#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {2572#true} is VALID [2022-04-15 13:18:16,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {2572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 13:18:16,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 13:18:16,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:16,645 INFO L272 TraceCheckUtils]: 24: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {2613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:16,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:16,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,646 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 13:18:16,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {2572#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:16,647 INFO L272 TraceCheckUtils]: 29: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {2613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:16,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:16,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,647 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 13:18:16,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {2572#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {2596#(= main_~i~1 0)} is VALID [2022-04-15 13:18:16,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {2596#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {2596#(= main_~i~1 0)} is VALID [2022-04-15 13:18:16,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {2596#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {2597#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:16,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {2597#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:16,659 INFO L272 TraceCheckUtils]: 37: Hoare triple {2598#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {2613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:16,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {2572#true} is VALID [2022-04-15 13:18:16,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-15 13:18:16,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-15 13:18:16,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:16,660 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2572#true} {2598#(<= main_~n~0 1)} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:16,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {2598#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:16,661 INFO L272 TraceCheckUtils]: 44: Hoare triple {2598#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {2613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:16,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {2613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2614#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {2614#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {2615#(and (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~right~1))} is VALID [2022-04-15 13:18:16,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {2615#(and (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~right~1))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {2616#(and (= downsweep_~n |downsweep_#in~n|) (<= 2 downsweep_~n))} is VALID [2022-04-15 13:18:16,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {2616#(and (= downsweep_~n |downsweep_#in~n|) (<= 2 downsweep_~n))} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:16,665 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-15 13:18:16,665 INFO L272 TraceCheckUtils]: 53: Hoare triple {2573#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {2573#false} is VALID [2022-04-15 13:18:16,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {2573#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {2573#false} is VALID [2022-04-15 13:18:16,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {2573#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {2573#false} is VALID [2022-04-15 13:18:16,666 INFO L272 TraceCheckUtils]: 56: Hoare triple {2573#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {2573#false} is VALID [2022-04-15 13:18:16,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 13:18:16,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 13:18:16,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 13:18:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 13:18:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737459185] [2022-04-15 13:18:16,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737459185] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:16,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491048917] [2022-04-15 13:18:16,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:16,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:16,669 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-04-15 13:18:16,703 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-04-15 13:18:16,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:16,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:16,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:18:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:16,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:17,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-15 13:18:17,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2572#true} is VALID [2022-04-15 13:18:17,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {2572#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {2572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L272 TraceCheckUtils]: 24: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {2572#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,088 INFO L272 TraceCheckUtils]: 29: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {2572#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {2572#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {2572#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L272 TraceCheckUtils]: 37: Hoare triple {2572#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {2572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {2735#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:18:17,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {2735#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,091 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2739#(<= |upsweep_#in~n| 1)} {2572#true} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:17,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {2598#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:17,092 INFO L272 TraceCheckUtils]: 44: Hoare triple {2598#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {2572#true} is VALID [2022-04-15 13:18:17,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {2572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2758#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {2758#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {2762#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 2)))} is VALID [2022-04-15 13:18:17,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {2762#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 2)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,095 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-15 13:18:17,095 INFO L272 TraceCheckUtils]: 53: Hoare triple {2573#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {2573#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {2573#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L272 TraceCheckUtils]: 56: Hoare triple {2573#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 13:18:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:17,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:17,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L272 TraceCheckUtils]: 56: Hoare triple {2573#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {2573#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {2573#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {2573#false} is VALID [2022-04-15 13:18:17,800 INFO L272 TraceCheckUtils]: 53: Hoare triple {2573#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {2573#false} is VALID [2022-04-15 13:18:17,801 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-15 13:18:17,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {2841#(or (<= 2 |downsweep_#in~n|) (not (< downsweep_~right~1 downsweep_~n)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 13:18:17,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {2845#(or (<= 2 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2)) 1))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {2841#(or (<= 2 |downsweep_#in~n|) (not (< downsweep_~right~1 downsweep_~n)))} is VALID [2022-04-15 13:18:17,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {2572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {2845#(or (<= 2 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2)) 1))} is VALID [2022-04-15 13:18:17,804 INFO L272 TraceCheckUtils]: 44: Hoare triple {2598#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {2572#true} is VALID [2022-04-15 13:18:17,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {2598#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:17,805 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2739#(<= |upsweep_#in~n| 1)} {2572#true} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:17,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {2867#(or (< upsweep_~space~0 upsweep_~n) (<= |upsweep_#in~n| 1))} assume !(~space~0 < ~n); {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {2572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {2867#(or (< upsweep_~space~0 upsweep_~n) (<= |upsweep_#in~n| 1))} is VALID [2022-04-15 13:18:17,807 INFO L272 TraceCheckUtils]: 37: Hoare triple {2572#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {2572#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {2572#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {2572#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L272 TraceCheckUtils]: 29: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {2572#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L272 TraceCheckUtils]: 24: Hoare triple {2572#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {2572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {2572#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 13:18:17,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2572#true} is VALID [2022-04-15 13:18:17,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-15 13:18:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491048917] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:18:17,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 18 [2022-04-15 13:18:17,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:17,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462381386] [2022-04-15 13:18:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462381386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:17,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400171971] [2022-04-15 13:18:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:17,812 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-04-15 13:18:17,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:17,813 INFO L86 InductivityCheck]: Starting inductivity 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:17,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:17,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:18:17,845 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:27,005 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-04-15 13:18:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:18:27,005 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-04-15 13:18:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:27,005 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-15 13:18:27,007 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-15 13:18:27,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 99 transitions. [2022-04-15 13:18:27,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:27,072 INFO L225 Difference]: With dead ends: 93 [2022-04-15 13:18:27,072 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 13:18:27,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:18:27,073 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:27,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 335 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 13:18:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 13:18:27,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:27,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:27,145 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:27,145 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:27,148 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 13:18:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 13:18:27,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:27,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:27,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Second operand 81 states. [2022-04-15 13:18:27,149 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Second operand 81 states. [2022-04-15 13:18:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:27,151 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 13:18:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 13:18:27,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:27,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:27,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:27,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-04-15 13:18:27,154 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 60 [2022-04-15 13:18:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:27,154 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-04-15 13:18:27,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:18:27,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 94 transitions. [2022-04-15 13:18:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-04-15 13:18:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 13:18:27,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:27,274 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2022-04-15 13:18:27,291 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-04-15 13:18:27,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:27,475 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 1 times [2022-04-15 13:18:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:27,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674701431] [2022-04-15 13:18:27,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 2 times [2022-04-15 13:18:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:27,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740130846] [2022-04-15 13:18:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {3536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3494#true} is VALID [2022-04-15 13:18:27,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 13:18:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 13:18:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:18:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 13:18:27,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {3494#true} is VALID [2022-04-15 13:18:27,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 13:18:27,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,556 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 13:18:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:18:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 13:18:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:18:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 13:18:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:18:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 13:18:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:18:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {3494#true} is VALID [2022-04-15 13:18:27,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} is VALID [2022-04-15 13:18:27,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-15 13:18:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 13:18:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:27,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 13:18:27,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {3494#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 13:18:27,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:27,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 13:18:27,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {3494#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3494#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 13:18:27,594 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 13:18:27,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,595 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 13:18:27,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {3494#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,604 INFO L272 TraceCheckUtils]: 24: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {3537#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:27,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,604 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 13:18:27,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {3494#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,605 INFO L272 TraceCheckUtils]: 29: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {3537#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:27,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,605 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 13:18:27,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {3518#(= main_~i~1 0)} is VALID [2022-04-15 13:18:27,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {3518#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {3519#(and (<= (+ main_~i~1 1) main_~n~0) (= main_~i~1 0))} is VALID [2022-04-15 13:18:27,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {3519#(and (<= (+ main_~i~1 1) main_~n~0) (= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {3520#(<= 1 main_~n~0)} is VALID [2022-04-15 13:18:27,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {3520#(<= 1 main_~n~0)} assume !(~i~1 < ~n~0); {3520#(<= 1 main_~n~0)} is VALID [2022-04-15 13:18:27,607 INFO L272 TraceCheckUtils]: 37: Hoare triple {3520#(<= 1 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {3537#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:27,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {3494#true} is VALID [2022-04-15 13:18:27,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {3494#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} is VALID [2022-04-15 13:18:27,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-15 13:18:27,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-15 13:18:27,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {3495#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L272 TraceCheckUtils]: 47: Hoare triple {3495#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {3537#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {3537#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {3494#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,609 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L272 TraceCheckUtils]: 55: Hoare triple {3495#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {3495#false} is VALID [2022-04-15 13:18:27,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {3495#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {3495#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L272 TraceCheckUtils]: 58: Hoare triple {3495#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 13:18:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:27,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740130846] [2022-04-15 13:18:27,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740130846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:27,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508991318] [2022-04-15 13:18:27,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:27,628 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-04-15 13:18:27,629 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-04-15 13:18:27,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:27,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:27,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:18:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:27,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:27,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {3494#true} is VALID [2022-04-15 13:18:27,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {3494#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {3494#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:27,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {3494#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L272 TraceCheckUtils]: 24: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {3494#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L272 TraceCheckUtils]: 29: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:27,949 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 13:18:27,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {3641#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:27,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {3641#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {3641#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:27,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {3641#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {3648#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:27,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {3648#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {3652#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:27,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {3652#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {3494#true} is VALID [2022-04-15 13:18:27,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {3659#(and (<= upsweep_~n |upsweep_#in~n|) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:18:27,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {3659#(and (<= upsweep_~n |upsweep_#in~n|) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~left~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {3663#(< 1 |upsweep_#in~n|)} ~space~0 := 2 * ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~space~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:27,955 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3663#(< 1 |upsweep_#in~n|)} {3652#(<= main_~n~0 1)} #152#return; {3495#false} is VALID [2022-04-15 13:18:27,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {3495#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {3495#false} is VALID [2022-04-15 13:18:27,955 INFO L272 TraceCheckUtils]: 47: Hoare triple {3495#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {3495#false} is VALID [2022-04-15 13:18:27,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {3495#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3495#false} is VALID [2022-04-15 13:18:27,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {3495#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {3495#false} assume !(~right~1 < ~n); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {3495#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {3495#false} assume !(~space > 0); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3495#false} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L272 TraceCheckUtils]: 55: Hoare triple {3495#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {3495#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {3495#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L272 TraceCheckUtils]: 58: Hoare triple {3495#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 13:18:27,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 13:18:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:27,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:28,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L272 TraceCheckUtils]: 58: Hoare triple {3495#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {3495#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {3495#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L272 TraceCheckUtils]: 55: Hoare triple {3495#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 13:18:28,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {3494#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:28,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 13:18:28,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 13:18:28,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {3494#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {3494#true} is VALID [2022-04-15 13:18:28,252 INFO L272 TraceCheckUtils]: 47: Hoare triple {3495#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {3494#true} is VALID [2022-04-15 13:18:28,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {3495#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {3495#false} is VALID [2022-04-15 13:18:28,253 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3663#(< 1 |upsweep_#in~n|)} {3652#(<= main_~n~0 1)} #152#return; {3495#false} is VALID [2022-04-15 13:18:28,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~space~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {3663#(< 1 |upsweep_#in~n|)} ~space~0 := 2 * ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~left~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {3799#(or (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 upsweep_~n)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:28,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {3799#(or (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 upsweep_~n)))} is VALID [2022-04-15 13:18:28,255 INFO L272 TraceCheckUtils]: 37: Hoare triple {3652#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {3494#true} is VALID [2022-04-15 13:18:28,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {3648#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {3652#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:28,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {3641#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {3648#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:28,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {3641#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {3641#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:28,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {3641#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:28,256 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L272 TraceCheckUtils]: 29: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {3494#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L272 TraceCheckUtils]: 24: Hoare triple {3494#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {3494#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:28,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {3494#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {3494#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {3494#true} is VALID [2022-04-15 13:18:28,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 13:18:28,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 13:18:28,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 13:18:28,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3494#true} is VALID [2022-04-15 13:18:28,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-15 13:18:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:28,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508991318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:28,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:18:28,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 13:18:28,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674701431] [2022-04-15 13:18:28,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674701431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:28,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:28,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465223696] [2022-04-15 13:18:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-04-15 13:18:28,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:28,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:28,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:28,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:18:28,303 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:34,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:18:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,570 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-15 13:18:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:18:37,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-04-15 13:18:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 13:18:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 13:18:37,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-15 13:18:37,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:37,651 INFO L225 Difference]: With dead ends: 125 [2022-04-15 13:18:37,651 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 13:18:37,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:18:37,652 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:37,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 54 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 231 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 13:18:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 13:18:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-15 13:18:37,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:37,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:37,720 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:37,720 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,722 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 13:18:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 13:18:37,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Second operand 83 states. [2022-04-15 13:18:37,723 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Second operand 83 states. [2022-04-15 13:18:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,724 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 13:18:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 13:18:37,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:37,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-04-15 13:18:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2022-04-15 13:18:37,727 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 62 [2022-04-15 13:18:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:37,727 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2022-04-15 13:18:37,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:37,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 95 transitions. [2022-04-15 13:18:37,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 13:18:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 13:18:37,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:37,828 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:18:37,845 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-04-15 13:18:38,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:38,029 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 1 times [2022-04-15 13:18:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:38,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126103989] [2022-04-15 13:18:38,030 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 2 times [2022-04-15 13:18:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:38,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403693331] [2022-04-15 13:18:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {4550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4507#true} is VALID [2022-04-15 13:18:38,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 13:18:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 13:18:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:18:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 13:18:38,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {4507#true} is VALID [2022-04-15 13:18:38,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 13:18:38,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,129 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 13:18:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:18:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 13:18:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:18:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 13:18:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:18:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 13:18:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:18:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {4507#true} is VALID [2022-04-15 13:18:38,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-15 13:18:38,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-15 13:18:38,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,151 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 13:18:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {4507#true} is VALID [2022-04-15 13:18:38,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 13:18:38,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 13:18:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4544#(and (<= check_~n 1) (= check_~i~0 0))} #158#return; {4544#(and (<= check_~n 1) (= check_~i~0 0))} is VALID [2022-04-15 13:18:38,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {4507#true} call ULTIMATE.init(); {4550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:38,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {4550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4507#true} is VALID [2022-04-15 13:18:38,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 13:18:38,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {4507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-15 13:18:38,160 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-15 13:18:38,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,161 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 13:18:38,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {4507#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,162 INFO L272 TraceCheckUtils]: 24: Hoare triple {4507#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {4551#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:38,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,162 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 13:18:38,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {4507#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,162 INFO L272 TraceCheckUtils]: 29: Hoare triple {4507#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {4551#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:38,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,163 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 13:18:38,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {4507#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {4531#(= main_~i~1 0)} is VALID [2022-04-15 13:18:38,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {4531#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {4531#(= main_~i~1 0)} is VALID [2022-04-15 13:18:38,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {4531#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {4532#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:38,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {4532#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,165 INFO L272 TraceCheckUtils]: 37: Hoare triple {4533#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {4551#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:38,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {4507#true} is VALID [2022-04-15 13:18:38,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-15 13:18:38,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-15 13:18:38,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,167 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {4533#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,168 INFO L272 TraceCheckUtils]: 44: Hoare triple {4533#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {4551#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:38,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {4551#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {4507#true} is VALID [2022-04-15 13:18:38,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 13:18:38,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,168 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,169 INFO L272 TraceCheckUtils]: 49: Hoare triple {4533#(<= main_~n~0 1)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {4543#(<= |check_#in~n| 1)} is VALID [2022-04-15 13:18:38,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {4543#(<= |check_#in~n| 1)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {4544#(and (<= check_~n 1) (= check_~i~0 0))} is VALID [2022-04-15 13:18:38,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {4544#(and (<= check_~n 1) (= check_~i~0 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {4544#(and (<= check_~n 1) (= check_~i~0 0))} is VALID [2022-04-15 13:18:38,170 INFO L272 TraceCheckUtils]: 52: Hoare triple {4544#(and (<= check_~n 1) (= check_~i~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {4507#true} is VALID [2022-04-15 13:18:38,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,170 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4507#true} {4544#(and (<= check_~n 1) (= check_~i~0 0))} #158#return; {4544#(and (<= check_~n 1) (= check_~i~0 0))} is VALID [2022-04-15 13:18:38,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {4544#(and (<= check_~n 1) (= check_~i~0 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {4544#(and (<= check_~n 1) (= check_~i~0 0))} is VALID [2022-04-15 13:18:38,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {4544#(and (<= check_~n 1) (= check_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4549#(<= check_~n check_~i~0)} is VALID [2022-04-15 13:18:38,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {4549#(<= check_~n check_~i~0)} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {4508#false} is VALID [2022-04-15 13:18:38,172 INFO L272 TraceCheckUtils]: 60: Hoare triple {4508#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {4508#false} is VALID [2022-04-15 13:18:38,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-15 13:18:38,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-15 13:18:38,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-15 13:18:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 13:18:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403693331] [2022-04-15 13:18:38,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403693331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864306879] [2022-04-15 13:18:38,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:38,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:38,173 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-04-15 13:18:38,174 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-04-15 13:18:38,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:38,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:38,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:18:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:38,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {4507#true} call ULTIMATE.init(); {4507#true} is VALID [2022-04-15 13:18:38,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4507#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {4507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 13:18:38,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {4507#true} is VALID [2022-04-15 13:18:38,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 13:18:38,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,552 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 13:18:38,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {4507#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L272 TraceCheckUtils]: 24: Hoare triple {4507#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {4507#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L272 TraceCheckUtils]: 29: Hoare triple {4507#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {4507#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {4507#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {4507#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {4507#true} assume !(~i~1 < ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L272 TraceCheckUtils]: 37: Hoare triple {4507#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {4507#true} is VALID [2022-04-15 13:18:38,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {4507#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {4669#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:18:38,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {4669#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:38,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {4673#(<= |upsweep_#in~n| 1)} #res := ~space~0; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:38,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {4673#(<= |upsweep_#in~n| 1)} assume true; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 13:18:38,557 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4673#(<= |upsweep_#in~n| 1)} {4507#true} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {4533#(<= main_~n~0 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,557 INFO L272 TraceCheckUtils]: 44: Hoare triple {4533#(<= main_~n~0 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {4507#true} is VALID [2022-04-15 13:18:38,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {4507#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {4507#true} is VALID [2022-04-15 13:18:38,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 13:18:38,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,557 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:38,558 INFO L272 TraceCheckUtils]: 49: Hoare triple {4533#(<= main_~n~0 1)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {4543#(<= |check_#in~n| 1)} is VALID [2022-04-15 13:18:38,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {4543#(<= |check_#in~n| 1)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:18:38,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:18:38,559 INFO L272 TraceCheckUtils]: 52: Hoare triple {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {4507#true} is VALID [2022-04-15 13:18:38,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 13:18:38,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 13:18:38,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 13:18:38,559 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4507#true} {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} #158#return; {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:18:38,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:18:38,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {4707#(and (<= check_~n 1) (<= 0 check_~i~0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4732#(and (<= check_~n 1) (<= 1 check_~i~0))} is VALID [2022-04-15 13:18:38,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {4732#(and (<= check_~n 1) (<= 1 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {4508#false} is VALID [2022-04-15 13:18:38,560 INFO L272 TraceCheckUtils]: 60: Hoare triple {4508#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {4508#false} is VALID [2022-04-15 13:18:38,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-15 13:18:38,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-15 13:18:38,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-15 13:18:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:18:38,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:38,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864306879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:38,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:18:38,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2022-04-15 13:18:38,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:38,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126103989] [2022-04-15 13:18:38,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126103989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:38,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:38,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27612749] [2022-04-15 13:18:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:38,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-15 13:18:38,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:38,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:18:38,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:38,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:18:38,590 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:18:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:54,176 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-15 13:18:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:18:54,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-15 13:18:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:18:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-15 13:18:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:18:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-15 13:18:54,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-15 13:18:54,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:54,242 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:18:54,242 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 13:18:54,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:18:54,243 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:54,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 368 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 13:18:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-15 13:18:54,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:54,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:18:54,287 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:18:54,287 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:18:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:54,289 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-15 13:18:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-15 13:18:54,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:54,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:54,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 79 states. [2022-04-15 13:18:54,289 INFO L87 Difference]: Start difference. First operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 79 states. [2022-04-15 13:18:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:54,291 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-15 13:18:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-15 13:18:54,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:54,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:54,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:54,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:18:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-04-15 13:18:54,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 64 [2022-04-15 13:18:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:54,293 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-04-15 13:18:54,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:18:54,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 80 transitions. [2022-04-15 13:18:54,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-04-15 13:18:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 13:18:54,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:54,383 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2022-04-15 13:18:54,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 13:18:54,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:54,599 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 1 times [2022-04-15 13:18:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:54,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857837214] [2022-04-15 13:18:54,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 2 times [2022-04-15 13:18:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:54,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179472050] [2022-04-15 13:18:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5255#true} is VALID [2022-04-15 13:18:54,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 13:18:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:54,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:54,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 13:18:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:18:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 13:18:54,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {5255#true} is VALID [2022-04-15 13:18:54,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 13:18:54,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,680 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 13:18:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:18:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:54,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:54,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 13:18:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:18:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:54,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 13:18:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:18:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:54,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 13:18:54,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 13:18:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {5300#(and (= |upsweep_#in~n| upsweep_~n) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:18:54,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {5300#(and (= |upsweep_#in~n| upsweep_~n) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !(~left~0 < ~n); {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} ~space~0 := 2 * ~space~0; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,746 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-15 13:18:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 13:18:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:54,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 13:18:54,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 13:18:54,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {5255#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:54,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 13:18:54,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:54,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {5298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {5255#true} is VALID [2022-04-15 13:18:54,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {5255#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {5255#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:54,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,757 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 13:18:54,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {5255#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:54,772 INFO L272 TraceCheckUtils]: 24: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {5299#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:54,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:54,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,772 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 13:18:54,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {5255#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:54,773 INFO L272 TraceCheckUtils]: 29: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {5299#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:54,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:54,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,773 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 13:18:54,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {5255#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {5279#(= main_~i~1 0)} is VALID [2022-04-15 13:18:54,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {5279#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {5279#(= main_~i~1 0)} is VALID [2022-04-15 13:18:54,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {5279#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {5280#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:54,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {5280#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {5281#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:54,774 INFO L272 TraceCheckUtils]: 37: Hoare triple {5281#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {5299#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:54,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {5300#(and (= |upsweep_#in~n| upsweep_~n) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:18:54,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {5300#(and (= |upsweep_#in~n| upsweep_~n) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !(~left~0 < ~n); {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} ~space~0 := 2 * ~space~0; {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} is VALID [2022-04-15 13:18:54,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {5301#(and (= |upsweep_#in~n| upsweep_~n) (<= 2 upsweep_~n))} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:54,777 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-15 13:18:54,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {5256#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {5256#false} is VALID [2022-04-15 13:18:54,777 INFO L272 TraceCheckUtils]: 48: Hoare triple {5256#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {5299#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:18:54,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {5299#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {5255#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:54,778 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L272 TraceCheckUtils]: 56: Hoare triple {5256#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {5256#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {5256#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L272 TraceCheckUtils]: 59: Hoare triple {5256#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 13:18:54,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 13:18:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:18:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179472050] [2022-04-15 13:18:54,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179472050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239518826] [2022-04-15 13:18:54,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:54,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:54,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:54,780 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-04-15 13:18:54,781 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-04-15 13:18:54,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:54,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:54,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:18:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:54,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:55,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {5255#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 13:18:55,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 13:18:55,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 13:18:55,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {5255#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {5255#true} is VALID [2022-04-15 13:18:55,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 13:18:55,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {5255#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L272 TraceCheckUtils]: 24: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {5255#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,055 INFO L272 TraceCheckUtils]: 29: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:55,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,056 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 13:18:55,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {5255#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {5405#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:55,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {5405#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {5405#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:55,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {5405#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {5280#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:55,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {5280#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {5281#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:55,057 INFO L272 TraceCheckUtils]: 37: Hoare triple {5281#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {5255#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {5421#(and (<= upsweep_~n |upsweep_#in~n|) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:18:55,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {5421#(and (<= upsweep_~n |upsweep_#in~n|) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~left~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} ~space~0 := 2 * ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,059 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-15 13:18:55,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {5256#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L272 TraceCheckUtils]: 48: Hoare triple {5256#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {5256#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {5256#false} assume !(~right~1 < ~n); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {5256#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {5256#false} assume !(~space > 0); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {5256#false} assume true; {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5256#false} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L272 TraceCheckUtils]: 56: Hoare triple {5256#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {5256#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {5256#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L272 TraceCheckUtils]: 59: Hoare triple {5256#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {5256#false} is VALID [2022-04-15 13:18:55,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 13:18:55,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 13:18:55,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 13:18:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:18:55,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:55,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 13:18:55,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 13:18:55,276 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 13:18:55,276 INFO L272 TraceCheckUtils]: 59: Hoare triple {5256#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {5256#false} is VALID [2022-04-15 13:18:55,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {5256#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {5256#false} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {5256#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {5256#false} is VALID [2022-04-15 13:18:55,277 INFO L272 TraceCheckUtils]: 56: Hoare triple {5256#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {5256#false} is VALID [2022-04-15 13:18:55,277 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {5255#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {5255#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L272 TraceCheckUtils]: 48: Hoare triple {5256#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {5255#true} is VALID [2022-04-15 13:18:55,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {5256#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {5256#false} is VALID [2022-04-15 13:18:55,278 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-15 13:18:55,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} ~space~0 := 2 * ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~left~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {5566#(or (not (< upsweep_~space~0 upsweep_~n)) (<= 2 |upsweep_#in~n|))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 13:18:55,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {5255#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {5566#(or (not (< upsweep_~space~0 upsweep_~n)) (<= 2 |upsweep_#in~n|))} is VALID [2022-04-15 13:18:55,280 INFO L272 TraceCheckUtils]: 37: Hoare triple {5281#(<= main_~n~0 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {5280#(<= main_~i~1 1)} assume !(~i~1 < ~n~0); {5281#(<= main_~n~0 1)} is VALID [2022-04-15 13:18:55,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {5405#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {5280#(<= main_~i~1 1)} is VALID [2022-04-15 13:18:55,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {5405#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {5405#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:55,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {5255#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {5405#(<= main_~i~1 0)} is VALID [2022-04-15 13:18:55,281 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 13:18:55,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L272 TraceCheckUtils]: 29: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {5255#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L272 TraceCheckUtils]: 24: Hoare triple {5255#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {5255#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 13:18:55,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {5255#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 13:18:55,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {5255#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-15 13:18:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:18:55,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239518826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:55,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:18:55,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 13 [2022-04-15 13:18:55,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:55,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857837214] [2022-04-15 13:18:55,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857837214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:55,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:55,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:18:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287207309] [2022-04-15 13:18:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2022-04-15 13:18:55,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:55,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:55,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:55,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:18:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:18:55,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:18:55,347 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:18:59,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:01,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:03,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:06,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:10,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:11,436 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-04-15 13:19:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:19:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2022-04-15 13:19:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:19:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:19:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:19:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 13:19:11,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-15 13:19:11,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:11,518 INFO L225 Difference]: With dead ends: 107 [2022-04-15 13:19:11,518 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 13:19:11,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:19:11,522 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 42 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:11,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 55 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 405 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-04-15 13:19:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 13:19:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-15 13:19:11,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:11,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:11,576 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:11,577 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:11,579 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 13:19:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 13:19:11,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:11,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:11,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 75 states. [2022-04-15 13:19:11,579 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 75 states. [2022-04-15 13:19:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:11,581 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 13:19:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 13:19:11,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:11,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:11,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:11,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-04-15 13:19:11,583 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 63 [2022-04-15 13:19:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:11,583 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-04-15 13:19:11,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:19:11,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 82 transitions. [2022-04-15 13:19:11,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-15 13:19:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 13:19:11,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:11,673 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2022-04-15 13:19:11,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 13:19:11,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:11,896 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 3 times [2022-04-15 13:19:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715674545] [2022-04-15 13:19:11,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:19:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 4 times [2022-04-15 13:19:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294621837] [2022-04-15 13:19:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:19:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:11,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {6251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6208#true} is VALID [2022-04-15 13:19:11,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:11,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 13:19:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:19:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:11,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:11,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:11,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:11,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 13:19:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:19:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:11,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 13:19:11,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {6208#true} is VALID [2022-04-15 13:19:11,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 13:19:11,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:11,992 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 13:19:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:19:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:11,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:11,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:11,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:11,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 13:19:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:19:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:12,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 13:19:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:19:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:12,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 13:19:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:19:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,037 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:19:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:12,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6253#(<= |downsweep_#in~n| downsweep_~n)} is VALID [2022-04-15 13:19:12,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {6253#(<= |downsweep_#in~n| downsweep_~n)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {6254#(<= (+ downsweep_~right~1 |downsweep_#in~n| 1) (+ downsweep_~n (* 2 downsweep_~space)))} is VALID [2022-04-15 13:19:12,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {6254#(<= (+ downsweep_~right~1 |downsweep_#in~n| 1) (+ downsweep_~n (* 2 downsweep_~space)))} assume !(~right~1 < ~n); {6255#(<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space))} is VALID [2022-04-15 13:19:12,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {6255#(<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6256#(<= |downsweep_#in~n| (+ (* downsweep_~space 4) 1))} is VALID [2022-04-15 13:19:12,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {6256#(<= |downsweep_#in~n| (+ (* downsweep_~space 4) 1))} assume !(~space > 0); {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,103 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-15 13:19:12,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:19:12,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {6251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6208#true} is VALID [2022-04-15 13:19:12,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 13:19:12,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 13:19:12,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {6208#true} is VALID [2022-04-15 13:19:12,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {6208#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {6208#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:12,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,105 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 13:19:12,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {6208#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,105 INFO L272 TraceCheckUtils]: 24: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {6252#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:12,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,106 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 13:19:12,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {6208#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,106 INFO L272 TraceCheckUtils]: 29: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {6252#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:12,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,107 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 13:19:12,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {6208#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {6232#(= main_~i~1 0)} is VALID [2022-04-15 13:19:12,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {6232#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6232#(= main_~i~1 0)} is VALID [2022-04-15 13:19:12,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {6232#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6233#(<= 1 main_~i~1)} is VALID [2022-04-15 13:19:12,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {6233#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {6234#(<= 2 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {6234#(<= 2 main_~n~0)} assume !(~i~1 < ~n~0); {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,109 INFO L272 TraceCheckUtils]: 39: Hoare triple {6234#(<= 2 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {6252#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:12,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {6208#true} is VALID [2022-04-15 13:19:12,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 13:19:12,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {6208#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,110 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {6234#(<= 2 main_~n~0)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,111 INFO L272 TraceCheckUtils]: 50: Hoare triple {6234#(<= 2 main_~n~0)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {6252#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:12,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {6252#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6253#(<= |downsweep_#in~n| downsweep_~n)} is VALID [2022-04-15 13:19:12,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {6253#(<= |downsweep_#in~n| downsweep_~n)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {6254#(<= (+ downsweep_~right~1 |downsweep_#in~n| 1) (+ downsweep_~n (* 2 downsweep_~space)))} is VALID [2022-04-15 13:19:12,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {6254#(<= (+ downsweep_~right~1 |downsweep_#in~n| 1) (+ downsweep_~n (* 2 downsweep_~space)))} assume !(~right~1 < ~n); {6255#(<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space))} is VALID [2022-04-15 13:19:12,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {6255#(<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6256#(<= |downsweep_#in~n| (+ (* downsweep_~space 4) 1))} is VALID [2022-04-15 13:19:12,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {6256#(<= |downsweep_#in~n| (+ (* downsweep_~space 4) 1))} assume !(~space > 0); {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,115 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-15 13:19:12,115 INFO L272 TraceCheckUtils]: 58: Hoare triple {6209#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {6209#false} is VALID [2022-04-15 13:19:12,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {6209#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {6209#false} is VALID [2022-04-15 13:19:12,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {6209#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {6209#false} is VALID [2022-04-15 13:19:12,115 INFO L272 TraceCheckUtils]: 61: Hoare triple {6209#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {6209#false} is VALID [2022-04-15 13:19:12,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 13:19:12,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 13:19:12,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 13:19:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:19:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:12,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294621837] [2022-04-15 13:19:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294621837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:19:12,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80203380] [2022-04-15 13:19:12,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:19:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:12,117 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-04-15 13:19:12,118 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-04-15 13:19:12,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:19:12,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 13:19:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:12,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:12,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-15 13:19:12,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {6208#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {6208#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {6208#true} is VALID [2022-04-15 13:19:12,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {6208#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L272 TraceCheckUtils]: 24: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 13:19:12,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {6208#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,597 INFO L272 TraceCheckUtils]: 29: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:12,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,597 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 13:19:12,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {6208#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {6360#(<= 0 main_~i~1)} is VALID [2022-04-15 13:19:12,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {6360#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6360#(<= 0 main_~i~1)} is VALID [2022-04-15 13:19:12,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {6360#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6233#(<= 1 main_~i~1)} is VALID [2022-04-15 13:19:12,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {6233#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {6234#(<= 2 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {6234#(<= 2 main_~n~0)} assume !(~i~1 < ~n~0); {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,599 INFO L272 TraceCheckUtils]: 39: Hoare triple {6234#(<= 2 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {6208#true} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {6208#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {6208#true} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {6208#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:12,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 13:19:12,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:12,600 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {6234#(<= 2 main_~n~0)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:12,601 INFO L272 TraceCheckUtils]: 50: Hoare triple {6234#(<= 2 main_~n~0)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {6208#true} is VALID [2022-04-15 13:19:12,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {6208#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6253#(<= |downsweep_#in~n| downsweep_~n)} is VALID [2022-04-15 13:19:12,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {6253#(<= |downsweep_#in~n| downsweep_~n)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {6418#(and (<= |downsweep_#in~n| downsweep_~n) (<= (+ downsweep_~right~1 1) (* 2 downsweep_~space)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:19:12,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {6418#(and (<= |downsweep_#in~n| downsweep_~n) (<= (+ downsweep_~right~1 1) (* 2 downsweep_~space)) (< 0 downsweep_~space))} assume !(~right~1 < ~n); {6422#(and (<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:19:12,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {6422#(and (<= (+ |downsweep_#in~n| 1) (* 2 downsweep_~space)) (< 0 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6426#(and (< (div (+ (* (- 1) (div (+ (- 1) (* (- 1) |downsweep_#in~n|)) (- 2))) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} is VALID [2022-04-15 13:19:12,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {6426#(and (< (div (+ (* (- 1) (div (+ (- 1) (* (- 1) |downsweep_#in~n|)) (- 2))) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} assume !(~space > 0); {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:12,605 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-15 13:19:12,605 INFO L272 TraceCheckUtils]: 58: Hoare triple {6209#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {6209#false} is VALID [2022-04-15 13:19:12,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {6209#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {6209#false} is VALID [2022-04-15 13:19:12,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {6209#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {6209#false} is VALID [2022-04-15 13:19:12,605 INFO L272 TraceCheckUtils]: 61: Hoare triple {6209#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {6209#false} is VALID [2022-04-15 13:19:12,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 13:19:12,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 13:19:12,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 13:19:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:19:12,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:19:13,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L272 TraceCheckUtils]: 61: Hoare triple {6209#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {6209#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {6209#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {6209#false} is VALID [2022-04-15 13:19:13,851 INFO L272 TraceCheckUtils]: 58: Hoare triple {6209#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {6209#false} is VALID [2022-04-15 13:19:13,852 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-15 13:19:13,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:13,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {6487#(or (<= |downsweep_#in~n| 1) (< 0 downsweep_~space))} assume !(~space > 0); {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 13:19:13,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {6491#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~n| 1))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6487#(or (<= |downsweep_#in~n| 1) (< 0 downsweep_~space))} is VALID [2022-04-15 13:19:13,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {6495#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~n| 1) (< downsweep_~right~1 downsweep_~n))} assume !(~right~1 < ~n); {6491#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~n| 1))} is VALID [2022-04-15 13:19:13,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {6499#(or (<= 0 (div (+ (- 1) (div downsweep_~n 2)) 2)) (<= |downsweep_#in~n| 1))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {6495#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~n| 1) (< downsweep_~right~1 downsweep_~n))} is VALID [2022-04-15 13:19:13,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {6208#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {6499#(or (<= 0 (div (+ (- 1) (div downsweep_~n 2)) 2)) (<= |downsweep_#in~n| 1))} is VALID [2022-04-15 13:19:13,855 INFO L272 TraceCheckUtils]: 50: Hoare triple {6234#(<= 2 main_~n~0)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {6208#true} is VALID [2022-04-15 13:19:13,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {6234#(<= 2 main_~n~0)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:13,856 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:13,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {6208#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {6208#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L272 TraceCheckUtils]: 39: Hoare triple {6234#(<= 2 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {6208#true} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {6234#(<= 2 main_~n~0)} assume !(~i~1 < ~n~0); {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:13,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {6234#(<= 2 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:13,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {6233#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6234#(<= 2 main_~n~0)} is VALID [2022-04-15 13:19:13,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {6360#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {6233#(<= 1 main_~i~1)} is VALID [2022-04-15 13:19:13,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {6360#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {6360#(<= 0 main_~i~1)} is VALID [2022-04-15 13:19:13,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {6208#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {6360#(<= 0 main_~i~1)} is VALID [2022-04-15 13:19:13,859 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 13:19:13,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:13,859 INFO L272 TraceCheckUtils]: 29: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:13,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {6208#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L272 TraceCheckUtils]: 24: Hoare triple {6208#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {6208#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {6208#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {6208#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6208#true} is VALID [2022-04-15 13:19:13,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-15 13:19:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:19:13,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80203380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:19:13,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:19:13,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-15 13:19:13,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:13,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715674545] [2022-04-15 13:19:13,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715674545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:13,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:13,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:19:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692190532] [2022-04-15 13:19:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-04-15 13:19:13,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:13,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:19:13,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:13,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:19:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:19:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:19:13,906 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:19:20,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:22,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:24,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:28,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:30,565 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-15 13:19:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:19:30,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-04-15 13:19:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:19:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-15 13:19:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:19:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-15 13:19:30,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 95 transitions. [2022-04-15 13:19:30,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:30,634 INFO L225 Difference]: With dead ends: 95 [2022-04-15 13:19:30,634 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 13:19:30,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2022-04-15 13:19:30,636 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:30,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 62 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 600 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2022-04-15 13:19:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 13:19:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-04-15 13:19:30,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:30,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:30,734 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:30,734 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:30,736 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-15 13:19:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-15 13:19:30,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:30,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:30,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 81 states. [2022-04-15 13:19:30,738 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Second operand 81 states. [2022-04-15 13:19:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:30,739 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-15 13:19:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-15 13:19:30,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:30,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:30,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:30,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 13:19:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-04-15 13:19:30,744 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 65 [2022-04-15 13:19:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:30,744 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-04-15 13:19:30,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:19:30,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 86 transitions. [2022-04-15 13:19:30,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-04-15 13:19:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 13:19:30,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:30,846 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2022-04-15 13:19:30,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 13:19:31,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:31,066 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 1 times [2022-04-15 13:19:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:31,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392687776] [2022-04-15 13:19:31,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:19:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 2 times [2022-04-15 13:19:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15461556] [2022-04-15 13:19:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:19:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {7237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7182#true} is VALID [2022-04-15 13:19:31,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:31,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 13:19:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:19:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:31,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:31,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:31,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 13:19:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:19:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 13:19:31,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {7182#true} is VALID [2022-04-15 13:19:31,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 13:19:31,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:31,711 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 13:19:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:19:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:31,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:31,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:31,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 13:19:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:19:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:19:31,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:19:31,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {7200#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {7204#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:19:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:19:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:19:31,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:19:31,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:19:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:19:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:31,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} is VALID [2022-04-15 13:19:31,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} is VALID [2022-04-15 13:19:31,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume !(~left~0 < ~n); {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} ~space~0 := 2 * ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume !(~space~0 < ~n); {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} #res := ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume true; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:31,874 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} {7212#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-15 13:19:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:19:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:36,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7243#(and (= downsweep_~n |downsweep_#in~n|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= |downsweep_#in~a.offset| downsweep_~a.offset)) (not (= |downsweep_#in~a.offset| 0))))} is VALID [2022-04-15 13:19:36,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {7243#(and (= downsweep_~n |downsweep_#in~n|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= |downsweep_#in~a.offset| downsweep_~a.offset)) (not (= |downsweep_#in~a.offset| 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {7244#(and (or (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))) (or (and (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (not (= |downsweep_#in~a.offset| 0)))) (not (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))))))} is VALID [2022-04-15 13:19:36,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {7244#(and (or (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))) (or (and (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (not (= |downsweep_#in~a.offset| 0)))) (not (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {7245#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {7245#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} #154#return; {7231#(and (or (= (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 0) (<= 4 (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= main_~a~0.offset 0) (or (<= 4 (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (store (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-15 13:19:36,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {7237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 13:19:36,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:36,398 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 13:19:36,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {7182#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7200#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-15 13:19:36,399 INFO L272 TraceCheckUtils]: 24: Hoare triple {7200#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {7238#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:36,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:19:36,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:19:36,401 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7239#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {7200#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {7204#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:19:36,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {7204#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:19:36,402 INFO L272 TraceCheckUtils]: 29: Hoare triple {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {7238#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:36,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:19:36,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:19:36,403 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7240#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:19:36,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {7205#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {7209#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0))} is VALID [2022-04-15 13:19:36,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {7209#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7209#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0))} is VALID [2022-04-15 13:19:36,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {7209#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7210#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:19:36,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {7210#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7210#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:19:36,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {7210#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7211#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:19:36,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {7211#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)))} assume !(~i~1 < ~n~0); {7212#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-15 13:19:36,406 INFO L272 TraceCheckUtils]: 39: Hoare triple {7212#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {7238#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:36,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} is VALID [2022-04-15 13:19:36,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} is VALID [2022-04-15 13:19:36,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {7241#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume !(~left~0 < ~n); {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} ~space~0 := 2 * ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume !(~space~0 < ~n); {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} #res := ~space~0; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} assume true; {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} is VALID [2022-04-15 13:19:36,410 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7242#(or (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))) (= (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|))) 0))} {7212#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-15 13:19:36,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-15 13:19:36,436 INFO L272 TraceCheckUtils]: 50: Hoare triple {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {7238#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:19:36,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {7238#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7243#(and (= downsweep_~n |downsweep_#in~n|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= |downsweep_#in~a.offset| downsweep_~a.offset)) (not (= |downsweep_#in~a.offset| 0))))} is VALID [2022-04-15 13:19:36,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {7243#(and (= downsweep_~n |downsweep_#in~n|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= |downsweep_#in~a.offset| downsweep_~a.offset)) (not (= |downsweep_#in~a.offset| 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {7244#(and (or (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))) (or (and (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (not (= |downsweep_#in~a.offset| 0)))) (not (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))))))} is VALID [2022-04-15 13:19:36,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {7244#(and (or (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))) (or (and (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (not (= |downsweep_#in~a.offset| 0)))) (not (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (+ downsweep_~a.offset (* downsweep_~right~1 4))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {7245#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {7245#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:19:36,483 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7246#(or (and (= (store (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (<= (+ |downsweep_#in~a.offset| 4) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (select |old(#memory_int)| |downsweep_#in~a.base|) (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))))) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0) (= (store (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (<= (+ |downsweep_#in~a.offset| 4) (@diff (store (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)) (select (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (select |old(#memory_int)| |downsweep_#in~a.base|))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (@diff (select |#memory_int| |downsweep_#in~a.base|) (select |old(#memory_int)| |downsweep_#in~a.base|))) 0)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {7222#(and (<= main_~n~0 2) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} #154#return; {7231#(and (or (= (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 0) (<= 4 (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= main_~a~0.offset 0) (or (<= 4 (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (store (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-15 13:19:36,487 INFO L272 TraceCheckUtils]: 59: Hoare triple {7231#(and (or (= (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 0) (<= 4 (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= main_~a~0.offset 0) (or (<= 4 (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (store (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {7232#(and (or (<= 4 (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| |check_#in~a.base|) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 0)) (= |check_#in~a.offset| 0) (or (<= 4 (@diff (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (<= 4 (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)))} is VALID [2022-04-15 13:19:36,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#(and (or (<= 4 (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| |check_#in~a.base|) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 0)) (= |check_#in~a.offset| 0) (or (<= 4 (@diff (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (<= 4 (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {7233#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~i~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:19:36,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {7233#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~i~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {7234#(= |check_#t~mem11| check_~sum~0)} is VALID [2022-04-15 13:19:36,492 INFO L272 TraceCheckUtils]: 62: Hoare triple {7234#(= |check_#t~mem11| check_~sum~0)} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {7235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:19:36,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {7235#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7236#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:19:36,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {7236#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7183#false} is VALID [2022-04-15 13:19:36,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-15 13:19:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 13:19:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15461556] [2022-04-15 13:19:36,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15461556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:19:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251271796] [2022-04-15 13:19:36,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:19:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:36,507 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-04-15 13:19:36,508 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-04-15 13:19:36,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:19:36,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:36,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 13:19:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:36,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:37,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-04-15 13:19:37,533 INFO L356 Elim1Store]: treesize reduction 151, result has 25.2 percent of original size [2022-04-15 13:19:37,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 68 [2022-04-15 13:19:38,692 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 15 treesize of output 7 [2022-04-15 13:19:38,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,793 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 13:19:38,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {7182#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7319#(= |main_#t~malloc15.offset| 0)} is VALID [2022-04-15 13:19:38,794 INFO L272 TraceCheckUtils]: 24: Hoare triple {7319#(= |main_#t~malloc15.offset| 0)} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:38,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 13:19:38,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,794 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7182#true} {7319#(= |main_#t~malloc15.offset| 0)} #148#return; {7319#(= |main_#t~malloc15.offset| 0)} is VALID [2022-04-15 13:19:38,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {7319#(= |main_#t~malloc15.offset| 0)} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7335#(= main_~a~0.offset 0)} is VALID [2022-04-15 13:19:38,795 INFO L272 TraceCheckUtils]: 29: Hoare triple {7335#(= main_~a~0.offset 0)} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:38,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 13:19:38,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:38,796 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7182#true} {7335#(= main_~a~0.offset 0)} #150#return; {7335#(= main_~a~0.offset 0)} is VALID [2022-04-15 13:19:38,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {7335#(= main_~a~0.offset 0)} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {7351#(and (= main_~a~0.offset 0) (<= main_~i~1 0))} is VALID [2022-04-15 13:19:38,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {7351#(and (= main_~a~0.offset 0) (<= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7351#(and (= main_~a~0.offset 0) (<= main_~i~1 0))} is VALID [2022-04-15 13:19:38,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {7351#(and (= main_~a~0.offset 0) (<= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7358#(and (= main_~a~0.offset 0) (<= main_~i~1 1))} is VALID [2022-04-15 13:19:38,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {7358#(and (= main_~a~0.offset 0) (<= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7358#(and (= main_~a~0.offset 0) (<= main_~i~1 1))} is VALID [2022-04-15 13:19:38,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {7358#(and (= main_~a~0.offset 0) (<= main_~i~1 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7365#(and (= main_~a~0.offset 0) (<= main_~i~1 2))} is VALID [2022-04-15 13:19:38,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {7365#(and (= main_~a~0.offset 0) (<= main_~i~1 2))} assume !(~i~1 < ~n~0); {7369#(and (<= main_~n~0 2) (= main_~a~0.offset 0))} is VALID [2022-04-15 13:19:38,798 INFO L272 TraceCheckUtils]: 39: Hoare triple {7369#(and (<= main_~n~0 2) (= main_~a~0.offset 0))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {7182#true} is VALID [2022-04-15 13:19:38,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:19:38,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:19:38,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:19:38,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:19:38,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {7376#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {7389#(and (= 2 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:19:38,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {7389#(and (= 2 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {7393#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0))} is VALID [2022-04-15 13:19:38,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {7393#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0))} #res := ~space~0; {7397#(and (<= |upsweep_#in~n| 2) (= |upsweep_#res| 2))} is VALID [2022-04-15 13:19:38,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#(and (<= |upsweep_#in~n| 2) (= |upsweep_#res| 2))} assume true; {7397#(and (<= |upsweep_#in~n| 2) (= |upsweep_#res| 2))} is VALID [2022-04-15 13:19:38,801 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7397#(and (<= |upsweep_#in~n| 2) (= |upsweep_#res| 2))} {7369#(and (<= main_~n~0 2) (= main_~a~0.offset 0))} #152#return; {7404#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2))} is VALID [2022-04-15 13:19:38,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {7404#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {7408#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1))} is VALID [2022-04-15 13:19:38,801 INFO L272 TraceCheckUtils]: 50: Hoare triple {7408#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {7182#true} is VALID [2022-04-15 13:19:38,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7415#(and (<= downsweep_~n |downsweep_#in~n|) (= downsweep_~a.base |downsweep_#in~a.base|) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} is VALID [2022-04-15 13:19:38,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(and (<= downsweep_~n |downsweep_#in~n|) (= downsweep_~a.base |downsweep_#in~a.base|) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {7419#(and (<= downsweep_~n |downsweep_#in~n|) (= downsweep_~a.base |downsweep_#in~a.base|) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (< 0 downsweep_~space))} is VALID [2022-04-15 13:19:38,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {7419#(and (<= downsweep_~n |downsweep_#in~n|) (= downsweep_~a.base |downsweep_#in~a.base|) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} is VALID [2022-04-15 13:19:38,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} assume !(~right~1 < ~n); {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} is VALID [2022-04-15 13:19:38,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} is VALID [2022-04-15 13:19:38,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} assume !(~space > 0); {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} is VALID [2022-04-15 13:19:38,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} assume true; {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} is VALID [2022-04-15 13:19:38,834 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7423#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((downsweep_~n Int)) (and (<= downsweep_~n |downsweep_#in~n|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)) 0) (not (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))))) (< (* 2 (div |downsweep_#in~space| 2)) (+ downsweep_~n 1)) (or (= (* downsweep_~n 4) (* 8 (div |downsweep_#in~space| 2))) (= (select (select |#memory_int| |downsweep_#in~a.base|) (+ (* downsweep_~n 4) (- 4) |downsweep_#in~a.offset|)) 0)))))} {7408#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1))} #154#return; {7439#(and (<= main_~n~0 2) (exists ((downsweep_~n Int)) (and (< 1 downsweep_~n) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= downsweep_~n main_~n~0))) (= main_~a~0.offset 0))} is VALID [2022-04-15 13:19:38,834 INFO L272 TraceCheckUtils]: 59: Hoare triple {7439#(and (<= main_~n~0 2) (exists ((downsweep_~n Int)) (and (< 1 downsweep_~n) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= downsweep_~n main_~n~0))) (= main_~a~0.offset 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {7443#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 0) 0) (<= |check_#in~n| 2))} is VALID [2022-04-15 13:19:38,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {7443#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 0) 0) (<= |check_#in~n| 2))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {7447#(and (= (select (select |#memory_int| check_~a.base) 0) 0) (<= check_~n 2) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:19:38,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {7447#(and (= (select (select |#memory_int| check_~a.base) 0) 0) (<= check_~n 2) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {7451#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} is VALID [2022-04-15 13:19:38,836 INFO L272 TraceCheckUtils]: 62: Hoare triple {7451#(and (= |check_#t~mem11| 0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:38,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:38,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {7459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7183#false} is VALID [2022-04-15 13:19:38,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-15 13:19:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 13:19:38,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:19:39,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 13:19:39,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 169 treesize of output 176 [2022-04-15 13:19:39,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:39,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:39,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:39,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:40,006 INFO L356 Elim1Store]: treesize reduction 149, result has 55.4 percent of original size [2022-04-15 13:19:40,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 246 treesize of output 464 [2022-04-15 13:19:40,269 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 293 treesize of output 274 [2022-04-15 13:19:40,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:40,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:40,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:40,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 13:19:40,311 INFO L356 Elim1Store]: treesize reduction 94, result has 16.8 percent of original size [2022-04-15 13:19:40,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 136 [2022-04-15 13:19:40,376 INFO L356 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2022-04-15 13:19:40,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2022-04-15 13:19:41,350 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 48 treesize of output 44 [2022-04-15 13:19:41,387 INFO L356 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2022-04-15 13:19:41,387 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 632 treesize of output 1 [2022-04-15 13:19:42,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-15 13:19:42,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {7459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7183#false} is VALID [2022-04-15 13:19:42,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:42,137 INFO L272 TraceCheckUtils]: 62: Hoare triple {7234#(= |check_#t~mem11| check_~sum~0)} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:42,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {7478#(or (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (not (< check_~i~0 check_~n)))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {7234#(= |check_#t~mem11| check_~sum~0)} is VALID [2022-04-15 13:19:42,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {7482#(or (= (select (select |#memory_int| |check_#in~a.base|) |check_#in~a.offset|) 0) (<= |check_#in~n| 0))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {7478#(or (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (not (< check_~i~0 check_~n)))} is VALID [2022-04-15 13:19:42,139 INFO L272 TraceCheckUtils]: 59: Hoare triple {7486#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= main_~n~0 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {7482#(or (= (select (select |#memory_int| |check_#in~a.base|) |check_#in~a.offset|) 0) (<= |check_#in~n| 0))} is VALID [2022-04-15 13:19:42,140 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} {7490#(or (and (or (= (* (div main_~space~1 2) 4) 4) (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2)))) (<= main_~n~0 (* 2 (div main_~space~1 2)))) (not (< 0 (div main_~space~1 2))))} #154#return; {7486#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= main_~n~0 0))} is VALID [2022-04-15 13:19:42,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} assume true; {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} assume !(~space > 0); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} assume !(~right~1 < ~n); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {7510#(or (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4)) v_ArrVal_268) (+ downsweep_~a.offset (* downsweep_~right~1 4) (* downsweep_~space (- 4))) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)) (not (< downsweep_~right~1 downsweep_~n)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {7514#(or (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))) (not (< 0 downsweep_~space)) (not (< (* 2 downsweep_~space) (+ downsweep_~n 1))) (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8)) v_ArrVal_268) (+ (* downsweep_~space 4) downsweep_~a.offset (- 4)) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {7510#(or (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4)) v_ArrVal_268) (+ downsweep_~a.offset (* downsweep_~right~1 4) (* downsweep_~space (- 4))) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)) (not (< downsweep_~right~1 downsweep_~n)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))))} is VALID [2022-04-15 13:19:42,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7514#(or (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< 0 (div |downsweep_#in~space| 2)) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1))) (not (< 0 downsweep_~space)) (not (< (* 2 downsweep_~space) (+ downsweep_~n 1))) (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8)) v_ArrVal_268) (+ (* downsweep_~space 4) downsweep_~a.offset (- 4)) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)))} is VALID [2022-04-15 13:19:42,161 INFO L272 TraceCheckUtils]: 50: Hoare triple {7490#(or (and (or (= (* (div main_~space~1 2) 4) 4) (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2)))) (<= main_~n~0 (* 2 (div main_~space~1 2)))) (not (< 0 (div main_~space~1 2))))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {7182#true} is VALID [2022-04-15 13:19:42,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {7521#(or (not (< 0 (div |main_#t~ret19| 2))) (and (or (= (* (div |main_#t~ret19| 2) 4) 4) (<= (+ main_~n~0 1) (* (div |main_#t~ret19| 2) 2))) (<= main_~n~0 (* (div |main_#t~ret19| 2) 2))))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {7490#(or (and (or (= (* (div main_~space~1 2) 4) 4) (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2)))) (<= main_~n~0 (* 2 (div main_~space~1 2)))) (not (< 0 (div main_~space~1 2))))} is VALID [2022-04-15 13:19:42,163 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7528#(or (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (* (div |upsweep_#res| 2) 4) 4) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))) (not (< 0 (div |upsweep_#res| 2))))} {7182#true} #152#return; {7521#(or (not (< 0 (div |main_#t~ret19| 2))) (and (or (= (* (div |main_#t~ret19| 2) 4) 4) (<= (+ main_~n~0 1) (* (div |main_#t~ret19| 2) 2))) (<= main_~n~0 (* (div |main_#t~ret19| 2) 2))))} is VALID [2022-04-15 13:19:42,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {7528#(or (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (* (div |upsweep_#res| 2) 4) 4) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))) (not (< 0 (div |upsweep_#res| 2))))} assume true; {7528#(or (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (* (div |upsweep_#res| 2) 4) 4) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))) (not (< 0 (div |upsweep_#res| 2))))} is VALID [2022-04-15 13:19:42,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {7535#(or (not (< 0 (div upsweep_~space~0 2))) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))) (= (* (div upsweep_~space~0 2) 4) 4))))} #res := ~space~0; {7528#(or (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (* (div |upsweep_#res| 2) 4) 4) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))) (not (< 0 (div |upsweep_#res| 2))))} is VALID [2022-04-15 13:19:42,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {7539#(or (not (< 0 (div upsweep_~space~0 2))) (< upsweep_~space~0 upsweep_~n) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))) (= (* (div upsweep_~space~0 2) 4) 4))))} assume !(~space~0 < ~n); {7535#(or (not (< 0 (div upsweep_~space~0 2))) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))) (= (* (div upsweep_~space~0 2) 4) 4))))} is VALID [2022-04-15 13:19:42,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} ~space~0 := 2 * ~space~0; {7539#(or (not (< 0 (div upsweep_~space~0 2))) (< upsweep_~space~0 upsweep_~n) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))) (= (* (div upsweep_~space~0 2) 4) 4))))} is VALID [2022-04-15 13:19:42,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} assume !(~left~0 < ~n); {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} is VALID [2022-04-15 13:19:42,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} is VALID [2022-04-15 13:19:42,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {7543#(or (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (* (div (* 2 upsweep_~space~0) 2) 4) 4))) (not (< 0 upsweep_~space~0)))} is VALID [2022-04-15 13:19:42,168 INFO L272 TraceCheckUtils]: 39: Hoare triple {7182#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {7182#true} assume !(~i~1 < ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {7182#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {7182#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {7182#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {7182#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {7182#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7182#true} {7182#true} #150#return; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L272 TraceCheckUtils]: 29: Hoare triple {7182#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {7182#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7182#true} {7182#true} #148#return; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L272 TraceCheckUtils]: 24: Hoare triple {7182#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {7182#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-15 13:19:42,169 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 13:19:42,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 13:19:42,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7182#true} is VALID [2022-04-15 13:19:42,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7182#true} is VALID [2022-04-15 13:19:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:19:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251271796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:19:42,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:19:42,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 17] total 59 [2022-04-15 13:19:42,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392687776] [2022-04-15 13:19:42,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392687776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:42,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:42,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:19:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609645699] [2022-04-15 13:19:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:42,172 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2022-04-15 13:19:42,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:42,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 13:19:42,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:42,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:19:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:19:42,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3209, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 13:19:42,284 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 13:19:44,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:46,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:49,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:51,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:55,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:19:57,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:01,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:04,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:06,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:08,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:14,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:21,252 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-04-15 13:20:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:20:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2022-04-15 13:20:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 13:20:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-15 13:20:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 13:20:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-15 13:20:21,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-15 13:20:21,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:21,439 INFO L225 Difference]: With dead ends: 110 [2022-04-15 13:20:21,439 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 13:20:21,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=551, Invalid=6421, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 13:20:21,441 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 211 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 188 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:21,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 72 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1267 Invalid, 11 Unknown, 0 Unchecked, 25.2s Time] [2022-04-15 13:20:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 13:20:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-04-15 13:20:21,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:21,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:20:21,607 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:20:21,607 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:20:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:21,609 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-15 13:20:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-15 13:20:21,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:21,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:21,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 108 states. [2022-04-15 13:20:21,610 INFO L87 Difference]: Start difference. First operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 108 states. [2022-04-15 13:20:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:21,612 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-15 13:20:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-15 13:20:21,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:21,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:21,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:21,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:20:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-04-15 13:20:21,614 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 66 [2022-04-15 13:20:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:21,614 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-04-15 13:20:21,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 13:20:21,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 107 transitions. [2022-04-15 13:20:21,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-04-15 13:20:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 13:20:21,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:21,835 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2022-04-15 13:20:21,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 13:20:22,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 13:20:22,036 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1470293173, now seen corresponding path program 3 times [2022-04-15 13:20:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:22,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394558486] [2022-04-15 13:20:22,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:20:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1470293173, now seen corresponding path program 4 times [2022-04-15 13:20:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28341502] [2022-04-15 13:20:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:20:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-15 13:20:22,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-15 13:20:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:20:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-15 13:20:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:20:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-15 13:20:22,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-15 13:20:22,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-15 13:20:22,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,137 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-15 13:20:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:20:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-15 13:20:22,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:20:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-15 13:20:22,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:20:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-15 13:20:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:20:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-15 13:20:22,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-15 13:20:22,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,155 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:20:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} is VALID [2022-04-15 13:20:22,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} is VALID [2022-04-15 13:20:22,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,219 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-15 13:20:22,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:20:22,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-15 13:20:22,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-15 13:20:22,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-15 13:20:22,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-15 13:20:22,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,222 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-15 13:20:22,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,223 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:22,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,223 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-15 13:20:22,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,224 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:22,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,224 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-15 13:20:22,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8364#(= main_~i~1 0)} is VALID [2022-04-15 13:20:22,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {8364#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8364#(= main_~i~1 0)} is VALID [2022-04-15 13:20:22,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {8364#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:22,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:22,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-15 13:20:22,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {8366#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {8367#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,228 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {8367#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,229 INFO L272 TraceCheckUtils]: 50: Hoare triple {8367#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:22,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} is VALID [2022-04-15 13:20:22,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} is VALID [2022-04-15 13:20:22,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,233 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-15 13:20:22,233 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-15 13:20:22,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-15 13:20:22,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-15 13:20:22,233 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-15 13:20:22,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-15 13:20:22,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-15 13:20:22,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-15 13:20:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:20:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28341502] [2022-04-15 13:20:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28341502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:20:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989436543] [2022-04-15 13:20:22,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:20:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:22,235 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-04-15 13:20:22,236 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-04-15 13:20:22,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:20:22,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:20:22,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 13:20:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:22,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:22,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,660 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-15 13:20:22,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8494#(<= main_~i~1 0)} is VALID [2022-04-15 13:20:22,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {8494#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8494#(<= main_~i~1 0)} is VALID [2022-04-15 13:20:22,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {8494#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:22,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:22,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-15 13:20:22,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {8366#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,662 INFO L272 TraceCheckUtils]: 39: Hoare triple {8367#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-15 13:20:22,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:22,664 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {8367#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8367#(<= main_~n~0 2)} is VALID [2022-04-15 13:20:22,664 INFO L272 TraceCheckUtils]: 50: Hoare triple {8367#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8340#true} is VALID [2022-04-15 13:20:22,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8552#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:20:22,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {8552#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8556#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 4)))} is VALID [2022-04-15 13:20:22,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {8556#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 4)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:22,669 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-15 13:20:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:20:22,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:20:23,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-15 13:20:23,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-15 13:20:23,590 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-15 13:20:23,590 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-15 13:20:23,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-15 13:20:23,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-15 13:20:23,590 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-15 13:20:23,591 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} #154#return; {8341#false} is VALID [2022-04-15 13:20:23,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:23,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:23,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:23,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:23,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {8636#(or (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:20:23,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {8640#(or (<= downsweep_~n (+ downsweep_~right~1 (* 2 downsweep_~space))) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8636#(or (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:20:23,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {8644#(or (<= 4 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 4)) 1))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8640#(or (<= downsweep_~n (+ downsweep_~right~1 (* 2 downsweep_~space))) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:20:23,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8644#(or (<= 4 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 4)) 1))} is VALID [2022-04-15 13:20:23,595 INFO L272 TraceCheckUtils]: 50: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8340#true} is VALID [2022-04-15 13:20:23,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-15 13:20:23,596 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} #152#return; {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-15 13:20:23,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-15 13:20:23,597 INFO L272 TraceCheckUtils]: 39: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8340#true} is VALID [2022-04-15 13:20:23,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {8684#(<= (div (+ (* (- 1) main_~i~1) (- 5)) (- 4)) 2)} assume !(~i~1 < ~n~0); {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-15 13:20:23,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {8366#(<= main_~i~1 2)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8684#(<= (div (+ (* (- 1) main_~i~1) (- 5)) (- 4)) 2)} is VALID [2022-04-15 13:20:23,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {8366#(<= main_~i~1 2)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8366#(<= main_~i~1 2)} is VALID [2022-04-15 13:20:23,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-15 13:20:23,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:23,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8365#(<= main_~i~1 1)} is VALID [2022-04-15 13:20:23,599 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-15 13:20:23,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:23,599 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:23,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:23,599 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-15 13:20:23,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-15 13:20:23,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8340#true} is VALID [2022-04-15 13:20:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:20:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989436543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:20:23,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:20:23,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-15 13:20:23,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394558486] [2022-04-15 13:20:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394558486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:23,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:23,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:20:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125837372] [2022-04-15 13:20:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:23,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-04-15 13:20:23,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:23,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:20:23,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:23,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:20:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:23,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:20:23,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:20:23,646 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:20:27,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:32,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:34,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:36,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:40,129 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-04-15 13:20:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:20:40,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-04-15 13:20:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:20:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-15 13:20:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:20:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-15 13:20:40,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 114 transitions. [2022-04-15 13:20:40,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:40,220 INFO L225 Difference]: With dead ends: 114 [2022-04-15 13:20:40,220 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 13:20:40,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:20:40,221 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 54 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:40,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 65 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 549 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2022-04-15 13:20:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 13:20:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-04-15 13:20:40,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:40,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-15 13:20:40,414 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-15 13:20:40,414 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-15 13:20:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:40,416 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-15 13:20:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-04-15 13:20:40,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:40,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:40,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) Second operand 102 states. [2022-04-15 13:20:40,416 INFO L87 Difference]: Start difference. First operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) Second operand 102 states. [2022-04-15 13:20:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:40,418 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-15 13:20:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-04-15 13:20:40,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:40,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:40,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:40,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-15 13:20:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2022-04-15 13:20:40,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 67 [2022-04-15 13:20:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:40,420 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2022-04-15 13:20:40,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:20:40,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 118 transitions. [2022-04-15 13:20:40,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2022-04-15 13:20:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 13:20:40,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:40,676 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2022-04-15 13:20:40,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:20:40,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:40,876 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1247511922, now seen corresponding path program 5 times [2022-04-15 13:20:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:40,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503998016] [2022-04-15 13:20:40,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:20:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1247511922, now seen corresponding path program 6 times [2022-04-15 13:20:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:40,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870982706] [2022-04-15 13:20:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:20:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-15 13:20:40,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-15 13:20:40,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:20:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:40,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:40,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-15 13:20:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:20:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~x := #in~x; {9452#true} is VALID [2022-04-15 13:20:40,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9452#true} is VALID [2022-04-15 13:20:40,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9452#true} is VALID [2022-04-15 13:20:40,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,946 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9452#true} {9452#true} #144#return; {9452#true} is VALID [2022-04-15 13:20:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:20:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:40,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:40,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #146#return; {9452#true} is VALID [2022-04-15 13:20:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:20:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:40,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #148#return; {9452#true} is VALID [2022-04-15 13:20:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:20:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:40,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:40,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:40,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #150#return; {9452#true} is VALID [2022-04-15 13:20:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 13:20:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:41,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} is VALID [2022-04-15 13:20:41,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} is VALID [2022-04-15 13:20:41,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} assume !(~left~0 < ~n); {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= |upsweep_#in~n| 2)} #res := ~space~0; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= |upsweep_#in~n| 2)} assume true; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,043 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {9503#(<= |upsweep_#in~n| 2)} {9479#(<= 3 main_~n~0)} #152#return; {9453#false} is VALID [2022-04-15 13:20:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 13:20:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {9452#true} assume !(~right~1 < ~n); {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {9452#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume !(~space > 0); {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,050 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9452#true} {9453#false} #154#return; {9453#false} is VALID [2022-04-15 13:20:41,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {9452#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {9452#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9452#true} {9452#true} #144#return; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {9452#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {9452#true} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:41,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:41,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9452#true} {9452#true} #146#return; {9452#true} is VALID [2022-04-15 13:20:41,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {9452#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:41,063 INFO L272 TraceCheckUtils]: 24: Hoare triple {9452#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:41,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:41,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,064 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9452#true} #148#return; {9452#true} is VALID [2022-04-15 13:20:41,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {9452#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:41,064 INFO L272 TraceCheckUtils]: 29: Hoare triple {9452#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:41,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:41,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,065 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9452#true} #150#return; {9452#true} is VALID [2022-04-15 13:20:41,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {9452#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9476#(= main_~i~1 0)} is VALID [2022-04-15 13:20:41,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {9476#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9476#(= main_~i~1 0)} is VALID [2022-04-15 13:20:41,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {9476#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9477#(<= 1 main_~i~1)} is VALID [2022-04-15 13:20:41,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {9477#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9477#(<= 1 main_~i~1)} is VALID [2022-04-15 13:20:41,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {9477#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9478#(<= 2 main_~i~1)} is VALID [2022-04-15 13:20:41,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {9478#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9479#(<= 3 main_~n~0)} is VALID [2022-04-15 13:20:41,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {9479#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9479#(<= 3 main_~n~0)} is VALID [2022-04-15 13:20:41,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {9479#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {9479#(<= 3 main_~n~0)} is VALID [2022-04-15 13:20:41,068 INFO L272 TraceCheckUtils]: 41: Hoare triple {9479#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:41,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} is VALID [2022-04-15 13:20:41,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} is VALID [2022-04-15 13:20:41,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} assume !(~left~0 < ~n); {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:41,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {9503#(<= |upsweep_#in~n| 2)} #res := ~space~0; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {9503#(<= |upsweep_#in~n| 2)} assume true; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-15 13:20:41,072 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9503#(<= |upsweep_#in~n| 2)} {9479#(<= 3 main_~n~0)} #152#return; {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {9453#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L272 TraceCheckUtils]: 52: Hoare triple {9453#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {9452#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {9452#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {9452#true} assume !(~right~1 < ~n); {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {9452#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {9452#true} assume !(~space > 0); {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:41,073 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9452#true} {9453#false} #154#return; {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L272 TraceCheckUtils]: 61: Hoare triple {9453#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {9453#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {9453#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-15 13:20:41,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-15 13:20:41,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-15 13:20:41,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-15 13:20:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:20:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:41,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870982706] [2022-04-15 13:20:41,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870982706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:20:41,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497256350] [2022-04-15 13:20:41,074 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:20:41,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:41,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:41,093 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:20:41,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:20:41,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:20:41,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:20:41,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 13:20:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:41,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:42,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9452#true} is VALID [2022-04-15 13:20:42,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-15 13:20:42,091 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-15 13:20:42,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9543#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-15 13:20:42,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {9543#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9547#(and (or (not (< 1 (mod is_pow2_~x 4294967296))) (not (= (mod is_pow2_~x 2) 0))) (= |is_pow2_#in~x| is_pow2_~x))} is VALID [2022-04-15 13:20:42,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {9547#(and (or (not (< 1 (mod is_pow2_~x 4294967296))) (not (= (mod is_pow2_~x 2) 0))) (= |is_pow2_#in~x| is_pow2_~x))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} is VALID [2022-04-15 13:20:42,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} assume true; {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} is VALID [2022-04-15 13:20:42,094 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} {9452#true} #144#return; {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} is VALID [2022-04-15 13:20:42,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} is VALID [2022-04-15 13:20:42,095 INFO L272 TraceCheckUtils]: 18: Hoare triple {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-15 13:20:42,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 13:20:42,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {9568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:20:42,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:20:42,096 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} #146#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,097 INFO L272 TraceCheckUtils]: 24: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:42,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:42,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:42,098 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9579#(= (mod main_~n~0 4294967296) 1)} #148#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,098 INFO L272 TraceCheckUtils]: 29: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:42,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:42,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:42,099 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9579#(= (mod main_~n~0 4294967296) 1)} #150#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !(~i~1 < ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-15 13:20:42,101 INFO L272 TraceCheckUtils]: 41: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9452#true} is VALID [2022-04-15 13:20:42,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9640#(and (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-15 13:20:42,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {9640#(and (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-15 13:20:42,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-15 13:20:42,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !(~left~0 < ~n); {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-15 13:20:42,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} ~space~0 := 2 * ~space~0; {9654#(and (< 1 upsweep_~n) (= 2 upsweep_~space~0) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:20:42,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {9654#(and (< 1 upsweep_~n) (= 2 upsweep_~space~0) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9658#(and (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 |upsweep_#in~n|)) (= 2 upsweep_~space~0))} is VALID [2022-04-15 13:20:42,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {9658#(and (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 |upsweep_#in~n|)) (= 2 upsweep_~space~0))} #res := ~space~0; {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} is VALID [2022-04-15 13:20:42,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} assume true; {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} is VALID [2022-04-15 13:20:42,105 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} {9579#(= (mod main_~n~0 4294967296) 1)} #152#return; {9453#false} is VALID [2022-04-15 13:20:42,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {9453#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9453#false} is VALID [2022-04-15 13:20:42,105 INFO L272 TraceCheckUtils]: 52: Hoare triple {9453#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9453#false} is VALID [2022-04-15 13:20:42,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {9453#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9453#false} is VALID [2022-04-15 13:20:42,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {9453#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9453#false} is VALID [2022-04-15 13:20:42,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {9453#false} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {9453#false} assume !(~right~1 < ~n); {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {9453#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {9453#false} assume !(~space > 0); {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {9453#false} assume true; {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9453#false} {9453#false} #154#return; {9453#false} is VALID [2022-04-15 13:20:42,108 INFO L272 TraceCheckUtils]: 61: Hoare triple {9453#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {9453#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {9453#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-15 13:20:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 13:20:42,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:20:43,578 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-15 13:20:43,578 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-15 13:20:43,578 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-15 13:20:43,579 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-15 13:20:43,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {9732#(not (< check_~i~0 check_~n))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-15 13:20:43,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {9736#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9732#(not (< check_~i~0 check_~n))} is VALID [2022-04-15 13:20:43,580 INFO L272 TraceCheckUtils]: 61: Hoare triple {9740#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9736#(<= |check_#in~n| 0)} is VALID [2022-04-15 13:20:43,581 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9748#(< 0 (div |downsweep_#in~space| 2))} {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} #154#return; {9740#(<= main_~n~0 0)} is VALID [2022-04-15 13:20:43,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume true; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !(~space > 0); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !(~right~1 < ~n); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {9767#(or (< 0 (div |downsweep_#in~space| 2)) (not (< 0 downsweep_~space)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-15 13:20:43,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9767#(or (< 0 (div |downsweep_#in~space| 2)) (not (< 0 downsweep_~space)))} is VALID [2022-04-15 13:20:43,584 INFO L272 TraceCheckUtils]: 52: Hoare triple {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9452#true} is VALID [2022-04-15 13:20:43,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {9774#(or (<= (div |main_#t~ret19| 2) 0) (<= main_~n~0 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} is VALID [2022-04-15 13:20:43,585 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #152#return; {9774#(or (<= (div |main_#t~ret19| 2) 0) (<= main_~n~0 0))} is VALID [2022-04-15 13:20:43,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} assume true; {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} is VALID [2022-04-15 13:20:43,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {9789#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div upsweep_~space~0 2) 0))} #res := ~space~0; {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} is VALID [2022-04-15 13:20:43,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {9793#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0))} assume !(~space~0 < ~n); {9789#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div upsweep_~space~0 2) 0))} is VALID [2022-04-15 13:20:43,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} ~space~0 := 2 * ~space~0; {9793#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0))} is VALID [2022-04-15 13:20:43,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !(~left~0 < ~n); {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:20:43,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:20:43,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {9807#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< (* 2 upsweep_~space~0) upsweep_~n) (<= upsweep_~n upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:20:43,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9807#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< (* 2 upsweep_~space~0) upsweep_~n) (<= upsweep_~n upsweep_~space~0))} is VALID [2022-04-15 13:20:43,589 INFO L272 TraceCheckUtils]: 41: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9452#true} is VALID [2022-04-15 13:20:43,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !(~i~1 < ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,591 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #150#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:43,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:43,591 INFO L272 TraceCheckUtils]: 29: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:43,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,591 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #148#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:43,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-15 13:20:43,592 INFO L272 TraceCheckUtils]: 24: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-15 13:20:43,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} #146#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:20:43,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {9878#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:20:43,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9878#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 13:20:43,593 INFO L272 TraceCheckUtils]: 18: Hoare triple {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-15 13:20:43,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,594 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} {9452#true} #144#return; {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:20:43,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} assume true; {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} is VALID [2022-04-15 13:20:43,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} is VALID [2022-04-15 13:20:43,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} is VALID [2022-04-15 13:20:43,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} is VALID [2022-04-15 13:20:43,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-15 13:20:43,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9452#true} is VALID [2022-04-15 13:20:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 13:20:43,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497256350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:20:43,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:20:43,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 20] total 42 [2022-04-15 13:20:43,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:43,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503998016] [2022-04-15 13:20:43,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503998016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:43,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:43,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:20:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197102969] [2022-04-15 13:20:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2022-04-15 13:20:43,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:43,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:20:43,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:43,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:20:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:20:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:20:43,625 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:20:45,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:52,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:54,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:20:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:58,263 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2022-04-15 13:20:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:20:58,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2022-04-15 13:20:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:20:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 125 transitions. [2022-04-15 13:20:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:20:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 125 transitions. [2022-04-15 13:20:58,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 125 transitions. [2022-04-15 13:20:58,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:58,363 INFO L225 Difference]: With dead ends: 166 [2022-04-15 13:20:58,364 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 13:20:58,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=2822, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 13:20:58,365 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 75 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:58,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 62 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 590 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 13:20:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 13:20:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2022-04-15 13:20:58,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:58,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-15 13:20:58,632 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-15 13:20:58,632 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-15 13:20:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:58,634 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-15 13:20:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-15 13:20:58,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:58,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:58,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Second operand 116 states. [2022-04-15 13:20:58,635 INFO L87 Difference]: Start difference. First operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Second operand 116 states. [2022-04-15 13:20:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:58,637 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-15 13:20:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-15 13:20:58,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:58,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:58,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:58,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-15 13:20:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2022-04-15 13:20:58,639 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 68 [2022-04-15 13:20:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:58,639 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2022-04-15 13:20:58,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:20:58,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 130 transitions. [2022-04-15 13:20:58,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2022-04-15 13:20:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 13:20:58,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:58,892 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2022-04-15 13:20:58,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 13:20:59,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 13:20:59,092 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 617921138, now seen corresponding path program 1 times [2022-04-15 13:20:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:59,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498283100] [2022-04-15 13:20:59,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:20:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 617921138, now seen corresponding path program 2 times [2022-04-15 13:20:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:59,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912690911] [2022-04-15 13:20:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:20:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-15 13:20:59,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-15 13:20:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:20:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-15 13:20:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:20:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-15 13:20:59,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-15 13:20:59,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-15 13:20:59,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,168 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-15 13:20:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:20:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-15 13:20:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:20:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-15 13:20:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:20:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-15 13:20:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:20:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {10793#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {10794#(<= 2 upsweep_~space~0)} assume !(~space~0 < ~n); {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {10794#(<= 2 upsweep_~space~0)} #res := ~space~0; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-15 13:20:59,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {10795#(<= 2 |upsweep_#res|)} assume true; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-15 13:20:59,222 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10795#(<= 2 |upsweep_#res|)} {10771#(<= 2 main_~n~0)} #152#return; {10781#(<= 2 |main_#t~ret19|)} is VALID [2022-04-15 13:20:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:20:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:20:59,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10782#(<= 2 main_~space~1)} #154#return; {10746#false} is VALID [2022-04-15 13:20:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 13:20:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10746#false} #158#return; {10746#false} is VALID [2022-04-15 13:20:59,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {10745#true} call ULTIMATE.init(); {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {10745#true} call #t~ret20 := main(); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {10745#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {10745#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L272 TraceCheckUtils]: 11: Hoare triple {10745#true} call #t~ret14 := is_pow2(~n~0); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-15 13:20:59,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {10745#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {10745#true} call assume_abort_if_not(#t~ret14); {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-15 13:20:59,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {10745#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,300 INFO L272 TraceCheckUtils]: 24: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:59,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,300 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-15 13:20:59,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {10745#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:59,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,301 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-15 13:20:59,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {10745#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {10769#(= main_~i~1 0)} is VALID [2022-04-15 13:20:59,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {10769#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10769#(= main_~i~1 0)} is VALID [2022-04-15 13:20:59,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {10769#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10770#(<= 1 main_~i~1)} is VALID [2022-04-15 13:20:59,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {10770#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10771#(<= 2 main_~n~0)} is VALID [2022-04-15 13:20:59,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {10771#(<= 2 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10771#(<= 2 main_~n~0)} is VALID [2022-04-15 13:20:59,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {10771#(<= 2 main_~n~0)} assume !(~i~1 < ~n~0); {10771#(<= 2 main_~n~0)} is VALID [2022-04-15 13:20:59,304 INFO L272 TraceCheckUtils]: 39: Hoare triple {10771#(<= 2 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:59,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {10793#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {10794#(<= 2 upsweep_~space~0)} assume !(~space~0 < ~n); {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:20:59,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {10794#(<= 2 upsweep_~space~0)} #res := ~space~0; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-15 13:20:59,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {10795#(<= 2 |upsweep_#res|)} assume true; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-15 13:20:59,307 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10795#(<= 2 |upsweep_#res|)} {10771#(<= 2 main_~n~0)} #152#return; {10781#(<= 2 |main_#t~ret19|)} is VALID [2022-04-15 13:20:59,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {10781#(<= 2 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {10782#(<= 2 main_~space~1)} is VALID [2022-04-15 13:20:59,308 INFO L272 TraceCheckUtils]: 50: Hoare triple {10782#(<= 2 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:20:59,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:20:59,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,311 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10782#(<= 2 main_~space~1)} #154#return; {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L272 TraceCheckUtils]: 55: Hoare triple {10746#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {10746#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {10746#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L272 TraceCheckUtils]: 58: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10745#true} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,311 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10745#true} {10746#false} #158#return; {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {10746#false} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 64: Hoare triple {10746#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {10746#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-15 13:20:59,311 INFO L272 TraceCheckUtils]: 66: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10746#false} is VALID [2022-04-15 13:20:59,312 INFO L290 TraceCheckUtils]: 67: Hoare triple {10746#false} ~cond := #in~cond; {10746#false} is VALID [2022-04-15 13:20:59,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {10746#false} assume 0 == ~cond; {10746#false} is VALID [2022-04-15 13:20:59,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {10746#false} assume !false; {10746#false} is VALID [2022-04-15 13:20:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:20:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:59,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912690911] [2022-04-15 13:20:59,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912690911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:20:59,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118154306] [2022-04-15 13:20:59,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:20:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:59,332 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:20:59,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:20:59,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:20:59,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:20:59,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 13:20:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:59,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:59,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {10745#true} call ULTIMATE.init(); {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {10745#true} call #t~ret20 := main(); {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {10745#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {10745#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L272 TraceCheckUtils]: 11: Hoare triple {10745#true} call #t~ret14 := is_pow2(~n~0); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {10745#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L272 TraceCheckUtils]: 18: Hoare triple {10745#true} call assume_abort_if_not(#t~ret14); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,933 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {10745#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {10745#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {10745#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L272 TraceCheckUtils]: 29: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {10745#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {10745#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {10745#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {10745#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10745#true} is VALID [2022-04-15 13:20:59,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {10745#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10745#true} is VALID [2022-04-15 13:20:59,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {10745#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10745#true} is VALID [2022-04-15 13:20:59,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {10745#true} assume !(~i~1 < ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,935 INFO L272 TraceCheckUtils]: 39: Hoare triple {10745#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {10745#true} is VALID [2022-04-15 13:20:59,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {10745#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:20:59,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:20:59,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:20:59,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !(~left~0 < ~n); {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:20:59,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} ~space~0 := 2 * ~space~0; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-15 13:20:59,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !(~space~0 < ~n); {10937#(<= |upsweep_#in~n| upsweep_~space~0)} is VALID [2022-04-15 13:20:59,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {10937#(<= |upsweep_#in~n| upsweep_~space~0)} #res := ~space~0; {10941#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-15 13:20:59,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {10941#(<= |upsweep_#in~n| |upsweep_#res|)} assume true; {10941#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-15 13:20:59,938 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10941#(<= |upsweep_#in~n| |upsweep_#res|)} {10745#true} #152#return; {10948#(<= main_~n~0 |main_#t~ret19|)} is VALID [2022-04-15 13:20:59,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(<= main_~n~0 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {10952#(<= main_~n~0 main_~space~1)} is VALID [2022-04-15 13:20:59,938 INFO L272 TraceCheckUtils]: 50: Hoare triple {10952#(<= main_~n~0 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {10745#true} is VALID [2022-04-15 13:20:59,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {10745#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10959#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} is VALID [2022-04-15 13:20:59,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {10959#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-15 13:20:59,941 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10952#(<= main_~n~0 main_~space~1)} #154#return; {10969#(<= main_~n~0 1)} is VALID [2022-04-15 13:20:59,942 INFO L272 TraceCheckUtils]: 55: Hoare triple {10969#(<= main_~n~0 1)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {10973#(<= |check_#in~n| 1)} is VALID [2022-04-15 13:20:59,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {10973#(<= |check_#in~n| 1)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:20:59,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:20:59,942 INFO L272 TraceCheckUtils]: 58: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10745#true} is VALID [2022-04-15 13:20:59,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-15 13:20:59,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-15 13:20:59,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-15 13:20:59,943 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10745#true} {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} #158#return; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:20:59,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-15 13:20:59,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11002#(and (<= check_~n 1) (<= 1 check_~i~0))} is VALID [2022-04-15 13:20:59,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {11002#(and (<= check_~n 1) (<= 1 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-15 13:20:59,944 INFO L272 TraceCheckUtils]: 66: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10746#false} is VALID [2022-04-15 13:20:59,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {10746#false} ~cond := #in~cond; {10746#false} is VALID [2022-04-15 13:20:59,945 INFO L290 TraceCheckUtils]: 68: Hoare triple {10746#false} assume 0 == ~cond; {10746#false} is VALID [2022-04-15 13:20:59,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {10746#false} assume !false; {10746#false} is VALID [2022-04-15 13:20:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 13:20:59,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:20:59,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118154306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:59,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:20:59,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2022-04-15 13:20:59,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:59,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498283100] [2022-04-15 13:20:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498283100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:59,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:59,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:20:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506001909] [2022-04-15 13:20:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-04-15 13:20:59,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:59,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:20:59,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:59,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:20:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:20:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:20:59,986 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:21:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:16,229 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2022-04-15 13:21:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:21:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-04-15 13:21:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:21:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:21:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-04-15 13:21:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:21:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-04-15 13:21:16,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2022-04-15 13:21:16,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:16,291 INFO L225 Difference]: With dead ends: 129 [2022-04-15 13:21:16,291 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 13:21:16,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:21:16,292 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:21:16,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 536 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:21:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 13:21:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2022-04-15 13:21:16,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:21:16,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:16,551 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:16,552 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:16,553 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-15 13:21:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-04-15 13:21:16,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:16,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:16,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-15 13:21:16,554 INFO L87 Difference]: Start difference. First operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-15 13:21:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:16,556 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-15 13:21:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-04-15 13:21:16,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:16,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:16,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:21:16,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:21:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-04-15 13:21:16,558 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2022-04-15 13:21:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:21:16,558 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-04-15 13:21:16,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:21:16,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 125 transitions. [2022-04-15 13:21:16,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-04-15 13:21:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 13:21:16,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:21:16,794 INFO L499 BasicCegarLoop]: trace histogram [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, 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, 1] [2022-04-15 13:21:16,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 13:21:16,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 13:21:16,995 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:21:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:21:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash -677053431, now seen corresponding path program 7 times [2022-04-15 13:21:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:16,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506986708] [2022-04-15 13:21:16,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:21:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash -677053431, now seen corresponding path program 8 times [2022-04-15 13:21:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:21:16,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715393981] [2022-04-15 13:21:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:21:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:21:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:21:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-15 13:21:17,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-15 13:21:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:21:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-15 13:21:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:21:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-15 13:21:17,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-15 13:21:17,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-15 13:21:17,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,077 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-15 13:21:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:21:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-15 13:21:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:21:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-15 13:21:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:21:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-15 13:21:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 13:21:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11761#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:21:17,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {11761#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11762#(<= 0 upsweep_~left~0)} is VALID [2022-04-15 13:21:17,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {11762#(<= 0 upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} is VALID [2022-04-15 13:21:17,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} assume !(~left~0 < ~n); {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} ~space~0 := 2 * ~space~0; {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} assume !(~space~0 < ~n); {11714#false} is VALID [2022-04-15 13:21:17,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {11714#false} #res := ~space~0; {11714#false} is VALID [2022-04-15 13:21:17,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-15 13:21:17,163 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11714#false} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-15 13:21:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 13:21:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,171 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-15 13:21:17,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-15 13:21:17,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-15 13:21:17,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,174 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:17,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,174 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-15 13:21:17,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,175 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:17,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-15 13:21:17,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11737#(= main_~i~1 0)} is VALID [2022-04-15 13:21:17,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {11737#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11737#(= main_~i~1 0)} is VALID [2022-04-15 13:21:17,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {11737#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:17,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:17,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-15 13:21:17,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,179 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:17,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11761#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:21:17,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {11761#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11762#(<= 0 upsweep_~left~0)} is VALID [2022-04-15 13:21:17,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {11762#(<= 0 upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} is VALID [2022-04-15 13:21:17,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} assume !(~left~0 < ~n); {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} ~space~0 := 2 * ~space~0; {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} assume !(~space~0 < ~n); {11714#false} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {11714#false} #res := ~space~0; {11714#false} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-15 13:21:17,183 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11714#false} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-15 13:21:17,183 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-15 13:21:17,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,184 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-15 13:21:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 13:21:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:21:17,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715393981] [2022-04-15 13:21:17,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715393981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:21:17,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085335543] [2022-04-15 13:21:17,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:21:17,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:21:17,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:21:17,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:21:17,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:21:17,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:21:17,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:21:17,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:21:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:17,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:21:17,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-15 13:21:17,902 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,903 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:17,904 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-15 13:21:17,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11868#(<= 0 main_~i~1)} is VALID [2022-04-15 13:21:17,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {11868#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11868#(<= 0 main_~i~1)} is VALID [2022-04-15 13:21:17,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {11868#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:17,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:17,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-15 13:21:17,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:17,928 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11713#true} is VALID [2022-04-15 13:21:17,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {11912#(and (<= (div (- upsweep_~space~0) (- 2)) 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:21:17,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {11912#(and (<= (div (- upsweep_~space~0) (- 2)) 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:17,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} #res := ~space~0; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:17,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} assume true; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:17,933 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {11714#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {11714#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {11714#false} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11714#false} is VALID [2022-04-15 13:21:17,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {11714#false} assume !(~right~1 < ~n); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {11714#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {11714#false} assume !(~space > 0); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11714#false} {11714#false} #154#return; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-15 13:21:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:21:17,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:21:18,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-15 13:21:18,479 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 57: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-15 13:21:18,480 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11713#true} is VALID [2022-04-15 13:21:18,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-15 13:21:18,481 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-15 13:21:18,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} assume true; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:18,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} #res := ~space~0; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:18,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {12040#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< upsweep_~space~0 upsweep_~n))} assume !(~space~0 < ~n); {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-15 13:21:18,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} ~space~0 := 2 * ~space~0; {12040#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< upsweep_~space~0 upsweep_~n))} is VALID [2022-04-15 13:21:18,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !(~left~0 < ~n); {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:21:18,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:21:18,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:21:18,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:21:18,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-15 13:21:18,484 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11713#true} is VALID [2022-04-15 13:21:18,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:18,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:18,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-15 13:21:18,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {11868#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {11868#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11868#(<= 0 main_~i~1)} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11868#(<= 0 main_~i~1)} is VALID [2022-04-15 13:21:18,486 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-15 13:21:18,487 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-15 13:21:18,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-15 13:21:18,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-15 13:21:18,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11713#true} is VALID [2022-04-15 13:21:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:21:18,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085335543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:21:18,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:21:18,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 19 [2022-04-15 13:21:18,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:21:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506986708] [2022-04-15 13:21:18,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506986708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:21:18,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:21:18,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:21:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602073587] [2022-04-15 13:21:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:21:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2022-04-15 13:21:18,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:21:18,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:21:18,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:18,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:21:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:18,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:21:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:21:18,518 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:21:27,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:29,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:33,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:35,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:37,352 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-04-15 13:21:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:21:37,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2022-04-15 13:21:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:21:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:21:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2022-04-15 13:21:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:21:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2022-04-15 13:21:37,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 111 transitions. [2022-04-15 13:21:37,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:37,464 INFO L225 Difference]: With dead ends: 165 [2022-04-15 13:21:37,464 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 13:21:37,465 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:21:37,465 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 63 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:21:37,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 65 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 726 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2022-04-15 13:21:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 13:21:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 13:21:37,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:21:37,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:37,756 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:37,756 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:37,758 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2022-04-15 13:21:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-04-15 13:21:37,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:37,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:37,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-15 13:21:37,759 INFO L87 Difference]: Start difference. First operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-15 13:21:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:37,761 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2022-04-15 13:21:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-04-15 13:21:37,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:37,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:37,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:21:37,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:21:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-15 13:21:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2022-04-15 13:21:37,763 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 69 [2022-04-15 13:21:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:21:37,763 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2022-04-15 13:21:37,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 13:21:37,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 133 transitions. [2022-04-15 13:21:38,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2022-04-15 13:21:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 13:21:38,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:21:38,036 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:21:38,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:21:38,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 13:21:38,236 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:21:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:21:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1405616165, now seen corresponding path program 9 times [2022-04-15 13:21:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:38,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373380539] [2022-04-15 13:21:38,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:21:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1405616165, now seen corresponding path program 10 times [2022-04-15 13:21:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:21:38,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059400471] [2022-04-15 13:21:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:21:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:21:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:21:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-15 13:21:38,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-15 13:21:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:21:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-15 13:21:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:21:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-15 13:21:38,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-15 13:21:38,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-15 13:21:38,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,306 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-15 13:21:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:21:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-15 13:21:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:21:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-15 13:21:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:21:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-15 13:21:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:21:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,322 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:21:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13027#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {13027#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} assume !(~right~1 < ~n); {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} is VALID [2022-04-15 13:21:38,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-15 13:21:38,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-15 13:21:38,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,421 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-15 13:21:38,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-15 13:21:38,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,424 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:38,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,424 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-15 13:21:38,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,425 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:38,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,425 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-15 13:21:38,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13000#(= main_~i~1 0)} is VALID [2022-04-15 13:21:38,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {13000#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13000#(= main_~i~1 0)} is VALID [2022-04-15 13:21:38,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:38,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:38,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-15 13:21:38,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,428 INFO L272 TraceCheckUtils]: 39: Hoare triple {13003#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,429 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {13003#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,430 INFO L272 TraceCheckUtils]: 50: Hoare triple {13003#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:38,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13027#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {13027#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} assume !(~right~1 < ~n); {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-15 13:21:38,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} is VALID [2022-04-15 13:21:38,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-15 13:21:38,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-15 13:21:38,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,436 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-15 13:21:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:21:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:21:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059400471] [2022-04-15 13:21:38,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059400471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:21:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104366947] [2022-04-15 13:21:38,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:21:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:21:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:21:38,438 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:21:38,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:21:38,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:21:38,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:21:38,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:21:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:38,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:21:38,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {12976#true} is VALID [2022-04-15 13:21:38,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-15 13:21:38,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,924 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:38,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,926 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-15 13:21:38,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13135#(<= main_~i~1 0)} is VALID [2022-04-15 13:21:38,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {13135#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13135#(<= main_~i~1 0)} is VALID [2022-04-15 13:21:38,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {13135#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:38,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:38,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,928 INFO L272 TraceCheckUtils]: 39: Hoare triple {13003#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-15 13:21:38,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:38,929 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {13003#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13003#(<= main_~n~0 2)} is VALID [2022-04-15 13:21:38,929 INFO L272 TraceCheckUtils]: 50: Hoare triple {13003#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {12976#true} is VALID [2022-04-15 13:21:38,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13190#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {13190#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13194#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:21:38,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {13194#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:21:38,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} assume !(~right~1 < ~n); {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} is VALID [2022-04-15 13:21:38,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13205#(and (< downsweep_~space (+ (div (div |downsweep_#in~n| 2) 2) 1)) (< 0 (div |downsweep_#in~n| 2)))} is VALID [2022-04-15 13:21:38,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {13205#(and (< downsweep_~space (+ (div (div |downsweep_#in~n| 2) 2) 1)) (< 0 (div |downsweep_#in~n| 2)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:38,935 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-15 13:21:38,935 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-15 13:21:38,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-15 13:21:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:21:38,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:21:43,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-15 13:21:43,140 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-15 13:21:43,142 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} #154#return; {12977#false} is VALID [2022-04-15 13:21:43,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {13291#(or (<= 4 |downsweep_#in~n|) (not (< 0 downsweep_~space)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-15 13:21:43,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13291#(or (<= 4 |downsweep_#in~n|) (not (< 0 downsweep_~space)))} is VALID [2022-04-15 13:21:43,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} assume !(~right~1 < ~n); {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:21:43,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {13302#(or (<= (div downsweep_~space 2) 0) (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:21:43,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {13306#(or (<= (div (* (- 1) (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2))) (- 2)) 1) (<= 4 |downsweep_#in~n|))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13302#(or (<= (div downsweep_~space 2) 0) (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:21:43,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13306#(or (<= (div (* (- 1) (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2))) (- 2)) 1) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-15 13:21:43,146 INFO L272 TraceCheckUtils]: 50: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {12976#true} is VALID [2022-04-15 13:21:43,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-15 13:21:43,147 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} #152#return; {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-15 13:21:43,147 INFO L272 TraceCheckUtils]: 39: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {12976#true} is VALID [2022-04-15 13:21:43,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {13346#(<= (div (+ (- 1) (div (+ (* (- 1) main_~i~1) (- 3)) 2)) (- 2)) 2)} assume !(~i~1 < ~n~0); {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-15 13:21:43,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {13002#(<= main_~i~1 2)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13346#(<= (div (+ (- 1) (div (+ (* (- 1) main_~i~1) (- 3)) 2)) (- 2)) 2)} is VALID [2022-04-15 13:21:43,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {13002#(<= main_~i~1 2)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13002#(<= main_~i~1 2)} is VALID [2022-04-15 13:21:43,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-15 13:21:43,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13001#(<= main_~i~1 1)} is VALID [2022-04-15 13:21:43,150 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-15 13:21:43,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {12976#true} is VALID [2022-04-15 13:21:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 13:21:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104366947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:21:43,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:21:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 25 [2022-04-15 13:21:43,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:21:43,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373380539] [2022-04-15 13:21:43,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373380539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:21:43,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:21:43,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:21:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293305653] [2022-04-15 13:21:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:21:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2022-04-15 13:21:43,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:21:43,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:21:43,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:43,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:21:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:21:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-15 13:21:43,181 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:21:47,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:49,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:21:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:53,138 INFO L93 Difference]: Finished difference Result 127 states and 153 transitions. [2022-04-15 13:21:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:21:53,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2022-04-15 13:21:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:21:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:21:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-04-15 13:21:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:21:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-04-15 13:21:53,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 104 transitions. [2022-04-15 13:21:53,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:53,225 INFO L225 Difference]: With dead ends: 127 [2022-04-15 13:21:53,225 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 13:21:53,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:21:53,226 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:21:53,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 382 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 13:21:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 13:21:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2022-04-15 13:21:53,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:21:53,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 13:21:53,529 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 13:21:53,529 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 13:21:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:53,532 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-15 13:21:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-15 13:21:53,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:53,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:53,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Second operand 115 states. [2022-04-15 13:21:53,532 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Second operand 115 states. [2022-04-15 13:21:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:53,534 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-15 13:21:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-15 13:21:53,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:53,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:53,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:21:53,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:21:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 13:21:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-04-15 13:21:53,537 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 70 [2022-04-15 13:21:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:21:53,537 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-04-15 13:21:53,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:21:53,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 121 transitions. [2022-04-15 13:21:53,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-15 13:21:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 13:21:53,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:21:53,763 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2022-04-15 13:21:53,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:21:53,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:21:53,979 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:21:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:21:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -495926943, now seen corresponding path program 1 times [2022-04-15 13:21:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:53,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505439918] [2022-04-15 13:21:53,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:21:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -495926943, now seen corresponding path program 2 times [2022-04-15 13:21:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:21:53,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384671237] [2022-04-15 13:21:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:21:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:21:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:21:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-15 13:21:54,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-15 13:21:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:21:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-15 13:21:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:21:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~x := #in~x; {14223#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-15 13:21:54,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {14223#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} is VALID [2022-04-15 13:21:54,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-15 13:21:54,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} assume true; {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-15 13:21:54,197 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} {14172#true} #144#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:21:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #146#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:21:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-15 13:21:54,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #148#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:21:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-15 13:21:54,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #150#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 13:21:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {14172#true} assume !(~left~0 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {14172#true} ~space~0 := 2 * ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume !(~space~0 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {14172#true} #res := ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,224 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14172#true} {14173#false} #152#return; {14173#false} is VALID [2022-04-15 13:21:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 13:21:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {14172#true} assume !(~right~1 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {14172#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume !(~space > 0); {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,234 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14172#true} {14173#false} #154#return; {14173#false} is VALID [2022-04-15 13:21:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 13:21:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14173#false} #158#return; {14173#false} is VALID [2022-04-15 13:21:54,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {14172#true} call ULTIMATE.init(); {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:21:54,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {14172#true} call #t~ret20 := main(); {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {14172#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-15 13:21:54,238 INFO L272 TraceCheckUtils]: 11: Hoare triple {14172#true} call #t~ret14 := is_pow2(~n~0); {14172#true} is VALID [2022-04-15 13:21:54,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {14172#true} ~x := #in~x; {14223#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-15 13:21:54,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {14223#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} is VALID [2022-04-15 13:21:54,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-15 13:21:54,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} assume true; {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-15 13:21:54,241 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} {14172#true} #144#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,241 INFO L272 TraceCheckUtils]: 18: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call assume_abort_if_not(#t~ret14); {14172#true} is VALID [2022-04-15 13:21:54,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,242 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #146#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:54,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-15 13:21:54,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,243 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #148#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,244 INFO L272 TraceCheckUtils]: 29: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:54,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-15 13:21:54,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,245 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #150#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-15 13:21:54,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} is VALID [2022-04-15 13:21:54,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} is VALID [2022-04-15 13:21:54,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14198#(or (<= main_~n~0 main_~i~1) (<= (+ main_~i~1 2) main_~n~0))} is VALID [2022-04-15 13:21:54,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {14198#(or (<= main_~n~0 main_~i~1) (<= (+ main_~i~1 2) main_~n~0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14199#(<= (+ main_~i~1 2) main_~n~0)} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {14199#(<= (+ main_~i~1 2) main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14200#(<= (+ main_~i~1 1) main_~n~0)} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {14200#(<= (+ main_~i~1 1) main_~n~0)} assume !(~i~1 < ~n~0); {14173#false} is VALID [2022-04-15 13:21:54,247 INFO L272 TraceCheckUtils]: 39: Hoare triple {14173#false} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14172#true} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {14172#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14172#true} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {14172#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {14172#true} assume !(~left~0 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {14172#true} ~space~0 := 2 * ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {14172#true} assume !(~space~0 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {14172#true} #res := ~space~0; {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14172#true} {14173#false} #152#return; {14173#false} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {14173#false} is VALID [2022-04-15 13:21:54,248 INFO L272 TraceCheckUtils]: 50: Hoare triple {14173#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {14172#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {14172#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {14172#true} assume !(~right~1 < ~n); {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {14172#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {14172#true} assume !(~space > 0); {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,248 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14172#true} {14173#false} #154#return; {14173#false} is VALID [2022-04-15 13:21:54,248 INFO L272 TraceCheckUtils]: 59: Hoare triple {14173#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {14173#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L272 TraceCheckUtils]: 62: Hoare triple {14173#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14172#true} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:21:54,249 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14172#true} {14173#false} #158#return; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#false} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {14173#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L272 TraceCheckUtils]: 70: Hoare triple {14173#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#false} ~cond := #in~cond; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#false} assume 0 == ~cond; {14173#false} is VALID [2022-04-15 13:21:54,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#false} assume !false; {14173#false} is VALID [2022-04-15 13:21:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 13:21:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:21:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384671237] [2022-04-15 13:21:54,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384671237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:21:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444739577] [2022-04-15 13:21:54,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:21:54,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:21:54,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:21:54,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:21:54,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:21:54,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:21:54,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:21:54,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 114 conjunts are in the unsatisfiable core [2022-04-15 13:21:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:54,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:21:54,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-15 13:21:54,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-04-15 13:21:54,600 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-15 13:21:54,600 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 11 treesize of output 11 [2022-04-15 13:21:54,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-04-15 13:21:54,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-04-15 13:21:54,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-04-15 13:22:00,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-04-15 13:22:04,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-04-15 13:22:11,357 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (= (let ((.cse1 (* downsweep_~left~1 4))) (store (let ((.cse0 (store (store .cse2 (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0))) (store .cse0 4 (+ (select .cse0 4) (select .cse0 .cse1)))) .cse1 v_ArrVal_571)) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (= .cse2 (select |c_#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0)))) is different from true [2022-04-15 13:22:32,666 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-04-15 13:22:32,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 175 [2022-04-15 13:22:34,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {14172#true} call ULTIMATE.init(); {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {14172#true} call #t~ret20 := main(); {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {14172#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-15 13:22:34,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {14172#true} call #t~ret14 := is_pow2(~n~0); {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {14172#true} ~x := #in~x; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {14172#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {14172#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14172#true} {14172#true} #144#return; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {14172#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L272 TraceCheckUtils]: 18: Hoare triple {14172#true} call assume_abort_if_not(#t~ret14); {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-15 13:22:34,700 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14172#true} {14172#true} #146#return; {14172#true} is VALID [2022-04-15 13:22:34,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {14172#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-15 13:22:34,702 INFO L272 TraceCheckUtils]: 24: Hoare triple {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {14303#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|)))} is VALID [2022-04-15 13:22:34,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {14303#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:22:34,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:22:34,704 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {14314#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:22:34,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {14314#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:22:34,705 INFO L272 TraceCheckUtils]: 29: Hoare triple {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:22:34,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} is VALID [2022-04-15 13:22:34,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} assume true; {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} is VALID [2022-04-15 13:22:34,707 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {14332#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:22:34,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {14332#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !(~i~1 < ~n~0); {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-15 13:22:34,710 INFO L272 TraceCheckUtils]: 39: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:22:34,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:22:34,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {14358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14362#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:22:34,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {14362#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:22:34,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:22:35,432 WARN L290 TraceCheckUtils]: 44: Hoare triple {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {14373#(and (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (<= |upsweep_#in~n| upsweep_~n))} is UNKNOWN [2022-04-15 13:22:35,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {14373#(and (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {14377#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is VALID [2022-04-15 13:22:36,140 WARN L290 TraceCheckUtils]: 46: Hoare triple {14377#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} #res := ~space~0; {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} is UNKNOWN [2022-04-15 13:22:36,882 WARN L290 TraceCheckUtils]: 47: Hoare triple {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} assume true; {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} is UNKNOWN [2022-04-15 13:22:36,883 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #152#return; {14388#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} is VALID [2022-04-15 13:22:37,461 WARN L290 TraceCheckUtils]: 49: Hoare triple {14388#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} is UNKNOWN [2022-04-15 13:22:37,462 INFO L272 TraceCheckUtils]: 50: Hoare triple {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:22:37,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14399#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} is VALID [2022-04-15 13:22:37,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {14399#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14403#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} is VALID [2022-04-15 13:22:37,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {14403#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is VALID [2022-04-15 13:22:38,858 WARN L290 TraceCheckUtils]: 54: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume !(~right~1 < ~n); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-15 13:22:40,634 WARN L290 TraceCheckUtils]: 55: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-15 13:22:41,987 WARN L290 TraceCheckUtils]: 56: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume !(~space > 0); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-15 13:22:43,092 WARN L290 TraceCheckUtils]: 57: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume true; {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-15 13:22:44,630 WARN L284 TraceCheckUtils]: 58: Hoare quadruple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} #154#return; {14423#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset (* downsweep_~left~1 4))))) (+ main_~a~0.offset (* downsweep_~left~1 4)) v_ArrVal_571)) (<= main_~a~0.offset upsweep_~a.offset))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is UNKNOWN [2022-04-15 13:22:46,400 WARN L272 TraceCheckUtils]: 59: Hoare triple {14423#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset (* downsweep_~left~1 4))))) (+ main_~a~0.offset (* downsweep_~left~1 4)) v_ArrVal_571)) (<= main_~a~0.offset upsweep_~a.offset))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {14427#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a0.base|)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| |check_#in~a.base|)) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_59) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0))))} is UNKNOWN [2022-04-15 13:22:46,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {14427#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a0.base|)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| |check_#in~a.base|)) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_59) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0))))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is VALID [2022-04-15 13:22:47,903 WARN L290 TraceCheckUtils]: 61: Hoare triple {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is UNKNOWN [2022-04-15 13:22:49,949 WARN L272 TraceCheckUtils]: 62: Hoare triple {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is UNKNOWN [2022-04-15 13:22:49,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} ~cond := #in~cond; {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is VALID [2022-04-15 13:22:50,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} assume !(0 == ~cond); {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is VALID [2022-04-15 13:22:50,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} assume true; {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is VALID [2022-04-15 13:22:50,036 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} #158#return; {14451#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)))) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is VALID [2022-04-15 13:22:52,079 WARN L290 TraceCheckUtils]: 67: Hoare triple {14451#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)))) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {14455#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (= (+ check_~sum~0 (* (- 1) (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))))) 0) (not (= check_~a.base check_~a0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))) (= check_~a.offset 0))} is UNKNOWN [2022-04-15 13:22:52,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {14455#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (= (+ check_~sum~0 (* (- 1) (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))))) 0) (not (= check_~a.base check_~a0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14459#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 1) (= check_~a.offset 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) check_~a0.offset)) check_~sum~0) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))))} is VALID [2022-04-15 13:22:52,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {14459#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 1) (= check_~a.offset 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) check_~a0.offset)) check_~sum~0) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14463#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (= (select (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) 4) |check_#t~mem11|) (< 1 v_main_~n~0_BEFORE_CALL_59) (<= downsweep_~left~1 0))) (exists ((check_~a0.offset Int)) (= (+ (* (- 1) (select ((as const (Array Int Int)) 0) check_~a0.offset)) check_~sum~0) 0)))} is VALID [2022-04-15 13:22:52,123 INFO L272 TraceCheckUtils]: 70: Hoare triple {14463#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (= (select (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) 4) |check_#t~mem11|) (< 1 v_main_~n~0_BEFORE_CALL_59) (<= downsweep_~left~1 0))) (exists ((check_~a0.offset Int)) (= (+ (* (- 1) (select ((as const (Array Int Int)) 0) check_~a0.offset)) check_~sum~0) 0)))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:22:52,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {14467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:22:52,124 INFO L290 TraceCheckUtils]: 72: Hoare triple {14471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14173#false} is VALID [2022-04-15 13:22:52,124 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#false} assume !false; {14173#false} is VALID [2022-04-15 13:22:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2022-04-15 13:22:52,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:22:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444739577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:22:52,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:22:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-04-15 13:22:52,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:22:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505439918] [2022-04-15 13:22:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505439918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:22:52,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:22:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:22:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181249239] [2022-04-15 13:22:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:22:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-04-15 13:22:52,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:22:52,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:22:52,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:22:52,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:22:52,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:22:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:22:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1776, Unknown=10, NotChecked=84, Total=1980 [2022-04-15 13:22:52,613 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:22:54,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:22:56,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:00,712 INFO L93 Difference]: Finished difference Result 185 states and 226 transitions. [2022-04-15 13:23:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:23:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-04-15 13:23:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:23:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:23:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-15 13:23:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:23:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-15 13:23:00,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-15 13:23:00,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:23:00,820 INFO L225 Difference]: With dead ends: 185 [2022-04-15 13:23:00,820 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 13:23:00,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=190, Invalid=2884, Unknown=10, NotChecked=108, Total=3192 [2022-04-15 13:23:00,822 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 88 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:23:00,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 62 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 13:23:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 13:23:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-04-15 13:23:01,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:23:01,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-15 13:23:01,116 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-15 13:23:01,117 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-15 13:23:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:01,119 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-15 13:23:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-15 13:23:01,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:23:01,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:23:01,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) Second operand 123 states. [2022-04-15 13:23:01,119 INFO L87 Difference]: Start difference. First operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) Second operand 123 states. [2022-04-15 13:23:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:01,121 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-15 13:23:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-15 13:23:01,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:23:01,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:23:01,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:23:01,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:23:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-15 13:23:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-04-15 13:23:01,123 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 74 [2022-04-15 13:23:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:23:01,124 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-04-15 13:23:01,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 13:23:01,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 141 transitions. [2022-04-15 13:23:01,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:23:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-04-15 13:23:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 13:23:01,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:23:01,383 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:23:01,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 13:23:01,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:23:01,599 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:23:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:23:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1541127366, now seen corresponding path program 11 times [2022-04-15 13:23:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:23:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371316097] [2022-04-15 13:23:01,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:23:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1541127366, now seen corresponding path program 12 times [2022-04-15 13:23:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:23:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911348692] [2022-04-15 13:23:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:23:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:23:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:23:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-15 13:23:01,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-15 13:23:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:23:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:01,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:01,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-15 13:23:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:23:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-15 13:23:01,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-15 13:23:01,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-15 13:23:01,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,696 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-15 13:23:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:23:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:01,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:01,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-15 13:23:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:23:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:01,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-15 13:23:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:23:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:01,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-15 13:23:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 13:23:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {15430#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !(~left~0 < ~n); {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {15431#(<= 2 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {15432#(<= 4 upsweep_~space~0)} assume !(~space~0 < ~n); {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {15432#(<= 4 upsweep_~space~0)} #res := ~space~0; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-15 13:23:01,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {15433#(<= 4 |upsweep_#res|)} assume true; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-15 13:23:01,771 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15433#(<= 4 |upsweep_#res|)} {15380#true} #152#return; {15418#(<= 4 |main_#t~ret19|)} is VALID [2022-04-15 13:23:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-15 13:23:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:01,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~right~1 < ~n); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} is VALID [2022-04-15 13:23:01,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:01,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:01,874 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15419#(<= 4 main_~space~1)} #154#return; {15381#false} is VALID [2022-04-15 13:23:01,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:23:01,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-15 13:23:01,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-15 13:23:01,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-15 13:23:01,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:01,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:01,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:01,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,877 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-15 13:23:01,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:01,877 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:01,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-15 13:23:01,879 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:01,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {15430#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !(~left~0 < ~n); {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {15431#(<= 2 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {15432#(<= 4 upsweep_~space~0)} assume !(~space~0 < ~n); {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-15 13:23:01,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {15432#(<= 4 upsweep_~space~0)} #res := ~space~0; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-15 13:23:01,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {15433#(<= 4 |upsweep_#res|)} assume true; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-15 13:23:01,883 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15433#(<= 4 |upsweep_#res|)} {15380#true} #152#return; {15418#(<= 4 |main_#t~ret19|)} is VALID [2022-04-15 13:23:01,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {15418#(<= 4 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15419#(<= 4 main_~space~1)} is VALID [2022-04-15 13:23:01,884 INFO L272 TraceCheckUtils]: 57: Hoare triple {15419#(<= 4 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:01,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,888 INFO L290 TraceCheckUtils]: 61: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~right~1 < ~n); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-15 13:23:01,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} is VALID [2022-04-15 13:23:01,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:01,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:01,891 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15419#(<= 4 main_~space~1)} #154#return; {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L272 TraceCheckUtils]: 66: Hoare triple {15381#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {15381#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {15381#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-15 13:23:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:23:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:23:01,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911348692] [2022-04-15 13:23:01,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911348692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:23:01,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345639681] [2022-04-15 13:23:01,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:23:01,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:23:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:23:01,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:23:01,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:23:01,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:23:01,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:23:01,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 13:23:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:02,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:23:03,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-15 13:23:03,663 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:03,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:03,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,666 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15380#true} is VALID [2022-04-15 13:23:03,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {15595#(and (<= 1 (div (div upsweep_~space~0 2) 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:23:03,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {15595#(and (<= 1 (div (div upsweep_~space~0 2) 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {15599#(and (<= |upsweep_#in~n| upsweep_~space~0) (<= 1 (div (div upsweep_~space~0 2) 2)))} is VALID [2022-04-15 13:23:03,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {15599#(and (<= |upsweep_#in~n| upsweep_~space~0) (<= 1 (div (div upsweep_~space~0 2) 2)))} #res := ~space~0; {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} is VALID [2022-04-15 13:23:03,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} assume true; {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} is VALID [2022-04-15 13:23:03,691 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} {15380#true} #152#return; {15610#(and (<= 1 (div (div |main_#t~ret19| 2) 2)) (<= main_~n~0 |main_#t~ret19|))} is VALID [2022-04-15 13:23:03,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {15610#(and (<= 1 (div (div |main_#t~ret19| 2) 2)) (<= main_~n~0 |main_#t~ret19|))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} is VALID [2022-04-15 13:23:03,692 INFO L272 TraceCheckUtils]: 57: Hoare triple {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15380#true} is VALID [2022-04-15 13:23:03,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15621#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} is VALID [2022-04-15 13:23:03,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {15621#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-15 13:23:03,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-15 13:23:03,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} assume !(~right~1 < ~n); {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-15 13:23:03,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15635#(and (< (div (+ (* (- 1) (div |downsweep_#in~space| 2)) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} is VALID [2022-04-15 13:23:03,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {15635#(and (< (div (+ (* (- 1) (div |downsweep_#in~space| 2)) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:03,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:03,697 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} #154#return; {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L272 TraceCheckUtils]: 66: Hoare triple {15381#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L290 TraceCheckUtils]: 67: Hoare triple {15381#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {15381#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-15 13:23:03,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-15 13:23:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:23:03,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:23:10,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-15 13:23:10,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-15 13:23:10,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-15 13:23:10,156 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-15 13:23:10,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {15678#(not (< check_~i~0 check_~n))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-15 13:23:10,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {15682#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15678#(not (< check_~i~0 check_~n))} is VALID [2022-04-15 13:23:10,157 INFO L272 TraceCheckUtils]: 66: Hoare triple {15686#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15682#(<= |check_#in~n| 0)} is VALID [2022-04-15 13:23:10,158 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} #154#return; {15686#(<= main_~n~0 0)} is VALID [2022-04-15 13:23:10,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:10,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {15700#(or (<= |downsweep_#in~space| 3) (< 0 downsweep_~space))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-15 13:23:10,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15700#(or (<= |downsweep_#in~space| 3) (< 0 downsweep_~space))} is VALID [2022-04-15 13:23:10,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} assume !(~right~1 < ~n); {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-15 13:23:10,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-15 13:23:10,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {15714#(or (< 0 (div downsweep_~space 2)) (not (< 0 downsweep_~space)) (<= |downsweep_#in~space| 3))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-15 13:23:10,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15714#(or (< 0 (div downsweep_~space 2)) (not (< 0 downsweep_~space)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-15 13:23:10,160 INFO L272 TraceCheckUtils]: 57: Hoare triple {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15380#true} is VALID [2022-04-15 13:23:10,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {15721#(or (<= main_~n~0 0) (<= 0 (+ (div (+ (- 1) (div (+ |main_#t~ret19| (- 6)) 2)) 2) 1)))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} is VALID [2022-04-15 13:23:10,163 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} {15380#true} #152#return; {15721#(or (<= main_~n~0 0) (<= 0 (+ (div (+ (- 1) (div (+ |main_#t~ret19| (- 6)) 2)) 2) 1)))} is VALID [2022-04-15 13:23:10,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} assume true; {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} is VALID [2022-04-15 13:23:10,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {15735#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} #res := ~space~0; {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} is VALID [2022-04-15 13:23:10,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {15739#(or (<= |upsweep_#in~n| 0) (< upsweep_~space~0 upsweep_~n) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} assume !(~space~0 < ~n); {15735#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} is VALID [2022-04-15 13:23:10,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} ~space~0 := 2 * ~space~0; {15739#(or (<= |upsweep_#in~n| 0) (< upsweep_~space~0 upsweep_~n) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} is VALID [2022-04-15 13:23:10,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !(~left~0 < ~n); {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-15 13:23:10,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-15 13:23:10,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-15 13:23:10,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} ~space~0 := 2 * ~space~0; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-15 13:23:10,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !(~left~0 < ~n); {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:10,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:10,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:10,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:10,196 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-15 13:23:10,196 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-15 13:23:10,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-15 13:23:10,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-15 13:23:10,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-15 13:23:10,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-15 13:23:10,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15380#true} is VALID [2022-04-15 13:23:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 13:23:10,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345639681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:23:10,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:23:10,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2022-04-15 13:23:10,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:23:10,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371316097] [2022-04-15 13:23:10,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371316097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:23:10,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:23:10,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:23:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634825149] [2022-04-15 13:23:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:23:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-04-15 13:23:10,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:23:10,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:23:10,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:23:10,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:23:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:23:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:23:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:23:10,247 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:23:12,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:14,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:16,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:18,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:21,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:23,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:25,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:23:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:27,373 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-15 13:23:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:23:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-04-15 13:23:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:23:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:23:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 106 transitions. [2022-04-15 13:23:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:23:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 106 transitions. [2022-04-15 13:23:27,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 106 transitions. [2022-04-15 13:23:27,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:23:27,486 INFO L225 Difference]: With dead ends: 180 [2022-04-15 13:23:27,486 INFO L226 Difference]: Without dead ends: 158 [2022-04-15 13:23:27,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=2023, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:23:27,487 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 38 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:23:27,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 64 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 676 Invalid, 7 Unknown, 0 Unchecked, 15.2s Time] [2022-04-15 13:23:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-15 13:23:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2022-04-15 13:23:27,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:23:27,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-15 13:23:27,852 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-15 13:23:27,853 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-15 13:23:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:27,855 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-04-15 13:23:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2022-04-15 13:23:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:23:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:23:27,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Second operand 158 states. [2022-04-15 13:23:27,856 INFO L87 Difference]: Start difference. First operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Second operand 158 states. [2022-04-15 13:23:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:23:27,861 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-04-15 13:23:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2022-04-15 13:23:27,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:23:27,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:23:27,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:23:27,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:23:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-15 13:23:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2022-04-15 13:23:27,864 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 73 [2022-04-15 13:23:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:23:27,864 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2022-04-15 13:23:27,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 13:23:27,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 162 transitions. [2022-04-15 13:23:28,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:23:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-15 13:23:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 13:23:28,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:23:28,243 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2022-04-15 13:23:28,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 13:23:28,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 13:23:28,444 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:23:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:23:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1213658525, now seen corresponding path program 1 times [2022-04-15 13:23:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:23:28,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382727479] [2022-04-15 13:23:28,444 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:23:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1213658525, now seen corresponding path program 2 times [2022-04-15 13:23:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:23:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062824353] [2022-04-15 13:23:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:23:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:23:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:23:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-15 13:23:29,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:29,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-15 13:23:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:23:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:29,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:29,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:29,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-15 13:23:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:23:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-15 13:23:29,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-15 13:23:29,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-15 13:23:29,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-15 13:23:29,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:29,177 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-15 13:23:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-15 13:23:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:29,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:29,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:29,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-15 13:23:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 13:23:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:23:29,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:23:29,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:23:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 13:23:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:23:29,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:23:29,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-15 13:23:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 13:23:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:29,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:29,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-15 13:23:29,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:29,635 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-15 13:23:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:31,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} is VALID [2022-04-15 13:23:31,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} is VALID [2022-04-15 13:23:31,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,103 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 13:23:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:31,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:31,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:31,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:23:31,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {16862#true} call ULTIMATE.init(); {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {16862#true} call #t~ret20 := main(); {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {16862#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {16862#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:31,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L272 TraceCheckUtils]: 11: Hoare triple {16862#true} call #t~ret14 := is_pow2(~n~0); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {16862#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L272 TraceCheckUtils]: 19: Hoare triple {16862#true} call assume_abort_if_not(#t~ret14); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,138 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-15 13:23:31,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {16862#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-15 13:23:31,140 INFO L272 TraceCheckUtils]: 25: Hoare triple {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:31,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:23:31,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:23:31,141 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:23:31,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-15 13:23:31,142 INFO L272 TraceCheckUtils]: 30: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:31,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:23:31,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:23:31,143 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-15 13:23:31,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {16891#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a0~0.base) (+ main_~a0~0.offset (* main_~i~1 4))) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {16891#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a0~0.base) (+ main_~a0~0.offset (* main_~i~1 4))) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {16892#(and (<= 1 main_~i~1) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {16892#(and (<= 1 main_~i~1) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {16893#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {16893#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {16894#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {16894#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !(~i~1 < ~n~0); {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,147 INFO L272 TraceCheckUtils]: 40: Hoare triple {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:31,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:23:31,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-15 13:23:31,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:23:31,153 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,155 INFO L272 TraceCheckUtils]: 51: Hoare triple {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:23:31,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} is VALID [2022-04-15 13:23:31,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} is VALID [2022-04-15 13:23:31,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-15 13:23:31,175 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:23:31,175 INFO L272 TraceCheckUtils]: 60: Hoare triple {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {16916#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a0.base|) 0) 0) (= |check_#in~a0.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 4) 0))} is VALID [2022-04-15 13:23:31,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {16916#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a0.base|) 0) 0) (= |check_#in~a0.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 4) 0))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:23:31,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:23:31,177 INFO L272 TraceCheckUtils]: 63: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {16862#true} is VALID [2022-04-15 13:23:31,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:23:31,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:23:31,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:23:31,177 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16862#true} {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:23:31,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {16922#(and (= (select (select |#memory_int| check_~a.base) 4) check_~sum~0) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:23:31,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {16922#(and (= (select (select |#memory_int| check_~a.base) 4) check_~sum~0) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16923#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-15 13:23:31,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {16923#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~sum~0 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-15 13:23:31,179 INFO L272 TraceCheckUtils]: 71: Hoare triple {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {16925#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:23:31,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {16925#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16926#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:23:31,180 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16863#false} is VALID [2022-04-15 13:23:31,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {16863#false} assume !false; {16863#false} is VALID [2022-04-15 13:23:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:23:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:23:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062824353] [2022-04-15 13:23:31,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062824353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:23:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32332607] [2022-04-15 13:23:31,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:23:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:23:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:23:31,182 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:23:31,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:23:31,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:23:31,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:23:31,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-15 13:23:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:23:31,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:23:31,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-15 13:23:31,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-04-15 13:23:31,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-15 13:23:31,510 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 11 treesize of output 11 [2022-04-15 13:23:31,530 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_678 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_678))) is different from true [2022-04-15 13:23:31,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-04-15 13:23:31,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-15 13:23:31,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-04-15 13:23:31,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-04-15 13:23:31,686 INFO L356 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2022-04-15 13:23:31,686 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 1 case distinctions, treesize of input 28 treesize of output 32 [2022-04-15 13:23:41,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-04-15 13:23:44,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-04-15 13:25:02,878 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-04-15 13:25:02,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 325 treesize of output 337 [2022-04-15 13:25:03,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-04-15 13:25:03,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {16862#true} call ULTIMATE.init(); {16862#true} is VALID [2022-04-15 13:25:03,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-15 13:25:03,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:25:03,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {16862#true} call #t~ret20 := main(); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {16862#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {16862#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L272 TraceCheckUtils]: 11: Hoare triple {16862#true} call #t~ret14 := is_pow2(~n~0); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-15 13:25:03,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {16862#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L272 TraceCheckUtils]: 19: Hoare triple {16862#true} call assume_abort_if_not(#t~ret14); {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-15 13:25:03,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {16862#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-15 13:25:03,844 INFO L272 TraceCheckUtils]: 25: Hoare triple {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {17019#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1))} is VALID [2022-04-15 13:25:03,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {17019#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-15 13:25:03,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} assume true; {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-15 13:25:03,846 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:25:03,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-15 13:25:03,847 INFO L272 TraceCheckUtils]: 30: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:25:03,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} is VALID [2022-04-15 13:25:03,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} assume true; {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} is VALID [2022-04-15 13:25:03,849 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-15 13:25:03,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !(~i~1 < ~n~0); {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:03,853 INFO L272 TraceCheckUtils]: 40: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:25:03,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {17071#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:25:03,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {17071#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {17075#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-15 13:25:05,858 WARN L290 TraceCheckUtils]: 43: Hoare triple {17075#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is UNKNOWN [2022-04-15 13:25:07,875 WARN L290 TraceCheckUtils]: 44: Hoare triple {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} assume !(~left~0 < ~n); {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is UNKNOWN [2022-04-15 13:25:09,880 WARN L290 TraceCheckUtils]: 45: Hoare triple {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} ~space~0 := 2 * ~space~0; {17086#(and (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (<= |upsweep_#in~n| upsweep_~n))} is UNKNOWN [2022-04-15 13:25:11,338 WARN L290 TraceCheckUtils]: 46: Hoare triple {17086#(and (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {17090#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} is UNKNOWN [2022-04-15 13:25:11,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {17090#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} #res := ~space~0; {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} is VALID [2022-04-15 13:25:12,767 WARN L290 TraceCheckUtils]: 48: Hoare triple {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} assume true; {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} is UNKNOWN [2022-04-15 13:25:12,771 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {17101#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:12,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {17101#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:12,772 INFO L272 TraceCheckUtils]: 51: Hoare triple {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:25:12,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {17112#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} is VALID [2022-04-15 13:25:12,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {17112#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {17116#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} is VALID [2022-04-15 13:25:12,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {17116#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-15 13:25:12,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume !(~right~1 < ~n); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-15 13:25:12,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-15 13:25:12,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume !(~space > 0); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-15 13:25:12,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume true; {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-15 13:25:12,785 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {17136#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) main_~a~0.offset (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-15 13:25:12,788 INFO L272 TraceCheckUtils]: 60: Hoare triple {17136#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) main_~a~0.offset (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {17140#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= |check_#in~a0.offset| 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| |check_#in~a0.base|) 0)) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (= (select |#memory_int| |check_#in~a.base|) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= 0 v_upsweep_~left~0_60) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_67) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} is VALID [2022-04-15 13:25:12,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {17140#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= |check_#in~a0.offset| 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| |check_#in~a0.base|) 0)) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (= (select |#memory_int| |check_#in~a.base|) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= 0 v_upsweep_~left~0_60) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_67) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:25:12,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:25:14,806 WARN L272 TraceCheckUtils]: 63: Hoare triple {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-15 13:25:16,812 WARN L290 TraceCheckUtils]: 64: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} ~cond := #in~cond; {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-15 13:25:18,820 WARN L290 TraceCheckUtils]: 65: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} assume !(0 == ~cond); {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-15 13:25:18,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} assume true; {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is VALID [2022-04-15 13:25:18,946 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {17164#(and (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-15 13:25:20,958 WARN L290 TraceCheckUtils]: 68: Hoare triple {17164#(and (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {17168#(and (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (exists ((v_upsweep_~a.offset_41 Int) (v_main_~n~0_BEFORE_CALL_68 Int) (v_upsweep_~left~0_61 Int) (v_upsweep_~right~0_38 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4)) (select |#memory_int| check_~a.base)) (<= (+ v_upsweep_~left~0_61 1) v_upsweep_~right~0_38) (<= v_main_~n~0_BEFORE_CALL_68 2) (<= check_~n v_main_~n~0_BEFORE_CALL_68) (<= 0 v_upsweep_~a.offset_41) (<= 0 v_upsweep_~left~0_61))) (= check_~i~0 0) (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (* check_~i~0 4))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (= check_~a.offset 0))} is UNKNOWN [2022-04-15 13:25:22,963 WARN L290 TraceCheckUtils]: 69: Hoare triple {17168#(and (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (exists ((v_upsweep_~a.offset_41 Int) (v_main_~n~0_BEFORE_CALL_68 Int) (v_upsweep_~left~0_61 Int) (v_upsweep_~right~0_38 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4)) (select |#memory_int| check_~a.base)) (<= (+ v_upsweep_~left~0_61 1) v_upsweep_~right~0_38) (<= v_main_~n~0_BEFORE_CALL_68 2) (<= check_~n v_main_~n~0_BEFORE_CALL_68) (<= 0 v_upsweep_~a.offset_41) (<= 0 v_upsweep_~left~0_61))) (= check_~i~0 0) (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (* check_~i~0 4))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17172#(and (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (+ (* check_~i~0 4) (- 4)))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (exists ((v_upsweep_~a.offset_41 Int) (v_main_~n~0_BEFORE_CALL_68 Int) (v_upsweep_~left~0_61 Int) (v_upsweep_~right~0_38 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4)) (select |#memory_int| check_~a.base)) (<= (+ v_upsweep_~left~0_61 1) v_upsweep_~right~0_38) (<= v_main_~n~0_BEFORE_CALL_68 2) (<= check_~n v_main_~n~0_BEFORE_CALL_68) (<= 0 v_upsweep_~a.offset_41) (<= 0 v_upsweep_~left~0_61))) (= (+ (- 1) check_~i~0) 0) (= check_~a.offset 0))} is UNKNOWN [2022-04-15 13:25:22,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {17172#(and (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (+ (* check_~i~0 4) (- 4)))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0)))) (exists ((v_upsweep_~a.offset_41 Int) (v_main_~n~0_BEFORE_CALL_68 Int) (v_upsweep_~left~0_61 Int) (v_upsweep_~right~0_38 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4)) (+ (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right~0_38 4))) (select ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_41 (* v_upsweep_~left~0_61 4))))) (+ (* v_main_~n~0_BEFORE_CALL_68 4) (- 4)) 0) 4)) (select |#memory_int| check_~a.base)) (<= (+ v_upsweep_~left~0_61 1) v_upsweep_~right~0_38) (<= v_main_~n~0_BEFORE_CALL_68 2) (<= check_~n v_main_~n~0_BEFORE_CALL_68) (<= 0 v_upsweep_~a.offset_41) (<= 0 v_upsweep_~left~0_61))) (= (+ (- 1) check_~i~0) 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-15 13:25:22,965 INFO L272 TraceCheckUtils]: 71: Hoare triple {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {17179#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:25:22,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {17179#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17183#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:25:22,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {17183#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16863#false} is VALID [2022-04-15 13:25:22,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {16863#false} assume !false; {16863#false} is VALID [2022-04-15 13:25:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-04-15 13:25:22,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:25:55,181 WARN L804 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-04-15 13:27:26,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32332607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:27:26,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:27:26,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32] total 59 [2022-04-15 13:27:26,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:27:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382727479] [2022-04-15 13:27:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382727479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:27:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:27:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:27:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762304038] [2022-04-15 13:27:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:27:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 75 [2022-04-15 13:27:26,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:27:26,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-15 13:27:26,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:27:26,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:27:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:27:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:27:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=4606, Unknown=73, NotChecked=138, Total=5112 [2022-04-15 13:27:26,348 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-15 13:27:31,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:33,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:35,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:37,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:42,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:50,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:55,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:57,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:27:59,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:03,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:10,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:12,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:14,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:16,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 13:28:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:28:46,556 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-04-15 13:28:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 13:28:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 75 [2022-04-15 13:28:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:28:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-15 13:28:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-15 13:28:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-15 13:28:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-15 13:28:46,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 128 transitions. [2022-04-15 13:28:46,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:28:46,718 INFO L225 Difference]: With dead ends: 164 [2022-04-15 13:28:46,718 INFO L226 Difference]: Without dead ends: 162 [2022-04-15 13:28:46,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 229.3s TimeCoverageRelationStatistics Valid=690, Invalid=10151, Unknown=83, NotChecked=206, Total=11130 [2022-04-15 13:28:46,721 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 145 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:28:46,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 71 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2011 Invalid, 14 Unknown, 0 Unchecked, 32.9s Time] [2022-04-15 13:28:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-15 13:28:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2022-04-15 13:28:47,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:28:47,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-15 13:28:47,212 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-15 13:28:47,213 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-15 13:28:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:28:47,216 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2022-04-15 13:28:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2022-04-15 13:28:47,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:28:47,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:28:47,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) Second operand 162 states. [2022-04-15 13:28:47,217 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) Second operand 162 states. [2022-04-15 13:28:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:28:47,220 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2022-04-15 13:28:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2022-04-15 13:28:47,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:28:47,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:28:47,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:28:47,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:28:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-15 13:28:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2022-04-15 13:28:47,223 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 75 [2022-04-15 13:28:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:28:47,223 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2022-04-15 13:28:47,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-15 13:28:47,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 175 transitions. [2022-04-15 13:28:47,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:28:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2022-04-15 13:28:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 13:28:47,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:28:47,639 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-15 13:28:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 13:28:47,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:28:47,840 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:28:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:28:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1496849804, now seen corresponding path program 13 times [2022-04-15 13:28:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:28:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730001674] [2022-04-15 13:28:47,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:28:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1496849804, now seen corresponding path program 14 times [2022-04-15 13:28:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:28:47,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814433789] [2022-04-15 13:28:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:28:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:28:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:28:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {18354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18289#true} is VALID [2022-04-15 13:28:49,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {18289#true} assume true; {18289#true} is VALID [2022-04-15 13:28:49,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18289#true} {18289#true} #160#return; {18289#true} is VALID [2022-04-15 13:28:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:28:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {18289#true} ~cond := #in~cond; {18289#true} is VALID [2022-04-15 13:28:49,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {18289#true} assume !(0 == ~cond); {18289#true} is VALID [2022-04-15 13:28:49,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {18289#true} assume true; {18289#true} is VALID [2022-04-15 13:28:49,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18289#true} {18289#true} #142#return; {18289#true} is VALID [2022-04-15 13:28:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:28:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {18289#true} ~x := #in~x; {18289#true} is VALID [2022-04-15 13:28:49,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {18289#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {18289#true} is VALID [2022-04-15 13:28:49,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {18289#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {18289#true} is VALID [2022-04-15 13:28:49,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {18289#true} assume true; {18289#true} is VALID [2022-04-15 13:28:49,375 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18289#true} {18289#true} #144#return; {18289#true} is VALID [2022-04-15 13:28:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 13:28:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {18289#true} ~cond := #in~cond; {18289#true} is VALID [2022-04-15 13:28:49,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {18289#true} assume !(0 == ~cond); {18289#true} is VALID [2022-04-15 13:28:49,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {18289#true} assume true; {18289#true} is VALID [2022-04-15 13:28:49,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18289#true} {18289#true} #146#return; {18289#true} is VALID [2022-04-15 13:28:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 13:28:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {18355#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18356#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:28:49,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {18356#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {18356#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 13:28:49,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18356#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {18307#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {18311#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-15 13:28:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:28:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:49,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {18355#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18357#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:28:49,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {18357#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {18357#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-15 13:28:49,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18357#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {18312#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {18312#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-15 13:28:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 13:28:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:28:51,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {18355#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {18358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-15 13:28:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {18358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {18359#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ upsweep_~left~0 upsweep_~space~0) 1) (<= 3 (+ upsweep_~left~0 (* 3 upsweep_~space~0)))) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-15 13:28:51,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {18359#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ upsweep_~left~0 upsweep_~space~0) 1) (<= 3 (+ upsweep_~left~0 (* 3 upsweep_~space~0)))) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18360#(or (and (or (and (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (<= (+ upsweep_~left~0 1) (* 3 upsweep_~space~0)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (<= (+ upsweep_~space~0 1) upsweep_~left~0) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-15 13:28:51,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {18360#(or (and (or (and (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (<= (+ upsweep_~left~0 1) (* 3 upsweep_~space~0)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (<= (+ upsweep_~space~0 1) upsweep_~left~0) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18361#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-15 13:28:51,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {18361#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !(~left~0 < ~n); {18361#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-15 13:28:51,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {18361#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} ~space~0 := 2 * ~space~0; {18362#(or (and (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4))) (= |upsweep_#in~a.base| upsweep_~a.base) (= 8 (+ upsweep_~a.offset (* upsweep_~space~0 4)))) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-15 13:28:51,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {18362#(or (and (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4))) (= |upsweep_#in~a.base| upsweep_~a.base) (= 8 (+ upsweep_~a.offset (* upsweep_~space~0 4)))) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {18363#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (<= (+ upsweep_~a.offset 1) 0) (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (+ (* upsweep_~left~0 4) upsweep_~a.offset (* upsweep_~space~0 4)))) (= (+ (* upsweep_~left~0 4) upsweep_~a.offset) 4) (= |upsweep_#in~a.base| upsweep_~a.base) (<= 2 upsweep_~space~0)) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-15 13:28:51,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {18363#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (<= (+ upsweep_~a.offset 1) 0) (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (+ (* upsweep_~left~0 4) upsweep_~a.offset (* upsweep_~space~0 4)))) (= (+ (* upsweep_~left~0 4) upsweep_~a.offset) 4) (= |upsweep_#in~a.base| upsweep_~a.base) (<= 2 upsweep_~space~0)) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-15 13:28:51,161 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18364#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {18321#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 3 main_~n~0) (not (= main_~a~0.base main_~a0~0.base)) (<= main_~n~0 3))} #152#return; {18336#(and (= main_~a~0.offset 0) (<= (* main_~n~0 4) 12) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (<= 3 main_~n~0) (or (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= main_~a~0.base main_~a0~0.base)) (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (<= 4 (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-15 13:28:51,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-15 13:28:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat