/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:11:37,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:11:37,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:11:37,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:11:37,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:11:37,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:11:37,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:11:37,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:11:37,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:11:37,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:11:37,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:11:37,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:11:37,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:11:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:11:37,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:11:37,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:11:37,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:11:37,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:11:37,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:11:38,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:11:38,001 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:11:38,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:11:38,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:11:38,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:11:38,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:11:38,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:11:38,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:11:38,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:11:38,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:11:38,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:11:38,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:11:38,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:11:38,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:11:38,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:11:38,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:11:38,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:11:38,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:11:38,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:11:38,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:11:38,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:11:38,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:11:38,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:11:38,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:11:38,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:11:38,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:11:38,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:11:38,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:11:38,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:11:38,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:11:38,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:11:38,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:11:38,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:11:38,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:11:38,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:11:38,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:11:38,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:11:38,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:38,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:11:38,035 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:11:38,036 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 07:11:38,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:11:38,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:11:38,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:11:38,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:11:38,245 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:11:38,246 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 07:11:38,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e98a82d/0b09b48140d54ba2a240010951f7930f/FLAGbd3ccb9a9 [2022-04-15 07:11:38,622 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:11:38,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-15 07:11:38,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e98a82d/0b09b48140d54ba2a240010951f7930f/FLAGbd3ccb9a9 [2022-04-15 07:11:39,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e98a82d/0b09b48140d54ba2a240010951f7930f [2022-04-15 07:11:39,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:11:39,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:11:39,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:39,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:11:39,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:11:39,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7420daed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39, skipping insertion in model container [2022-04-15 07:11:39,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:11:39,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:11:39,220 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 07:11:39,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:39,278 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:11:39,290 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 07:11:39,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:39,328 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:11:39,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39 WrapperNode [2022-04-15 07:11:39,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:39,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:11:39,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:11:39,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:11:39,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:11:39,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:11:39,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:11:39,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:11:39,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (1/1) ... [2022-04-15 07:11:39,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:11:39,405 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 07:11:39,411 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 07:11:39,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:11:39,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:11:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 07:11:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 07:11:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-15 07:11:39,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 07:11:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:11:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:11:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:11:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:11:39,515 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:11:39,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:11:41,934 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:11:41,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:11:41,939 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-15 07:11:41,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:41 BoogieIcfgContainer [2022-04-15 07:11:41,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:11:41,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:11:41,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:11:41,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:11:41,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:11:39" (1/3) ... [2022-04-15 07:11:41,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b5c6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:41, skipping insertion in model container [2022-04-15 07:11:41,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:39" (2/3) ... [2022-04-15 07:11:41,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b5c6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:41, skipping insertion in model container [2022-04-15 07:11:41,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:41" (3/3) ... [2022-04-15 07:11:41,946 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-04-15 07:11:41,949 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:11:41,949 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:11:41,975 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:11:41,980 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 07:11:41,980 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:11:41,992 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 07:11:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 07:11:41,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:41,997 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 07:11:41,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 1 times [2022-04-15 07:11:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:42,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1346096350] [2022-04-15 07:11:42,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:11:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 2 times [2022-04-15 07:11:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226580716] [2022-04-15 07:11:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,181 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 07:11:42,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-15 07:11:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:11:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 07:11:42,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 07:11:42,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 07:11:42,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-15 07:11:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:11:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-15 07:11:42,217 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 07:11:42,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-15 07:11:42,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,218 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-15 07:11:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:11:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 07:11:42,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 07:11:42,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 07:11:42,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-15 07:11:42,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:11:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,240 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 07:11:42,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-15 07:11:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:11:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,248 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 07:11:42,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-15 07:11:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 07:11:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,257 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 07:11:42,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-15 07:11:42,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-15 07:11:42,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,258 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-15 07:11:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 07:11:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,272 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 07:11:42,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-15 07:11:42,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-15 07:11:42,274 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 07:11:42,274 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 07:11:42,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-15 07:11:42,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret20 := main(); {67#true} is VALID [2022-04-15 07:11:42,275 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 07:11:42,275 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 07:11:42,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 07:11:42,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 07:11:42,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 07:11:42,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-15 07:11:42,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {68#false} call #t~ret14 := is_pow2(~n~0); {67#true} is VALID [2022-04-15 07:11:42,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-15 07:11:42,277 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 07:11:42,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-15 07:11:42,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,278 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-15 07:11:42,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {68#false} is VALID [2022-04-15 07:11:42,278 INFO L272 TraceCheckUtils]: 18: Hoare triple {68#false} call assume_abort_if_not(#t~ret14); {67#true} is VALID [2022-04-15 07:11:42,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-15 07:11:42,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-15 07:11:42,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-15 07:11:42,279 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-15 07:11:42,279 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 07:11:42,280 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 07:11:42,280 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 07:11:42,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,280 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-15 07:11:42,281 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 07:11:42,281 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 07:11:42,281 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 07:11:42,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,282 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-15 07:11:42,282 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 07:11:42,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} assume !(~i~1 < ~n~0); {68#false} is VALID [2022-04-15 07:11:42,282 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 07:11:42,282 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 07:11:42,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-15 07:11:42,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-15 07:11:42,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,283 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-15 07:11:42,283 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 07:11:42,284 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 07:11:42,284 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 07:11:42,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-15 07:11:42,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 07:11:42,284 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-15 07:11:42,285 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 07:11:42,285 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 07:11:42,285 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 07:11:42,285 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 07:11:42,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-15 07:11:42,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-15 07:11:42,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-15 07:11:42,287 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 07:11:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:42,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226580716] [2022-04-15 07:11:42,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226580716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:42,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:42,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:42,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1346096350] [2022-04-15 07:11:42,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1346096350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:42,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360819373] [2022-04-15 07:11:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:42,297 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 07:11:42,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:42,301 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 07:11:42,349 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 07:11:42,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:11:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:42,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:11:42,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:11:42,390 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 07:11:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:44,961 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2022-04-15 07:11:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:11:44,962 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 07:11:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:44,963 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 07:11:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-15 07:11:44,973 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 07:11:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-15 07:11:44,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 171 transitions. [2022-04-15 07:11:45,151 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 07:11:45,159 INFO L225 Difference]: With dead ends: 127 [2022-04-15 07:11:45,159 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 07:11:45,162 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 07:11:45,164 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 07:11:45,165 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 07:11:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 07:11:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-04-15 07:11:45,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:45,192 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 07:11:45,193 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 07:11:45,193 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 07:11:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:45,198 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 07:11:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 07:11:45,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:45,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:45,199 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 07:11:45,200 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 07:11:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:45,204 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 07:11:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 07:11:45,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:45,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:45,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:45,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:45,205 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 07:11:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-15 07:11:45,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2022-04-15 07:11:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:45,209 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-15 07:11:45,210 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 07:11:45,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 65 transitions. [2022-04-15 07:11:45,278 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 07:11:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-15 07:11:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 07:11:45,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:45,280 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 07:11:45,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:11:45,280 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:45,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 1 times [2022-04-15 07:11:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:45,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696821828] [2022-04-15 07:11:45,282 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:11:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 2 times [2022-04-15 07:11:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:45,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821229593] [2022-04-15 07:11:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,429 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 07:11:45,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-15 07:11:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:11:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 07:11:45,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 07:11:45,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-15 07:11:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:11:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-15 07:11:45,440 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 07:11:45,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-15 07:11:45,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,441 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-15 07:11:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 07:11:45,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 07:11:45,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-15 07:11:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:11:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,458 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 07:11:45,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-15 07:11:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:11:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,463 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 07:11:45,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-15 07:11:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 07:11:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,470 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 07:11:45,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-15 07:11:45,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-15 07:11:45,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,472 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 07:11:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 07:11:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:45,482 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 07:11:45,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-15 07:11:45,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,483 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 07:11:45,484 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 07:11:45,484 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 07:11:45,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-15 07:11:45,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret20 := main(); {601#true} is VALID [2022-04-15 07:11:45,485 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 07:11:45,485 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 07:11:45,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 07:11:45,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 07:11:45,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-15 07:11:45,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {601#true} call #t~ret14 := is_pow2(~n~0); {601#true} is VALID [2022-04-15 07:11:45,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-15 07:11:45,486 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 07:11:45,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-15 07:11:45,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,486 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-15 07:11:45,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {601#true} is VALID [2022-04-15 07:11:45,487 INFO L272 TraceCheckUtils]: 18: Hoare triple {601#true} call assume_abort_if_not(#t~ret14); {601#true} is VALID [2022-04-15 07:11:45,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-15 07:11:45,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-15 07:11:45,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,487 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-15 07:11:45,487 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 07:11:45,489 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 07:11:45,489 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 07:11:45,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,489 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-15 07:11:45,489 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 07:11:45,490 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 07:11:45,490 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 07:11:45,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,491 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-15 07:11:45,491 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 07:11:45,492 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 07:11:45,492 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 07:11:45,493 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 07:11:45,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-15 07:11:45,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-15 07:11:45,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,494 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 07:11:45,494 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 07:11:45,495 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 07:11:45,495 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 07:11:45,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-15 07:11:45,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-15 07:11:45,497 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 07:11:45,498 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 07:11:45,498 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 07:11:45,499 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 07:11:45,499 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 07:11:45,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2022-04-15 07:11:45,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2022-04-15 07:11:45,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {602#false} assume !false; {602#false} is VALID [2022-04-15 07:11:45,500 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 07:11:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:45,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821229593] [2022-04-15 07:11:45,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821229593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:45,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:45,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:45,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696821828] [2022-04-15 07:11:45,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696821828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:45,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:45,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463686149] [2022-04-15 07:11:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:45,502 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 07:11:45,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:45,503 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 07:11:45,542 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 07:11:45,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:11:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:11:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:11:45,544 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 07:11:47,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 07:11:49,840 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 07:11:54,128 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 07:11:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:55,154 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 07:11:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:11:55,154 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 07:11:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:55,155 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 07:11:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 07:11:55,157 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 07:11:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 07:11:55,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 07:11:55,285 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 07:11:55,287 INFO L225 Difference]: With dead ends: 81 [2022-04-15 07:11:55,288 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 07:11:55,288 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 07:11:55,289 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:55,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 304 Invalid, 3 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 07:11:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 07:11:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-15 07:11:55,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:55,295 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 07:11:55,296 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 07:11:55,296 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 07:11:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:55,298 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-15 07:11:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-15 07:11:55,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:55,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:55,307 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 07:11:55,307 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 07:11:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:55,310 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-15 07:11:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-15 07:11:55,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:55,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:55,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:55,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:55,310 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 07:11:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-15 07:11:55,312 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2022-04-15 07:11:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:55,312 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-15 07:11:55,313 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 07:11:55,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 66 transitions. [2022-04-15 07:11:55,394 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 07:11:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-15 07:11:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 07:11:55,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:55,398 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 07:11:55,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:11:55,398 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 1 times [2022-04-15 07:11:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:55,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862562233] [2022-04-15 07:11:55,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:11:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 2 times [2022-04-15 07:11:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:55,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799587727] [2022-04-15 07:11:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,692 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 07:11:55,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 07:11:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:11:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:55,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:55,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 07:11:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:11:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 07:11:55,713 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 07:11:55,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 07:11:55,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,713 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 07:11:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:11:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:55,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:55,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 07:11:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:11:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,744 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 07:11:55,744 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 07:11:55,747 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 07:11:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:11:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,767 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 07:11:55,768 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 07:11:55,769 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 07:11:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:11:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,775 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 07:11:55,776 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 07:11:55,776 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 07:11:55,776 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 07:11:55,777 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 07:11:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 07:11:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,818 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 07:11:55,818 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 07:11:55,819 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 07:11:55,820 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 07:11:55,820 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 07:11:55,820 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 07:11:55,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-15 07:11:55,821 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 07:11:55,821 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 07:11:55,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-15 07:11:55,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 07:11:55,822 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 07:11:55,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:55,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:55,823 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 07:11:55,823 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 07:11:55,824 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 07:11:55,824 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 07:11:55,825 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 07:11:55,825 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 07:11:55,826 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 07:11:55,827 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 07:11:55,827 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 07:11:55,828 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 07:11:55,829 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 07:11:55,829 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 07:11:55,833 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 07:11:55,834 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 07:11:55,834 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 07:11:55,835 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 07:11:55,835 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 07:11:55,836 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 07:11:55,836 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 07:11:55,836 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 07:11:55,837 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 07:11:55,838 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 07:11:55,838 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 07:11:55,839 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 07:11:55,839 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 07:11:55,840 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 07:11:55,841 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 07:11:55,842 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 07:11:55,842 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 07:11:55,843 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 07:11:55,843 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 07:11:55,844 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 07:11:55,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {1102#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 07:11:55,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 07:11:55,844 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 07:11:55,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:55,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799587727] [2022-04-15 07:11:55,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799587727] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:11:55,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99237073] [2022-04-15 07:11:55,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:11:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:11:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:11:55,859 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 07:11:55,860 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 07:11:55,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:11:55,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:11:55,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 07:11:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:55,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:11:56,233 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 07:11:56,724 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-04-15 07:11:56,725 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 07:11:56,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-15 07:11:56,840 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 07:11:56,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-15 07:11:56,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-15 07:11:56,840 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 07:11:56,841 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 07:11:56,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-15 07:11:56,841 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 07:11:56,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-15 07:11:56,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,842 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-15 07:11:56,842 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 07:11:56,843 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 07:11:56,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-15 07:11:56,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1061#true} {1061#true} #148#return; {1061#true} is VALID [2022-04-15 07:11:56,843 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 07:11:56,843 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 07:11:56,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-15 07:11:56,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-15 07:11:56,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1061#true} {1061#true} #150#return; {1061#true} is VALID [2022-04-15 07:11:56,843 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 07:11:56,844 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 07:11:56,844 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 07:11:56,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#true} assume !(~i~1 < ~n~0); {1061#true} is VALID [2022-04-15 07:11:56,844 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 07:11:56,844 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 07:11:56,845 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 07:11:56,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {1229#(<= |upsweep_#in~n| 1)} #res := ~space~0; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:11:56,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {1229#(<= |upsweep_#in~n| 1)} assume true; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:11:56,846 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 07:11:56,847 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 07:11:56,847 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 07:11:56,848 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 07:11:56,848 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 07:11:56,849 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 07:11:56,849 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 07:11:56,852 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 07:11:56,855 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 07:11:56,856 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 07:11:56,857 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 07:11:56,857 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 07:11:56,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {1279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1062#false} is VALID [2022-04-15 07:11:56,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-15 07:11:56,858 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 07:11:56,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:11:56,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99237073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:56,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:11:56,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2022-04-15 07:11:56,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:56,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862562233] [2022-04-15 07:11:56,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862562233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:56,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:56,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:11:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523293895] [2022-04-15 07:11:56,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:56,860 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 07:11:56,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:56,860 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 07:11:56,899 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 07:11:56,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:11:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:11:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:11:56,900 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 07:12:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:21,168 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 07:12:21,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:12:21,168 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 07:12:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:21,169 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 07:12:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-15 07:12:21,171 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 07:12:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-15 07:12:21,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2022-04-15 07:12:21,274 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 07:12:21,275 INFO L225 Difference]: With dead ends: 83 [2022-04-15 07:12:21,276 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:12:21,276 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 07:12:21,277 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:21,277 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.2s Time] [2022-04-15 07:12:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:12:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-04-15 07:12:21,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:21,299 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 07:12:21,299 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 07:12:21,299 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 07:12:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:21,302 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 07:12:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 07:12:21,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:21,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:21,303 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 07:12:21,303 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 07:12:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:21,305 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 07:12:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 07:12:21,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:21,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:21,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:21,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:21,306 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 07:12:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-04-15 07:12:21,309 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 56 [2022-04-15 07:12:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:21,309 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-04-15 07:12:21,309 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 07:12:21,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 90 transitions. [2022-04-15 07:12:21,395 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 07:12:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 07:12:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:12:21,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:21,396 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 07:12:21,413 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 07:12:21,611 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 07:12:21,611 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 1 times [2022-04-15 07:12:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:21,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789359301] [2022-04-15 07:12:21,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 2 times [2022-04-15 07:12:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:21,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636901291] [2022-04-15 07:12:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,697 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 07:12:21,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 07:12:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:21,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:21,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 07:12:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 07:12:21,707 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 07:12:21,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 07:12:21,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,707 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 07:12:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:12:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:21,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:21,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 07:12:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:12:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,718 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 07:12:21,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 07:12:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,721 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 07:12:21,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 07:12:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:12:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,739 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 07:12:21,740 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 07:12:21,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-15 07:12:21,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-15 07:12:21,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-15 07:12:21,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-15 07:12:21,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-15 07:12:21,742 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-15 07:12:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 07:12:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,753 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 07:12:21,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-15 07:12:21,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-15 07:12:21,754 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 07:12:21,754 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 07:12:21,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-15 07:12:21,755 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 07:12:21,755 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 07:12:21,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-15 07:12:21,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 07:12:21,755 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 07:12:21,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,756 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 07:12:21,756 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 07:12:21,757 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 07:12:21,757 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 07:12:21,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,758 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 07:12:21,758 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 07:12:21,759 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 07:12:21,761 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 07:12:21,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,767 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 07:12:21,768 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 07:12:21,769 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 07:12:21,772 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 07:12:21,775 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 07:12:21,775 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 07:12:21,776 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 07:12:21,776 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 07:12:21,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-15 07:12:21,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-15 07:12:21,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-15 07:12:21,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-15 07:12:21,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-15 07:12:21,777 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-15 07:12:21,777 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 07:12:21,777 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 07:12:21,778 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 07:12:21,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-15 07:12:21,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:21,778 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-15 07:12:21,778 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 07:12:21,778 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 07:12:21,778 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 07:12:21,778 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 07:12:21,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {1772#false} ~cond := #in~cond; {1772#false} is VALID [2022-04-15 07:12:21,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {1772#false} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 07:12:21,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 07:12:21,779 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 07:12:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636901291] [2022-04-15 07:12:21,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636901291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086432844] [2022-04-15 07:12:21,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:21,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:21,783 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 07:12:21,784 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 07:12:21,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:12:21,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:21,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 07:12:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:21,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:22,130 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 07:12:23,260 INFO L356 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-04-15 07:12:23,263 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 07:12:23,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-15 07:12:23,399 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 07:12:23,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-15 07:12:23,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-15 07:12:23,399 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 07:12:23,399 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 07:12:23,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:23,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:23,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-15 07:12:23,400 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 07:12:23,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-15 07:12:23,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-15 07:12:23,401 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 07:12:23,401 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 07:12:23,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 07:12:23,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,401 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-15 07:12:23,401 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 07:12:23,401 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 07:12:23,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-15 07:12:23,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 07:12:23,401 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-15 07:12:23,401 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 07:12:23,402 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 07:12:23,402 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 07:12:23,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {1771#true} assume !(~i~1 < ~n~0); {1771#true} is VALID [2022-04-15 07:12:23,402 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 07:12:23,402 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 07:12:23,403 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 07:12:23,403 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 07:12:23,403 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 07:12:23,404 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 07:12:23,404 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 07:12:23,405 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 07:12:23,405 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 07:12:23,406 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 07:12:23,406 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 07:12:23,407 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 07:12:23,408 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 07:12:23,408 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 07:12:23,409 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 07:12:23,416 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 07:12:23,417 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 07:12:23,418 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 07:12:23,419 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 07:12:23,419 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 07:12:23,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {1996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 07:12:23,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 07:12:23,420 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 07:12:23,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:12:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086432844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:23,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:12:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2022-04-15 07:12:23,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:23,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789359301] [2022-04-15 07:12:23,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789359301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:23,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:23,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:12:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759659620] [2022-04-15 07:12:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:23,422 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 07:12:23,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:23,422 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 07:12:23,483 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 07:12:23,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:12:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:12:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:12:23,485 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 07:12:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,435 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-15 07:12:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:12:37,436 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 07:12:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:37,436 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 07:12:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 07:12:37,438 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 07:12:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 07:12:37,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-15 07:12:37,510 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 07:12:37,512 INFO L225 Difference]: With dead ends: 101 [2022-04-15 07:12:37,512 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 07:12:37,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:12:37,513 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:37,513 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.3s Time] [2022-04-15 07:12:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 07:12:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-04-15 07:12:37,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:37,553 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 07:12:37,554 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 07:12:37,554 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 07:12:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,556 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 07:12:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 07:12:37,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:37,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:37,557 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 07:12:37,557 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 07:12:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,560 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 07:12:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 07:12:37,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:37,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:37,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:37,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:37,561 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 07:12:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-04-15 07:12:37,563 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 59 [2022-04-15 07:12:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:37,563 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-04-15 07:12:37,563 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 07:12:37,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 95 transitions. [2022-04-15 07:12:37,687 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 07:12:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-15 07:12:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 07:12:37,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:37,688 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 07:12:37,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 07:12:37,888 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 07:12:37,889 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 1 times [2022-04-15 07:12:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:37,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734137172] [2022-04-15 07:12:37,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 2 times [2022-04-15 07:12:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283662959] [2022-04-15 07:12:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,973 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 07:12:37,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 07:12:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:37,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:37,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 07:12:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 07:12:37,983 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 07:12:37,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 07:12:37,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,983 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 07:12:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:12:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:37,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:37,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 07:12:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:12:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,994 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 07:12:37,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 07:12:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:37,999 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 07:12:37,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:37,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 07:12:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:12:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,005 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 07:12:38,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-15 07:12:38,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-15 07:12:38,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,006 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 07:12:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 07:12:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,073 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 07:12:38,074 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 07:12:38,074 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 07:12:38,075 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 07:12:38,075 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 07:12:38,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,077 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 07:12:38,078 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 07:12:38,078 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 07:12:38,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 07:12:38,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 07:12:38,078 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 07:12:38,078 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 07:12:38,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 07:12:38,079 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 07:12:38,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 07:12:38,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:38,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:38,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,080 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 07:12:38,080 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 07:12:38,081 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 07:12:38,081 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 07:12:38,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,081 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 07:12:38,081 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 07:12:38,082 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 07:12:38,082 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 07:12:38,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,082 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 07:12:38,082 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 07:12:38,083 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 07:12:38,083 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 07:12:38,083 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 07:12:38,084 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 07:12:38,084 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 07:12:38,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-15 07:12:38,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-15 07:12:38,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,085 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 07:12:38,085 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 07:12:38,086 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 07:12:38,087 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 07:12:38,087 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 07:12:38,088 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 07:12:38,088 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 07:12:38,089 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 07:12:38,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,090 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 07:12:38,090 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 07:12:38,090 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 07:12:38,090 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 07:12:38,090 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 07:12:38,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 07:12:38,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 07:12:38,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 07:12:38,091 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 07:12:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:38,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283662959] [2022-04-15 07:12:38,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283662959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:38,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857000525] [2022-04-15 07:12:38,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:38,096 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 07:12:38,097 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 07:12:38,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:38,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:38,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:12:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:38,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-15 07:12:38,580 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 07:12:38,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 07:12:38,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 07:12:38,580 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 07:12:38,580 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 07:12:38,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 07:12:38,581 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 07:12:38,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 07:12:38,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,582 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 07:12:38,582 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 07:12:38,582 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 07:12:38,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 07:12:38,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,583 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 07:12:38,583 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 07:12:38,583 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 07:12:38,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 07:12:38,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:38,583 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 07:12:38,583 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 07:12:38,583 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 07:12:38,583 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 07:12:38,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-15 07:12:38,584 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 07:12:38,585 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 07:12:38,585 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 07:12:38,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:38,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:38,586 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 07:12:38,586 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 07:12:38,586 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 07:12:38,587 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 07:12:38,587 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 07:12:38,588 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 07:12:38,588 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 07:12:38,588 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 07:12:38,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:38,589 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 07:12:38,589 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 07:12:38,590 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 07:12:38,590 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 07:12:38,590 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 07:12:38,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 07:12:38,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 07:12:38,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 07:12:38,590 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 07:12:38,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:39,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-15 07:12:39,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-15 07:12:39,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-15 07:12:39,267 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 07:12:39,267 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 07:12:39,267 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 07:12:39,267 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 07:12:39,268 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 07:12:39,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:39,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-15 07:12:39,268 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 07:12:39,269 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 07:12:39,269 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 07:12:39,270 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 07:12:39,270 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 07:12:39,270 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 07:12:39,271 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 07:12:39,271 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 07:12:39,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:39,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:39,272 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 07:12:39,272 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 07:12:39,272 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 07:12:39,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-15 07:12:39,272 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 07:12:39,273 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 07:12:39,273 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 07:12:39,273 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-15 07:12:39,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 07:12:39,273 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 07:12:39,273 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 07:12:39,273 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-15 07:12:39,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-15 07:12:39,273 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 07:12:39,273 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 07:12:39,273 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-15 07:12:39,274 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 07:12:39,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-15 07:12:39,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-15 07:12:39,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-15 07:12:39,275 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 07:12:39,275 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 07:12:39,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-15 07:12:39,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-15 07:12:39,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-15 07:12:39,275 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 07:12:39,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-15 07:12:39,275 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 07:12:39,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857000525] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:39,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:12:39,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 18 [2022-04-15 07:12:39,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:39,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734137172] [2022-04-15 07:12:39,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734137172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:39,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:39,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:12:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692894371] [2022-04-15 07:12:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:39,278 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 07:12:39,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:39,278 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 07:12:39,303 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 07:12:39,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:12:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:12:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:12:39,304 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 07:12:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:52,642 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-04-15 07:12:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:12:52,642 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 07:12:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:52,642 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 07:12:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-15 07:12:52,644 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 07:12:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-15 07:12:52,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 99 transitions. [2022-04-15 07:12:52,732 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 07:12:52,747 INFO L225 Difference]: With dead ends: 93 [2022-04-15 07:12:52,747 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:12:52,747 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 07:12:52,749 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 07:12:52,749 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 07:12:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:12:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 07:12:52,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:52,829 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 07:12:52,829 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 07:12:52,829 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 07:12:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:52,831 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 07:12:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 07:12:52,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:52,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:52,832 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 07:12:52,832 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 07:12:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:52,834 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-15 07:12:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 07:12:52,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:52,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:52,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:52,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:52,834 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 07:12:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-04-15 07:12:52,836 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 60 [2022-04-15 07:12:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:52,836 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-04-15 07:12:52,836 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 07:12:52,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 94 transitions. [2022-04-15 07:12:52,956 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 07:12:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-04-15 07:12:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 07:12:52,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:52,958 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 07:12:52,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 07:12:53,175 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 07:12:53,176 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 1 times [2022-04-15 07:12:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:53,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584085713] [2022-04-15 07:12:53,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 2 times [2022-04-15 07:12:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:53,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068075500] [2022-04-15 07:12:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,258 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 07:12:53,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 07:12:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 07:12:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 07:12:53,266 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 07:12:53,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 07:12:53,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,266 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 07:12:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:12:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 07:12:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:12:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,275 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 07:12:53,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 07:12:53,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,280 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 07:12:53,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 07:12:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:12:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,302 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 07:12:53,302 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 07:12:53,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-15 07:12:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 07:12:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,310 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 07:12:53,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 07:12:53,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 07:12:53,310 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 07:12:53,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 07:12:53,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,310 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 07:12:53,311 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 07:12:53,311 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 07:12:53,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 07:12:53,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 07:12:53,311 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 07:12:53,311 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 07:12:53,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 07:12:53,312 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 07:12:53,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,313 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 07:12:53,313 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 07:12:53,313 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 07:12:53,313 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 07:12:53,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 07:12:53,314 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 07:12:53,314 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 07:12:53,314 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 07:12:53,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 07:12:53,315 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 07:12:53,315 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 07:12:53,316 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 07:12:53,316 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 07:12:53,317 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 07:12:53,317 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 07:12:53,317 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 07:12:53,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-15 07:12:53,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-15 07:12:53,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-15 07:12:53,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-15 07:12:53,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 07:12:53,318 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-15 07:12:53,318 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 07:12:53,318 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 07:12:53,318 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 07:12:53,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 07:12:53,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 07:12:53,319 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 07:12:53,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 07:12:53,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,319 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 07:12:53,319 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 07:12:53,319 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 07:12:53,319 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 07:12:53,319 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 07:12:53,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 07:12:53,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 07:12:53,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 07:12:53,320 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 07:12:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068075500] [2022-04-15 07:12:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068075500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456179709] [2022-04-15 07:12:53,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:53,321 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 07:12:53,336 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 07:12:53,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:53,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:53,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:12:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:53,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-15 07:12:53,639 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 07:12:53,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 07:12:53,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 07:12:53,639 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 07:12:53,639 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 07:12:53,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 07:12:53,640 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 07:12:53,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,641 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 07:12:53,641 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 07:12:53,641 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 07:12:53,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 07:12:53,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,641 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 07:12:53,641 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 07:12:53,641 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 07:12:53,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 07:12:53,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,641 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 07:12:53,642 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 07:12:53,642 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 07:12:53,642 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 07:12:53,643 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 07:12:53,643 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 07:12:53,643 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 07:12:53,644 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 07:12:53,644 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 07:12:53,645 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 07:12:53,645 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 07:12:53,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 07:12:53,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 07:12:53,646 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 07:12:53,646 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 07:12:53,646 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 07:12:53,647 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 07:12:53,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {3495#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3495#false} is VALID [2022-04-15 07:12:53,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {3495#false} assume !(~right~1 < ~n); {3495#false} is VALID [2022-04-15 07:12:53,647 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 07:12:53,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {3495#false} assume !(~space > 0); {3495#false} is VALID [2022-04-15 07:12:53,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-15 07:12:53,647 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3495#false} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 07:12:53,647 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 07:12:53,647 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 07:12:53,647 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 07:12:53,647 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 07:12:53,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 07:12:53,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 07:12:53,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 07:12:53,648 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 07:12:53,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:53,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-15 07:12:53,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-15 07:12:53,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-15 07:12:53,941 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 07:12:53,941 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 07:12:53,941 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 07:12:53,941 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 07:12:53,941 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-15 07:12:53,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-15 07:12:53,942 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 07:12:53,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-15 07:12:53,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-15 07:12:53,942 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 07:12:53,942 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 07:12:53,942 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 07:12:53,943 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 07:12:53,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 07:12:53,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-15 07:12:53,944 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 07:12:53,944 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 07:12:53,944 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 07:12:53,945 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 07:12:53,945 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 07:12:53,945 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 07:12:53,945 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 07:12:53,946 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 07:12:53,946 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 07:12:53,947 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 07:12:53,947 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-15 07:12:53,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 07:12:53,947 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 07:12:53,947 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 07:12:53,947 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-15 07:12:53,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-15 07:12:53,947 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 07:12:53,947 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 07:12:53,947 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,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 07:12:53,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 07:12:53,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-15 07:12:53,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-15 07:12:53,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-15 07:12:53,949 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 07:12:53,949 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 07:12:53,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-15 07:12:53,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-15 07:12:53,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-15 07:12:53,949 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 07:12:53,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-15 07:12:53,949 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 07:12:53,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456179709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:12:53,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:12:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 07:12:53,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584085713] [2022-04-15 07:12:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584085713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:53,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:12:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14011157] [2022-04-15 07:12:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:53,951 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 07:12:53,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:53,952 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 07:12:53,988 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 07:12:53,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:12:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:12:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:12:53,990 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 07:12:56,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 07:12:58,273 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 07:12:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:58,972 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-15 07:12:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:12:58,972 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 07:12:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:58,973 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 07:12:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 07:12:58,974 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 07:12:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 07:12:58,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-15 07:12:59,067 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 07:12:59,069 INFO L225 Difference]: With dead ends: 125 [2022-04-15 07:12:59,069 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 07:12:59,069 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 07:12:59,070 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 39 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 230 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:59,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 54 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 230 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 07:12:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 07:12:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-15 07:12:59,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:59,140 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 07:12:59,140 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 07:12:59,141 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 07:12:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:59,143 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 07:12:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 07:12:59,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:59,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:59,143 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 07:12:59,143 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 07:12:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:59,145 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 07:12:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 07:12:59,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:59,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:59,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:59,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:59,146 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 07:12:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2022-04-15 07:12:59,147 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 62 [2022-04-15 07:12:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:59,148 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2022-04-15 07:12:59,148 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 07:12:59,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 95 transitions. [2022-04-15 07:12:59,264 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 07:12:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-15 07:12:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 07:12:59,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:59,265 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 07:12:59,283 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 07:12:59,465 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 07:12:59,465 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 1 times [2022-04-15 07:12:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:59,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683115748] [2022-04-15 07:12:59,466 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 2 times [2022-04-15 07:12:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:59,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504617647] [2022-04-15 07:12:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:59,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,554 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 07:12:59,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 07:12:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 07:12:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 07:12:59,567 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 07:12:59,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 07:12:59,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,567 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 07:12:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:12:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 07:12:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:12:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,579 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 07:12:59,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 07:12:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,582 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 07:12:59,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 07:12:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:12:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,586 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 07:12:59,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-15 07:12:59,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-15 07:12:59,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,587 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 07:12:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 07:12:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,594 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 07:12:59,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 07:12:59,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,595 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 07:12:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 07:12:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,598 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 07:12:59,598 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 07:12:59,599 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 07:12:59,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-15 07:12:59,599 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 07:12:59,599 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 07:12:59,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-15 07:12:59,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 07:12:59,599 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 07:12:59,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,600 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 07:12:59,600 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 07:12:59,601 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 07:12:59,601 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 07:12:59,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,601 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 07:12:59,601 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 07:12:59,602 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 07:12:59,602 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 07:12:59,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,602 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 07:12:59,602 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 07:12:59,603 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 07:12:59,603 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 07:12:59,603 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 07:12:59,604 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 07:12:59,604 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 07:12:59,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-15 07:12:59,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-15 07:12:59,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,605 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 07:12:59,605 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 07:12:59,606 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 07:12:59,606 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 07:12:59,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 07:12:59,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,606 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 07:12:59,607 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 07:12:59,607 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 07:12:59,608 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 07:12:59,608 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 07:12:59,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,608 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 07:12:59,609 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 07:12:59,609 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 07:12:59,609 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 07:12:59,609 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 07:12:59,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-15 07:12:59,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-15 07:12:59,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-15 07:12:59,610 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 07:12:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:59,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504617647] [2022-04-15 07:12:59,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504617647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:59,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885961095] [2022-04-15 07:12:59,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:59,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:59,611 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 07:12:59,655 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 07:12:59,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:59,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:59,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:12:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:59,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:59,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {4507#true} call ULTIMATE.init(); {4507#true} is VALID [2022-04-15 07:12:59,992 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 07:12:59,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-15 07:12:59,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-15 07:12:59,992 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 07:12:59,992 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 07:12:59,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-15 07:12:59,993 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 07:12:59,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,993 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-15 07:12:59,993 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 07:12:59,994 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 07:12:59,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 07:12:59,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,994 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-15 07:12:59,994 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 07:12:59,994 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 07:12:59,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-15 07:12:59,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,994 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-15 07:12:59,994 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 07:12:59,994 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 07:12:59,994 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 07:12:59,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {4507#true} assume !(~i~1 < ~n~0); {4507#true} is VALID [2022-04-15 07:12:59,995 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 07:12:59,995 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 07:12:59,996 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 07:12:59,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {4673#(<= |upsweep_#in~n| 1)} #res := ~space~0; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:59,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {4673#(<= |upsweep_#in~n| 1)} assume true; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-15 07:12:59,997 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 07:12:59,997 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 07:12:59,997 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 07:12:59,998 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 07:12:59,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-15 07:12:59,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:12:59,998 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 07:12:59,999 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 07:13:00,000 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 07:13:00,000 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 07:13:00,000 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 07:13:00,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-15 07:13:00,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-15 07:13:00,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-15 07:13:00,001 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 07:13:00,001 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 07:13:00,002 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 07:13:00,003 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 07:13:00,003 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 07:13:00,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-15 07:13:00,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-15 07:13:00,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-15 07:13:00,003 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 07:13:00,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:13:00,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885961095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:00,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:13:00,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2022-04-15 07:13:00,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:00,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683115748] [2022-04-15 07:13:00,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683115748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:00,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:00,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:13:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618812583] [2022-04-15 07:13:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:00,005 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 07:13:00,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:00,005 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 07:13:00,048 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 07:13:00,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:13:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:13:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:13:00,049 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 07:13:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:15,536 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-15 07:13:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:13:15,537 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 07:13:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:15,537 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 07:13:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-15 07:13:15,538 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 07:13:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-15 07:13:15,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-15 07:13:15,606 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 07:13:15,607 INFO L225 Difference]: With dead ends: 101 [2022-04-15 07:13:15,607 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:13:15,607 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 07:13:15,608 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 07:13:15,608 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 07:13:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:13:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-15 07:13:15,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:15,666 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 07:13:15,666 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 07:13:15,667 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 07:13:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:15,668 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-15 07:13:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-15 07:13:15,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:15,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:15,669 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 07:13:15,669 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 07:13:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:15,670 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-15 07:13:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-15 07:13:15,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:15,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:15,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:15,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:15,671 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 07:13:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-04-15 07:13:15,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 64 [2022-04-15 07:13:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:15,673 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-04-15 07:13:15,673 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 07:13:15,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 80 transitions. [2022-04-15 07:13:15,773 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 07:13:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-04-15 07:13:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 07:13:15,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:15,774 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 07:13:15,792 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 07:13:15,974 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 07:13:15,974 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 1 times [2022-04-15 07:13:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:15,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390708454] [2022-04-15 07:13:15,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 2 times [2022-04-15 07:13:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:15,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280633821] [2022-04-15 07:13:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,027 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 07:13:16,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 07:13:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:13:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 07:13:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:13:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 07:13:16,036 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 07:13:16,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 07:13:16,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,036 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 07:13:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:13:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 07:13:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:13:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,046 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 07:13:16,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 07:13:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:13:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,049 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 07:13:16,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 07:13:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 07:13:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,093 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 07:13:16,093 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 07:13:16,094 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 07:13:16,094 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 07:13:16,095 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 07:13:16,095 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 07:13:16,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,097 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 07:13:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 07:13:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,103 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 07:13:16,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 07:13:16,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 07:13:16,103 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 07:13:16,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 07:13:16,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,103 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 07:13:16,104 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 07:13:16,104 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 07:13:16,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 07:13:16,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 07:13:16,104 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 07:13:16,104 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 07:13:16,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 07:13:16,105 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 07:13:16,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 07:13:16,106 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 07:13:16,106 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 07:13:16,106 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 07:13:16,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,107 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 07:13:16,107 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 07:13:16,108 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 07:13:16,108 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 07:13:16,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,108 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 07:13:16,108 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 07:13:16,108 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 07:13:16,109 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 07:13:16,109 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 07:13:16,110 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 07:13:16,110 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 07:13:16,111 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 07:13:16,111 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 07:13:16,112 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 07:13:16,112 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 07:13:16,113 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 07:13:16,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,114 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 07:13:16,114 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 07:13:16,114 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 07:13:16,114 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 07:13:16,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 07:13:16,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 07:13:16,115 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 07:13:16,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 07:13:16,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,115 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 07:13:16,115 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 07:13:16,115 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 07:13:16,115 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 07:13:16,115 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 07:13:16,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 07:13:16,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 07:13:16,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 07:13:16,116 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 07:13:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280633821] [2022-04-15 07:13:16,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280633821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:13:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85882599] [2022-04-15 07:13:16,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:16,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:16,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:16,117 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 07:13:16,121 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 07:13:16,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:16,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:16,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:13:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:16,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:16,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-15 07:13:16,418 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 07:13:16,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 07:13:16,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 07:13:16,418 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 07:13:16,418 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 07:13:16,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 07:13:16,419 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 07:13:16,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 07:13:16,420 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 07:13:16,420 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 07:13:16,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 07:13:16,420 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 07:13:16,420 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 07:13:16,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,420 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 07:13:16,421 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 07:13:16,421 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 07:13:16,422 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 07:13:16,422 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 07:13:16,422 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 07:13:16,423 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 07:13:16,423 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 07:13:16,424 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 07:13:16,424 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 07:13:16,424 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 07:13:16,425 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 07:13:16,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,426 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 07:13:16,426 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 07:13:16,426 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 07:13:16,427 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 07:13:16,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5256#false} is VALID [2022-04-15 07:13:16,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {5256#false} assume !(~right~1 < ~n); {5256#false} is VALID [2022-04-15 07:13:16,427 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 07:13:16,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {5256#false} assume !(~space > 0); {5256#false} is VALID [2022-04-15 07:13:16,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {5256#false} assume true; {5256#false} is VALID [2022-04-15 07:13:16,427 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5256#false} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 07:13:16,427 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 07:13:16,427 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 07:13:16,427 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 07:13:16,427 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 07:13:16,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 07:13:16,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 07:13:16,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 07:13:16,428 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 07:13:16,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:13:16,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-15 07:13:16,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-15 07:13:16,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-15 07:13:16,759 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 07:13:16,759 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 07:13:16,759 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 07:13:16,759 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 07:13:16,759 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-15 07:13:16,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-15 07:13:16,760 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 07:13:16,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-15 07:13:16,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-15 07:13:16,760 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 07:13:16,760 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 07:13:16,760 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 07:13:16,761 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 07:13:16,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-15 07:13:16,762 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 07:13:16,762 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 07:13:16,763 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 07:13:16,763 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 07:13:16,763 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 07:13:16,764 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 07:13:16,764 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 07:13:16,764 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 07:13:16,765 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 07:13:16,765 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 07:13:16,766 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 07:13:16,766 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-15 07:13:16,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 07:13:16,766 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 07:13:16,766 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 07:13:16,766 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-15 07:13:16,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-15 07:13:16,766 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 07:13:16,766 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 07:13:16,766 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-15 07:13:16,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-15 07:13:16,767 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 07:13:16,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-15 07:13:16,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-15 07:13:16,768 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 07:13:16,768 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 07:13:16,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-15 07:13:16,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-15 07:13:16,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-15 07:13:16,768 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 07:13:16,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-15 07:13:16,768 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 07:13:16,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85882599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:13:16,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:13:16,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 13 [2022-04-15 07:13:16,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:16,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390708454] [2022-04-15 07:13:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390708454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:16,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:16,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:13:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580589413] [2022-04-15 07:13:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:16,769 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 07:13:16,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:16,770 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 07:13:16,811 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 07:13:16,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:13:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:13:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:13:16,812 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 07:13:25,378 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 07:13:27,491 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 07:13:31,743 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 07:13:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,738 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-04-15 07:13:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:13:32,738 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 07:13:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:32,738 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 07:13:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 07:13:32,740 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 07:13:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-15 07:13:32,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-15 07:13:32,823 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 07:13:32,824 INFO L225 Difference]: With dead ends: 107 [2022-04-15 07:13:32,824 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 07:13:32,824 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 07:13:32,825 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:32,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 55 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 407 Invalid, 3 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 07:13:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 07:13:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-15 07:13:32,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:32,880 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 07:13:32,881 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 07:13:32,881 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 07:13:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,882 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 07:13:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 07:13:32,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:32,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:32,883 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 07:13:32,883 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 07:13:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,885 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 07:13:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 07:13:32,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:32,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:32,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:32,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:32,885 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 07:13:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-04-15 07:13:32,886 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 63 [2022-04-15 07:13:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:32,887 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-04-15 07:13:32,887 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 07:13:32,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 82 transitions. [2022-04-15 07:13:32,978 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 07:13:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-15 07:13:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 07:13:32,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:32,979 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 07:13:32,995 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 07:13:33,179 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 07:13:33,180 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:33,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 3 times [2022-04-15 07:13:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:33,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109818845] [2022-04-15 07:13:33,180 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 4 times [2022-04-15 07:13:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:33,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528732965] [2022-04-15 07:13:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,232 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 07:13:33,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 07:13:33,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:13:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 07:13:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:13:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 07:13:33,237 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 07:13:33,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 07:13:33,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,238 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 07:13:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:13:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 07:13:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:13:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,247 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 07:13:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 07:13:33,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:13:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,250 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 07:13:33,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 07:13:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 07:13:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,254 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 07:13:33,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 07:13:33,254 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 07:13:33,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,255 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 07:13:33,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 07:13:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,317 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 07:13:33,317 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 07:13:33,318 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 07:13:33,318 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 07:13:33,319 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 07:13:33,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 07:13:33,320 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 07:13:33,321 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 07:13:33,321 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 07:13:33,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 07:13:33,321 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 07:13:33,321 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 07:13:33,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 07:13:33,321 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 07:13:33,322 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 07:13:33,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,322 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 07:13:33,322 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 07:13:33,323 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 07:13:33,323 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 07:13:33,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,323 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 07:13:33,323 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 07:13:33,324 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 07:13:33,324 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 07:13:33,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,324 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 07:13:33,325 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 07:13:33,325 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 07:13:33,325 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 07:13:33,326 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 07:13:33,326 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 07:13:33,326 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 07:13:33,327 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 07:13:33,327 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 07:13:33,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 07:13:33,327 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 07:13:33,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,328 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 07:13:33,329 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 07:13:33,329 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 07:13:33,330 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 07:13:33,330 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 07:13:33,331 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 07:13:33,332 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 07:13:33,332 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 07:13:33,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 07:13:33,333 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 07:13:33,333 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 07:13:33,333 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 07:13:33,333 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 07:13:33,334 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 07:13:33,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 07:13:33,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 07:13:33,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 07:13:33,334 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 07:13:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528732965] [2022-04-15 07:13:33,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528732965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:13:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097361310] [2022-04-15 07:13:33,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:13:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:33,335 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 07:13:33,336 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 07:13:33,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:13:33,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:33,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 07:13:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:33,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-15 07:13:33,828 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 07:13:33,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 07:13:33,829 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 07:13:33,829 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 07:13:33,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 07:13:33,829 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 07:13:33,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 07:13:33,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 07:13:33,830 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 07:13:33,830 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 07:13:33,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,830 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 07:13:33,830 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 07:13:33,830 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 07:13:33,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 07:13:33,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,831 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 07:13:33,831 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 07:13:33,831 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 07:13:33,832 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 07:13:33,832 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 07:13:33,833 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 07:13:33,833 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 07:13:33,833 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 07:13:33,833 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 07:13:33,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 07:13:33,833 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 07:13:33,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:33,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 07:13:33,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:33,834 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 07:13:33,834 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 07:13:33,834 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 07:13:33,835 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 07:13:33,835 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 07:13:33,836 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 07:13:33,837 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 07:13:33,837 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 07:13:33,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 07:13:33,838 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 07:13:33,838 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 07:13:33,838 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 07:13:33,838 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 07:13:33,838 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 07:13:33,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 07:13:33,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 07:13:33,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 07:13:33,839 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 07:13:33,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:13:34,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-15 07:13:34,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-15 07:13:34,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-15 07:13:34,770 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 07:13:34,770 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 07:13:34,770 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 07:13:34,770 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 07:13:34,772 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 07:13:34,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-15 07:13:34,772 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 07:13:34,773 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 07:13:34,773 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 07:13:34,774 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 07:13:34,775 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 07:13:34,775 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 07:13:34,775 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 07:13:34,776 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 07:13:34,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-15 07:13:34,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:34,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-15 07:13:34,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-15 07:13:34,776 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 07:13:34,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-15 07:13:34,776 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 07:13:34,776 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 07:13:34,777 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 07:13:34,778 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 07:13:34,778 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 07:13:34,779 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 07:13:34,779 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 07:13:34,779 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 07:13:34,779 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-15 07:13:34,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 07:13:34,780 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 07:13:34,780 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 07:13:34,780 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-15 07:13:34,780 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 07:13:34,780 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 07:13:34,780 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:34,780 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-15 07:13:34,781 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 07:13:34,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-15 07:13:34,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-15 07:13:34,781 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 07:13:34,781 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 07:13:34,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-15 07:13:34,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-15 07:13:34,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-15 07:13:34,782 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 07:13:34,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-15 07:13:34,782 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 07:13:34,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097361310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:13:34,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:13:34,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-15 07:13:34,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109818845] [2022-04-15 07:13:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109818845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:34,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:34,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:13:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991605041] [2022-04-15 07:13:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:34,789 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 07:13:34,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:34,791 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 07:13:34,815 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 07:13:34,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:13:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:13:34,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:13:34,816 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 07:13:37,008 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 07:13:39,125 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 07:13:43,420 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 07:13:47,700 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 07:13:49,853 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 07:13:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:51,484 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-15 07:13:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:13:51,485 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 07:13:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:51,485 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 07:13:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-15 07:13:51,487 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 07:13:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-15 07:13:51,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 95 transitions. [2022-04-15 07:13:51,551 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 07:13:51,556 INFO L225 Difference]: With dead ends: 95 [2022-04-15 07:13:51,556 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:13:51,557 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 07:13:51,557 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:51,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 62 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 599 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2022-04-15 07:13:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:13:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-04-15 07:13:51,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:51,632 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 07:13:51,632 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 07:13:51,633 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 07:13:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:51,635 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-15 07:13:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-15 07:13:51,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:51,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:51,635 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 07:13:51,635 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 07:13:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:51,636 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-15 07:13:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-15 07:13:51,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:51,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:51,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:51,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:51,637 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 07:13:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-04-15 07:13:51,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 65 [2022-04-15 07:13:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:51,638 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-04-15 07:13:51,638 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 07:13:51,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 86 transitions. [2022-04-15 07:13:51,735 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 07:13:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-04-15 07:13:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 07:13:51,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:51,737 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 07:13:51,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:13:51,947 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 07:13:51,948 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 1 times [2022-04-15 07:13:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325251384] [2022-04-15 07:13:51,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:13:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 2 times [2022-04-15 07:13:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106229861] [2022-04-15 07:13:51,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:51,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,808 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 07:13:52,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:52,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 07:13:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:13:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:13:52,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:13:52,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:52,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 07:13:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:13:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 07:13:52,814 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 07:13:52,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 07:13:52,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:52,814 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 07:13:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 07:13:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:13:52,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:13:52,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:52,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 07:13:52,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 07:13:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,864 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 07:13:52,865 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 07:13:52,866 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 07:13:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:13:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,892 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 07:13:52,892 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 07:13:52,893 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 07:13:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-15 07:13:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:52,988 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 07:13:52,989 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 07:13:52,990 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 07:13:52,990 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 07:13:52,990 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 07:13:52,990 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 07:13:52,991 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 07:13:52,991 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 07:13:52,992 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 07:13:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 07:13:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:57,904 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 07:13:57,906 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 07:13:57,913 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 07:13:57,915 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 07:13:57,918 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 07:13:57,920 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 07:13:57,922 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 07:13:57,946 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 07:13:57,947 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 07:13:57,947 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 07:13:57,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:57,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 07:13:57,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-15 07:13:57,947 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 07:13:57,947 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 07:13:57,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:13:57,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 07:13:57,948 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 07:13:57,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:13:57,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:13:57,949 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 07:13:57,949 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 07:13:57,950 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 07:13:57,951 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 07:13:57,951 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 07:13:57,952 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 07:13:57,953 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 07:13:57,954 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 07:13:57,954 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 07:13:57,954 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 07:13:57,956 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 07:13:57,956 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 07:13:57,957 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 07:13:57,957 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 07:13:57,958 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 07:13:57,958 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 07:13:57,959 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 07:13:57,960 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 07:13:57,960 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 07:13:57,960 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 07:13:57,962 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 07:13:57,962 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 07:13:57,962 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 07:13:57,963 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 07:13:57,963 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 07:13:57,963 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 07:13:57,965 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 07:13:57,966 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 07:13:57,967 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 07:13:57,968 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 07:13:57,969 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 07:13:57,975 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 07:13:57,978 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 07:13:57,980 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 07:13:57,982 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 07:13:57,984 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 07:13:58,021 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 07:13:58,025 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 07:13:58,029 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 07:13:58,030 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 07:13:58,030 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 07:13:58,031 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 07:13:58,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {7236#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7183#false} is VALID [2022-04-15 07:13:58,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-15 07:13:58,032 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 07:13:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:58,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106229861] [2022-04-15 07:13:58,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106229861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:13:58,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45248824] [2022-04-15 07:13:58,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:13:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:13:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:13:58,033 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 07:13:58,034 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 07:13:58,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:13:58,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:13:58,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 07:13:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:58,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:13:58,754 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 07:13:59,020 INFO L356 Elim1Store]: treesize reduction 151, result has 25.2 percent of original size [2022-04-15 07:13:59,020 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 07:14:00,248 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 07:14:00,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7182#true} is VALID [2022-04-15 07:14:00,427 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 07:14:00,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-15 07:14:00,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-15 07:14:00,427 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 07:14:00,427 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 07:14:00,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-15 07:14:00,428 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 07:14:00,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-15 07:14:00,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,429 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-15 07:14:00,429 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 07:14:00,429 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 07:14:00,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 07:14:00,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,430 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 07:14:00,430 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 07:14:00,430 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 07:14:00,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-15 07:14:00,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-15 07:14:00,431 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 07:14:00,432 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 07:14:00,432 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 07:14:00,433 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 07:14:00,433 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 07:14:00,433 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 07:14:00,434 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 07:14:00,434 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 07:14:00,434 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 07:14:00,435 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 07:14:00,435 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 07:14:00,436 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 07:14:00,436 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 07:14:00,436 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 07:14:00,437 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 07:14:00,437 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 07:14:00,438 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 07:14:00,438 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 07:14:00,438 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 07:14:00,440 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 07:14:00,441 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 07:14:00,451 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 07:14:00,457 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 07:14:00,464 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 07:14:00,469 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 07:14:00,474 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 07:14:00,477 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 07:14:00,478 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 07:14:00,479 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 07:14:00,479 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 07:14:00,480 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 07:14:00,480 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 07:14:00,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {7459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7183#false} is VALID [2022-04-15 07:14:00,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-15 07:14:00,481 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 07:14:00,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:14:01,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 07:14:01,637 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 07:14:01,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 07:14:01,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 07:14:01,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 07:14:01,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 07:14:01,782 INFO L356 Elim1Store]: treesize reduction 149, result has 55.4 percent of original size [2022-04-15 07:14:01,783 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 07:14:02,043 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 262