/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:41:33,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:41:33,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:41:33,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:41:33,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:41:33,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:41:33,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:41:33,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:41:33,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:41:33,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:41:33,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:41:33,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:41:33,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:41:33,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:41:33,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:41:33,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:41:33,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:41:33,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:41:33,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:41:33,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:41:33,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:41:33,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:41:33,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:41:33,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:41:33,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:41:33,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:41:33,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:41:33,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:41:33,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:41:33,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:41:33,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:41:33,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:41:33,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:41:33,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:41:33,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:41:33,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:41:33,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:41:33,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:41:33,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:41:33,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:41:33,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:41:33,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:41:33,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:41:34,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:41:34,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:41:34,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:41:34,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:41:34,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:41:34,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:41:34,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:41:34,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:41:34,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:41:34,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:41:34,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:41:34,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:41:34,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:41:34,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:41:34,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:41:34,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:41:34,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:41:34,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:41:34,015 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:41:34,015 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:41:34,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:41:34,016 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:41:34,016 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-28 10:41:34,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:41:34,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:41:34,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:41:34,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:41:34,293 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:41:34,294 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-28 10:41:34,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61ce4e4b/aa52c9724bee45bca71c3aafc9785647/FLAG35a2048a7 [2022-04-28 10:41:34,740 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:41:34,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-28 10:41:34,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61ce4e4b/aa52c9724bee45bca71c3aafc9785647/FLAG35a2048a7 [2022-04-28 10:41:34,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61ce4e4b/aa52c9724bee45bca71c3aafc9785647 [2022-04-28 10:41:34,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:41:34,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:41:34,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:41:34,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:41:34,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:41:34,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:41:34" (1/1) ... [2022-04-28 10:41:34,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f16cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:34, skipping insertion in model container [2022-04-28 10:41:34,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:41:34" (1/1) ... [2022-04-28 10:41:34,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:41:34,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:41:34,947 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-28 10:41:34,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:41:35,004 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:41:35,021 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-28 10:41:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:41:35,055 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:41:35,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35 WrapperNode [2022-04-28 10:41:35,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:41:35,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:41:35,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:41:35,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:41:35,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:41:35,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:41:35,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:41:35,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:41:35,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (1/1) ... [2022-04-28 10:41:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:41:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:35,149 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-28 10:41:35,173 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-28 10:41:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:41:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:41:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:41:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-04-28 10:41:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:41:35,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 10:41:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 10:41:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-28 10:41:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:41:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:41:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:41:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:41:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:41:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:41:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:41:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:41:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:41:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:41:35,323 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:41:35,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:41:37,753 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:41:37,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:41:37,762 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-28 10:41:37,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:41:37 BoogieIcfgContainer [2022-04-28 10:41:37,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:41:37,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:41:37,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:41:37,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:41:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:41:34" (1/3) ... [2022-04-28 10:41:37,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58ac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:41:37, skipping insertion in model container [2022-04-28 10:41:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:41:35" (2/3) ... [2022-04-28 10:41:37,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58ac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:41:37, skipping insertion in model container [2022-04-28 10:41:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:41:37" (3/3) ... [2022-04-28 10:41:37,776 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-04-28 10:41:37,786 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:41:37,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:41:37,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:41:37,828 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43cf9fb7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71f90298 [2022-04-28 10:41:37,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:41:37,836 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-28 10:41:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 10:41:37,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:37,845 INFO L195 NwaCegarLoop]: 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-28 10:41:37,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 1 times [2022-04-28 10:41:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:37,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223681805] [2022-04-28 10:41:37,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:41:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 2 times [2022-04-28 10:41:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496894943] [2022-04-28 10:41:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,067 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-28 10:41:38,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-28 10:41:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:41:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-28 10:41:38,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-28 10:41:38,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-28 10:41:38,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-28 10:41:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:41:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-28 10:41:38,130 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-28 10:41:38,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-28 10:41:38,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,131 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-28 10:41:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:41:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-28 10:41:38,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-28 10:41:38,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-28 10:41:38,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-28 10:41:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:41:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,170 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-28 10:41:38,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-28 10:41:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:41:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,186 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-28 10:41:38,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-28 10:41:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-28 10:41:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,214 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-28 10:41:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-28 10:41:38,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-28 10:41:38,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,215 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-28 10:41:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 10:41:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:38,256 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-28 10:41:38,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-28 10:41:38,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-28 10:41:38,258 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-28 10:41:38,258 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-28 10:41:38,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-28 10:41:38,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret20 := main(); {67#true} is VALID [2022-04-28 10:41:38,259 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-28 10:41:38,260 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-28 10:41:38,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-28 10:41:38,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-28 10:41:38,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-28 10:41:38,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-28 10:41:38,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {68#false} call #t~ret14 := is_pow2(~n~0); {67#true} is VALID [2022-04-28 10:41:38,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-28 10:41:38,263 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-28 10:41:38,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-28 10:41:38,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,266 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-28 10:41:38,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {68#false} is VALID [2022-04-28 10:41:38,267 INFO L272 TraceCheckUtils]: 18: Hoare triple {68#false} call assume_abort_if_not(#t~ret14); {67#true} is VALID [2022-04-28 10:41:38,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-28 10:41:38,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-28 10:41:38,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-28 10:41:38,273 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-28 10:41:38,273 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-28 10:41:38,276 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-28 10:41:38,276 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-28 10:41:38,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,277 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-28 10:41:38,277 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-28 10:41:38,277 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-28 10:41:38,277 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-28 10:41:38,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,278 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-28 10:41:38,278 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-28 10:41:38,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} assume !(~i~1 < ~n~0); {68#false} is VALID [2022-04-28 10:41:38,278 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-28 10:41:38,278 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-28 10:41:38,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-28 10:41:38,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-28 10:41:38,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,279 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-28 10:41:38,279 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-28 10:41:38,279 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-28 10:41:38,281 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-28 10:41:38,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-28 10:41:38,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 10:41:38,281 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-28 10:41:38,282 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-28 10:41:38,282 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-28 10:41:38,282 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-28 10:41:38,282 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-28 10:41:38,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-28 10:41:38,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-28 10:41:38,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-28 10:41:38,283 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-28 10:41:38,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496894943] [2022-04-28 10:41:38,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496894943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:41:38,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:38,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223681805] [2022-04-28 10:41:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223681805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:38,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:38,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:41:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69439446] [2022-04-28 10:41:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:38,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-28 10:41:38,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:38,303 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-28 10:41:38,370 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-28 10:41:38,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:41:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:41:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:41:38,402 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-28 10:41:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:38,953 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2022-04-28 10:41:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:41:38,954 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-28 10:41:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:38,956 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-28 10:41:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-28 10:41:38,967 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-28 10:41:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-28 10:41:38,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 171 transitions. [2022-04-28 10:41:39,153 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-28 10:41:39,163 INFO L225 Difference]: With dead ends: 127 [2022-04-28 10:41:39,163 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 10:41:39,166 INFO L412 NwaCegarLoop]: 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-28 10:41:39,169 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 81 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:39,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:41:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 10:41:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-04-28 10:41:39,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:39,202 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-28 10:41:39,202 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-28 10:41:39,203 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-28 10:41:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:39,208 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 10:41:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 10:41:39,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:39,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:39,209 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-28 10:41:39,210 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-28 10:41:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:39,215 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 10:41:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 10:41:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:39,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:39,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:39,216 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-28 10:41:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-28 10:41:39,220 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2022-04-28 10:41:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:39,221 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-28 10:41:39,221 INFO L496 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-28 10:41:39,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 65 transitions. [2022-04-28 10:41:39,295 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-28 10:41:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-28 10:41:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 10:41:39,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:39,297 INFO L195 NwaCegarLoop]: 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-28 10:41:39,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:41:39,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 1 times [2022-04-28 10:41:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:39,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426601799] [2022-04-28 10:41:39,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:41:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 2 times [2022-04-28 10:41:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78506764] [2022-04-28 10:41:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,454 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-28 10:41:39,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-28 10:41:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:41:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-28 10:41:39,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-28 10:41:39,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-28 10:41:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:41:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-28 10:41:39,467 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-28 10:41:39,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-28 10:41:39,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,468 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-28 10:41:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:41:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-28 10:41:39,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-28 10:41:39,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-28 10:41:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:41:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,487 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-28 10:41:39,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-28 10:41:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:41:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {601#true} is VALID [2022-04-28 10:41:39,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-28 10:41:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-28 10:41:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,501 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-28 10:41:39,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-28 10:41:39,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-28 10:41:39,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,503 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #152#return; {626#(<= main_~n~0 0)} is VALID [2022-04-28 10:41:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 10:41:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:39,513 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-28 10:41:39,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-28 10:41:39,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #154#return; {626#(<= main_~n~0 0)} is VALID [2022-04-28 10:41:39,515 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-28 10:41:39,515 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-28 10:41:39,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #160#return; {601#true} is VALID [2022-04-28 10:41:39,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret20 := main(); {601#true} is VALID [2022-04-28 10:41:39,516 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-28 10:41:39,516 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-28 10:41:39,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-28 10:41:39,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-28 10:41:39,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#true} {601#true} #142#return; {601#true} is VALID [2022-04-28 10:41:39,517 INFO L272 TraceCheckUtils]: 11: Hoare triple {601#true} call #t~ret14 := is_pow2(~n~0); {601#true} is VALID [2022-04-28 10:41:39,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#true} ~x := #in~x; {601#true} is VALID [2022-04-28 10:41:39,518 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-28 10:41:39,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {601#true} is VALID [2022-04-28 10:41:39,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,518 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {601#true} {601#true} #144#return; {601#true} is VALID [2022-04-28 10:41:39,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {601#true} is VALID [2022-04-28 10:41:39,519 INFO L272 TraceCheckUtils]: 18: Hoare triple {601#true} call assume_abort_if_not(#t~ret14); {601#true} is VALID [2022-04-28 10:41:39,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {601#true} ~cond := #in~cond; {601#true} is VALID [2022-04-28 10:41:39,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#true} assume !(0 == ~cond); {601#true} is VALID [2022-04-28 10:41:39,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,519 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {601#true} {601#true} #146#return; {601#true} is VALID [2022-04-28 10:41:39,520 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-28 10:41:39,521 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-28 10:41:39,521 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-28 10:41:39,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,521 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {601#true} {601#true} #148#return; {601#true} is VALID [2022-04-28 10:41:39,522 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-28 10:41:39,523 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-28 10:41:39,523 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-28 10:41:39,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,523 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {601#true} {601#true} #150#return; {601#true} is VALID [2022-04-28 10:41:39,524 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-28 10:41:39,524 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-28 10:41:39,525 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-28 10:41:39,526 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-28 10:41:39,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {601#true} assume !(~space~0 < ~n); {601#true} is VALID [2022-04-28 10:41:39,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {601#true} #res := ~space~0; {601#true} is VALID [2022-04-28 10:41:39,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,527 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #152#return; {626#(<= main_~n~0 0)} is VALID [2022-04-28 10:41:39,528 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-28 10:41:39,529 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-28 10:41:39,529 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-28 10:41:39,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {601#true} assume !(~space > 0); {601#true} is VALID [2022-04-28 10:41:39,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 10:41:39,530 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {601#true} {626#(<= main_~n~0 0)} #154#return; {626#(<= main_~n~0 0)} is VALID [2022-04-28 10:41:39,532 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-28 10:41:39,532 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-28 10:41:39,533 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-28 10:41:39,533 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-28 10:41:39,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2022-04-28 10:41:39,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2022-04-28 10:41:39,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {602#false} assume !false; {602#false} is VALID [2022-04-28 10:41:39,534 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-28 10:41:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:39,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78506764] [2022-04-28 10:41:39,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78506764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:39,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:39,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:41:39,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:39,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426601799] [2022-04-28 10:41:39,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426601799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:39,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:39,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:41:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441666766] [2022-04-28 10:41:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:39,537 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-28 10:41:39,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:39,537 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-28 10:41:39,587 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-28 10:41:39,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:41:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:41:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:41:39,591 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-28 10:41:41,853 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-28 10:41:48,309 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-28 10:41:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:49,628 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:41:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:41:49,628 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-28 10:41:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:49,629 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-28 10:41:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 10:41:49,633 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-28 10:41:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 10:41:49,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 10:41:49,740 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-28 10:41:49,743 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:41:49,743 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:41:49,744 INFO L412 NwaCegarLoop]: 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-28 10:41:49,745 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:49,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 305 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 10:41:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:41:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-28 10:41:49,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:49,755 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-28 10:41:49,755 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-28 10:41:49,756 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-28 10:41:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:49,759 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-28 10:41:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-28 10:41:49,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:49,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:49,760 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-28 10:41:49,760 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-28 10:41:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:49,763 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-28 10:41:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-28 10:41:49,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:49,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:49,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:49,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:49,765 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-28 10:41:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-28 10:41:49,767 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2022-04-28 10:41:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:49,768 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-28 10:41:49,768 INFO L496 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-28 10:41:49,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 66 transitions. [2022-04-28 10:41:49,848 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-28 10:41:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-28 10:41:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 10:41:49,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:49,850 INFO L195 NwaCegarLoop]: 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-28 10:41:49,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:41:49,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 1 times [2022-04-28 10:41:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:49,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347598263] [2022-04-28 10:41:49,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:41:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 2 times [2022-04-28 10:41:49,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:49,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145600502] [2022-04-28 10:41:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,179 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-28 10:41:50,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-28 10:41:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:41:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:50,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:50,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-28 10:41:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:41:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-28 10:41:50,194 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-28 10:41:50,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-28 10:41:50,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,194 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-28 10:41:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:41:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:50,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:50,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-28 10:41:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:41:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,257 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-28 10:41:50,257 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-28 10:41:50,258 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-28 10:41:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:41:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,286 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-28 10:41:50,287 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-28 10:41:50,289 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-28 10:41:50,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:41:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,301 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-28 10:41:50,301 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-28 10:41:50,302 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-28 10:41:50,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume true; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:41:50,304 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-28 10:41:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 10:41:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,359 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-28 10:41:50,360 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-28 10:41:50,360 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-28 10:41:50,362 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-28 10:41:50,363 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-28 10:41:50,363 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-28 10:41:50,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-28 10:41:50,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-28 10:41:50,363 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-28 10:41:50,364 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-28 10:41:50,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:50,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:50,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-28 10:41:50,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-28 10:41:50,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-28 10:41:50,365 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-28 10:41:50,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-28 10:41:50,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,365 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-28 10:41:50,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-28 10:41:50,365 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-28 10:41:50,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:50,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:50,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:50,366 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-28 10:41:50,367 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-28 10:41:50,368 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-28 10:41:50,369 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-28 10:41:50,369 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-28 10:41:50,371 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-28 10:41:50,372 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-28 10:41:50,373 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-28 10:41:50,374 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-28 10:41:50,374 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-28 10:41:50,376 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-28 10:41:50,376 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-28 10:41:50,381 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-28 10:41:50,383 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-28 10:41:50,383 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-28 10:41:50,384 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-28 10:41:50,390 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-28 10:41:50,391 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-28 10:41:50,394 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-28 10:41:50,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {1104#(= |#memory_int| |old(#memory_int)|)} assume true; {1104#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:41:50,397 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-28 10:41:50,398 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-28 10:41:50,401 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-28 10:41:50,402 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-28 10:41:50,403 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-28 10:41:50,404 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-28 10:41:50,405 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-28 10:41:50,408 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-28 10:41:50,410 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-28 10:41:50,410 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-28 10:41:50,411 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-28 10:41:50,416 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-28 10:41:50,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {1102#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1062#false} is VALID [2022-04-28 10:41:50,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-28 10:41:50,421 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-28 10:41:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:50,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145600502] [2022-04-28 10:41:50,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145600502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:50,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171954288] [2022-04-28 10:41:50,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:41:50,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:50,431 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-28 10:41:50,441 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-28 10:41:50,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:41:50,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:41:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:50,940 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-28 10:41:51,670 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-04-28 10:41:51,670 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-28 10:41:51,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2022-04-28 10:41:51,839 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-28 10:41:51,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #160#return; {1061#true} is VALID [2022-04-28 10:41:51,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret20 := main(); {1061#true} is VALID [2022-04-28 10:41:51,839 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-28 10:41:51,840 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-28 10:41:51,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:51,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:51,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} #142#return; {1061#true} is VALID [2022-04-28 10:41:51,840 INFO L272 TraceCheckUtils]: 11: Hoare triple {1061#true} call #t~ret14 := is_pow2(~n~0); {1061#true} is VALID [2022-04-28 10:41:51,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#true} ~x := #in~x; {1061#true} is VALID [2022-04-28 10:41:51,840 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-28 10:41:51,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1061#true} {1061#true} #144#return; {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L272 TraceCheckUtils]: 18: Hoare triple {1061#true} call assume_abort_if_not(#t~ret14); {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#true} ~cond := #in~cond; {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#true} assume !(0 == ~cond); {1061#true} is VALID [2022-04-28 10:41:51,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,842 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1061#true} {1061#true} #146#return; {1061#true} is VALID [2022-04-28 10:41:51,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-28 10:41:51,842 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-28 10:41:51,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-28 10:41:51,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,842 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1061#true} {1061#true} #148#return; {1061#true} is VALID [2022-04-28 10:41:51,842 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-28 10:41:51,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-28 10:41:51,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1061#true} is VALID [2022-04-28 10:41:51,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {1061#true} assume true; {1061#true} is VALID [2022-04-28 10:41:51,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1061#true} {1061#true} #150#return; {1061#true} is VALID [2022-04-28 10:41:51,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-28 10:41:51,843 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-28 10:41:51,843 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-28 10:41:51,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#true} assume !(~i~1 < ~n~0); {1061#true} is VALID [2022-04-28 10:41:51,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-28 10:41:51,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-28 10:41:51,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-28 10:41:51,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {1229#(<= |upsweep_#in~n| 1)} #res := ~space~0; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:41:51,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {1229#(<= |upsweep_#in~n| 1)} assume true; {1229#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:41:51,848 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1229#(<= |upsweep_#in~n| 1)} {1061#true} #152#return; {1239#(<= main_~n~0 1)} is VALID [2022-04-28 10:41:51,848 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-28 10:41:51,848 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-28 10:41:51,849 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-28 10:41:51,851 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-28 10:41:51,851 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-28 10:41:51,852 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-28 10:41:51,856 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-28 10:41:51,863 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-28 10:41:51,864 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-28 10:41:51,865 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-28 10:41:51,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {1275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:51,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {1279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1062#false} is VALID [2022-04-28 10:41:51,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2022-04-28 10:41:51,866 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-28 10:41:51,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:41:51,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171954288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:51,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:41:51,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2022-04-28 10:41:51,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:51,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347598263] [2022-04-28 10:41:51,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347598263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:51,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:51,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:41:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534356673] [2022-04-28 10:41:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:51,869 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-28 10:41:51,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:51,870 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-28 10:41:51,920 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-28 10:41:51,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:41:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:41:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:41:51,921 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-28 10:42:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:05,913 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 10:42:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:42:05,917 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-28 10:42:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:05,920 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-28 10:42:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-28 10:42:05,928 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-28 10:42:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-04-28 10:42:05,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2022-04-28 10:42:06,055 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-28 10:42:06,057 INFO L225 Difference]: With dead ends: 83 [2022-04-28 10:42:06,057 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:42:06,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:42:06,059 INFO L413 NwaCegarLoop]: 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-28 10:42:06,059 INFO L414 NwaCegarLoop]: 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-28 10:42:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:42:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-04-28 10:42:06,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:06,108 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-28 10:42:06,109 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-28 10:42:06,109 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-28 10:42:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:06,118 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:42:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:42:06,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:06,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:06,124 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-28 10:42:06,124 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-28 10:42:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:06,127 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:42:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:42:06,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:06,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:06,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:06,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:06,129 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-28 10:42:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-04-28 10:42:06,132 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 56 [2022-04-28 10:42:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:06,132 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-04-28 10:42:06,133 INFO L496 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-28 10:42:06,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 90 transitions. [2022-04-28 10:42:06,234 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-28 10:42:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 10:42:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 10:42:06,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:06,236 INFO L195 NwaCegarLoop]: 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-28 10:42:06,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:42:06,439 WARN L477 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-28 10:42:06,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:06,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 1 times [2022-04-28 10:42:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:06,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958599788] [2022-04-28 10:42:06,441 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:42:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -35265218, now seen corresponding path program 2 times [2022-04-28 10:42:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:06,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671020226] [2022-04-28 10:42:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,562 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-28 10:42:06,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-28 10:42:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:42:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:06,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:06,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-28 10:42:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:42:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-28 10:42:06,576 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-28 10:42:06,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-28 10:42:06,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,576 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-28 10:42:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:42:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:06,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:06,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-28 10:42:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:42:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,595 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-28 10:42:06,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-28 10:42:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:42:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,600 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-28 10:42:06,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-28 10:42:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:42:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,626 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-28 10:42:06,627 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-28 10:42:06,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-28 10:42:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-28 10:42:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,646 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-28 10:42:06,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-28 10:42:06,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-28 10:42:06,647 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-28 10:42:06,647 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-28 10:42:06,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-28 10:42:06,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-28 10:42:06,647 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-28 10:42:06,648 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-28 10:42:06,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:06,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:06,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-28 10:42:06,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-28 10:42:06,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-28 10:42:06,649 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-28 10:42:06,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-28 10:42:06,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,649 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-28 10:42:06,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-28 10:42:06,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-28 10:42:06,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:06,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:06,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,651 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-28 10:42:06,651 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-28 10:42:06,652 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-28 10:42:06,652 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-28 10:42:06,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,653 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-28 10:42:06,653 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-28 10:42:06,660 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-28 10:42:06,661 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-28 10:42:06,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,662 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-28 10:42:06,662 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-28 10:42:06,663 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-28 10:42:06,664 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-28 10:42:06,664 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-28 10:42:06,665 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-28 10:42:06,665 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-28 10:42:06,666 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-28 10:42:06,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {1812#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {1772#false} is VALID [2022-04-28 10:42:06,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {1772#false} ~space~0 := 2 * ~space~0; {1772#false} is VALID [2022-04-28 10:42:06,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#false} assume !(~space~0 < ~n); {1772#false} is VALID [2022-04-28 10:42:06,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#false} #res := ~space~0; {1772#false} is VALID [2022-04-28 10:42:06,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#false} assume true; {1772#false} is VALID [2022-04-28 10:42:06,667 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#false} {1797#(<= 1 main_~n~0)} #152#return; {1772#false} is VALID [2022-04-28 10:42:06,667 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-28 10:42:06,671 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-28 10:42:06,671 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-28 10:42:06,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {1771#true} assume !(~space > 0); {1771#true} is VALID [2022-04-28 10:42:06,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:06,672 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1771#true} {1772#false} #154#return; {1772#false} is VALID [2022-04-28 10:42:06,672 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-28 10:42:06,672 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-28 10:42:06,672 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-28 10:42:06,672 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-28 10:42:06,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {1772#false} ~cond := #in~cond; {1772#false} is VALID [2022-04-28 10:42:06,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {1772#false} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 10:42:06,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 10:42:06,674 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-28 10:42:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:06,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671020226] [2022-04-28 10:42:06,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671020226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:06,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194073961] [2022-04-28 10:42:06,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:06,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:06,676 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-28 10:42:06,703 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-28 10:42:06,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:42:06,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:06,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:42:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:06,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:07,095 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-28 10:42:08,594 INFO L356 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2022-04-28 10:42:08,594 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-28 10:42:08,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-28 10:42:08,774 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-28 10:42:08,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #160#return; {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret20 := main(); {1771#true} is VALID [2022-04-28 10:42:08,775 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-28 10:42:08,775 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-28 10:42:08,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1771#true} {1771#true} #142#return; {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L272 TraceCheckUtils]: 11: Hoare triple {1771#true} call #t~ret14 := is_pow2(~n~0); {1771#true} is VALID [2022-04-28 10:42:08,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-04-28 10:42:08,775 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-28 10:42:08,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1771#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1771#true} {1771#true} #144#return; {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {1771#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L272 TraceCheckUtils]: 18: Hoare triple {1771#true} call assume_abort_if_not(#t~ret14); {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {1771#true} ~cond := #in~cond; {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {1771#true} assume !(0 == ~cond); {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,776 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1771#true} {1771#true} #146#return; {1771#true} is VALID [2022-04-28 10:42:08,777 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-28 10:42:08,777 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-28 10:42:08,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-28 10:42:08,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,777 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1771#true} {1771#true} #148#return; {1771#true} is VALID [2022-04-28 10:42:08,777 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-28 10:42:08,777 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-28 10:42:08,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {1771#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1771#true} is VALID [2022-04-28 10:42:08,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 10:42:08,778 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1771#true} {1771#true} #150#return; {1771#true} is VALID [2022-04-28 10:42:08,778 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-28 10:42:08,778 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-28 10:42:08,778 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-28 10:42:08,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {1771#true} assume !(~i~1 < ~n~0); {1771#true} is VALID [2022-04-28 10:42:08,778 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-28 10:42:08,784 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-28 10:42:08,784 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-28 10:42:08,785 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-28 10:42:08,785 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-28 10:42:08,786 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-28 10:42:08,786 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-28 10:42:08,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= |upsweep_#in~n| |upsweep_#res|)} assume true; {1947#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-28 10:42:08,787 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-28 10:42:08,788 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-28 10:42:08,788 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-28 10:42:08,790 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-28 10:42:08,791 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-28 10:42:08,791 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-28 10:42:08,793 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-28 10:42:08,802 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-28 10:42:08,803 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-28 10:42:08,804 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-28 10:42:08,805 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-28 10:42:08,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {1992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:42:08,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {1996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 10:42:08,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 10:42:08,806 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-28 10:42:08,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:42:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194073961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:42:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2022-04-28 10:42:08,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:08,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958599788] [2022-04-28 10:42:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958599788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:42:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34239806] [2022-04-28 10:42:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:08,808 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-28 10:42:08,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:08,809 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-28 10:42:08,886 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-28 10:42:08,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:42:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:42:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:42:08,888 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-28 10:42:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:29,569 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-28 10:42:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:42:29,570 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-28 10:42:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:29,571 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-28 10:42:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:42:29,573 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-28 10:42:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:42:29,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-28 10:42:29,669 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-28 10:42:29,672 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:42:29,672 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 10:42:29,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:42:29,673 INFO L413 NwaCegarLoop]: 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-28 10:42:29,674 INFO L414 NwaCegarLoop]: 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-28 10:42:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 10:42:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-04-28 10:42:29,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:29,753 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-28 10:42:29,753 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-28 10:42:29,754 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-28 10:42:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:29,761 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-28 10:42:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-28 10:42:29,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:29,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:29,763 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-28 10:42:29,763 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-28 10:42:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:29,771 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-28 10:42:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-28 10:42:29,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:29,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:29,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:29,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:29,772 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-28 10:42:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-04-28 10:42:29,775 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 59 [2022-04-28 10:42:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:29,777 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-04-28 10:42:29,778 INFO L496 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-28 10:42:29,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 95 transitions. [2022-04-28 10:42:29,994 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-28 10:42:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-28 10:42:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 10:42:29,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:29,995 INFO L195 NwaCegarLoop]: 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-28 10:42:30,013 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-28 10:42:30,199 WARN L477 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-28 10:42:30,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 1 times [2022-04-28 10:42:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:30,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1833245184] [2022-04-28 10:42:30,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:42:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 281114777, now seen corresponding path program 2 times [2022-04-28 10:42:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908179796] [2022-04-28 10:42:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,279 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-28 10:42:30,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-28 10:42:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:42:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-28 10:42:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:42:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-28 10:42:30,288 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-28 10:42:30,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-28 10:42:30,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,288 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-28 10:42:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:42:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-28 10:42:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:42:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,303 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-28 10:42:30,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-28 10:42:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:42:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,307 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-28 10:42:30,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-28 10:42:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:42:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,312 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-28 10:42:30,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-28 10:42:30,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-28 10:42:30,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2598#(<= main_~n~0 1)} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 10:42:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,395 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-28 10:42:30,395 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-28 10:42:30,396 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-28 10:42:30,397 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-28 10:42:30,397 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-28 10:42:30,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,398 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-28 10:42:30,399 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-28 10:42:30,399 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-28 10:42:30,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-28 10:42:30,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-28 10:42:30,400 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-28 10:42:30,400 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-28 10:42:30,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-28 10:42:30,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-28 10:42:30,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-28 10:42:30,400 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-28 10:42:30,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-28 10:42:30,402 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-28 10:42:30,402 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-28 10:42:30,403 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-28 10:42:30,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,403 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-28 10:42:30,403 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-28 10:42:30,403 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-28 10:42:30,404 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-28 10:42:30,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,404 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-28 10:42:30,404 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-28 10:42:30,404 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-28 10:42:30,405 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-28 10:42:30,405 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-28 10:42:30,406 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-28 10:42:30,406 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-28 10:42:30,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {2572#true} assume !(~space~0 < ~n); {2572#true} is VALID [2022-04-28 10:42:30,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {2572#true} #res := ~space~0; {2572#true} is VALID [2022-04-28 10:42:30,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,407 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2572#true} {2598#(<= main_~n~0 1)} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:30,407 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-28 10:42:30,408 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-28 10:42:30,409 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-28 10:42:30,409 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-28 10:42:30,410 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-28 10:42:30,410 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-28 10:42:30,410 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-28 10:42:30,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,412 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-28 10:42:30,412 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-28 10:42:30,412 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-28 10:42:30,412 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-28 10:42:30,412 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-28 10:42:30,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-28 10:42:30,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-28 10:42:30,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-28 10:42:30,413 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-28 10:42:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:30,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908179796] [2022-04-28 10:42:30,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908179796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:30,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007473088] [2022-04-28 10:42:30,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:30,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:30,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:30,416 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-28 10:42:30,426 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-28 10:42:30,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:42:30,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:30,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:42:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:30,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:30,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-28 10:42:30,917 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-28 10:42:30,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-28 10:42:30,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-28 10:42:30,918 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-28 10:42:30,918 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-28 10:42:30,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-28 10:42:30,918 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-28 10:42:30,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-28 10:42:30,918 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-28 10:42:30,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,919 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-28 10:42:30,919 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-28 10:42:30,920 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-28 10:42:30,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-28 10:42:30,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,920 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-28 10:42:30,920 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-28 10:42:30,920 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-28 10:42:30,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-28 10:42:30,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:30,920 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-28 10:42:30,921 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-28 10:42:30,921 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-28 10:42:30,921 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-28 10:42:30,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-28 10:42:30,921 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-28 10:42:30,922 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-28 10:42:30,922 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-28 10:42:30,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:30,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:30,924 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2739#(<= |upsweep_#in~n| 1)} {2572#true} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:30,925 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-28 10:42:30,925 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-28 10:42:30,925 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-28 10:42:30,926 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-28 10:42:30,927 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-28 10:42:30,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,927 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-28 10:42:30,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:30,929 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-28 10:42:30,929 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-28 10:42:30,929 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-28 10:42:30,929 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-28 10:42:30,929 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-28 10:42:30,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-28 10:42:30,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-28 10:42:30,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-28 10:42:30,930 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-28 10:42:30,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:42:31,831 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-04-28 10:42:31,831 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2022-04-28 10:42:31,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2022-04-28 10:42:31,832 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-28 10:42:31,832 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-28 10:42:31,832 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-28 10:42:31,832 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-28 10:42:31,833 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2617#(<= 2 |downsweep_#in~n|)} {2598#(<= main_~n~0 1)} #154#return; {2573#false} is VALID [2022-04-28 10:42:31,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume true; {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:31,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~space > 0); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:31,834 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-28 10:42:31,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {2617#(<= 2 |downsweep_#in~n|)} assume !(~right~1 < ~n); {2617#(<= 2 |downsweep_#in~n|)} is VALID [2022-04-28 10:42:31,836 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-28 10:42:31,836 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-28 10:42:31,837 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-28 10:42:31,838 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-28 10:42:31,838 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-28 10:42:31,840 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2739#(<= |upsweep_#in~n| 1)} {2572#true} #152#return; {2598#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:31,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {2739#(<= |upsweep_#in~n| 1)} assume true; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:31,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {2739#(<= |upsweep_#in~n| 1)} #res := ~space~0; {2739#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:31,842 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-28 10:42:31,842 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-28 10:42:31,842 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-28 10:42:31,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(~i~1 < ~n~0); {2572#true} is VALID [2022-04-28 10:42:31,842 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-28 10:42:31,843 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-28 10:42:31,843 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-28 10:42:31,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2572#true} {2572#true} #150#return; {2572#true} is VALID [2022-04-28 10:42:31,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-28 10:42:31,843 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-28 10:42:31,843 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-28 10:42:31,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2572#true} {2572#true} #148#return; {2572#true} is VALID [2022-04-28 10:42:31,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2572#true} is VALID [2022-04-28 10:42:31,844 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-28 10:42:31,844 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-28 10:42:31,844 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2572#true} {2572#true} #146#return; {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L272 TraceCheckUtils]: 18: Hoare triple {2572#true} call assume_abort_if_not(#t~ret14); {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {2572#true} is VALID [2022-04-28 10:42:31,844 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #144#return; {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {2572#true} is VALID [2022-04-28 10:42:31,845 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-28 10:42:31,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} ~x := #in~x; {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {2572#true} call #t~ret14 := is_pow2(~n~0); {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2572#true} {2572#true} #142#return; {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume !(0 == ~cond); {2572#true} is VALID [2022-04-28 10:42:31,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#true} ~cond := #in~cond; {2572#true} is VALID [2022-04-28 10:42:31,845 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-28 10:42:31,846 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-28 10:42:31,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2022-04-28 10:42:31,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #160#return; {2572#true} is VALID [2022-04-28 10:42:31,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-04-28 10:42:31,846 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-28 10:42:31,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2022-04-28 10:42:31,846 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-28 10:42:31,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007473088] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:31,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:42:31,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 18 [2022-04-28 10:42:31,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:31,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1833245184] [2022-04-28 10:42:31,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1833245184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:31,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:31,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:42:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958268468] [2022-04-28 10:42:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:31,850 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-28 10:42:31,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:31,850 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-28 10:42:31,902 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-28 10:42:31,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:42:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:31,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:42:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:42:31,903 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-28 10:42:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:43,284 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-04-28 10:42:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:42:43,284 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-28 10:42:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:43,285 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-28 10:42:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-28 10:42:43,287 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-28 10:42:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-04-28 10:42:43,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 99 transitions. [2022-04-28 10:42:43,377 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-28 10:42:43,379 INFO L225 Difference]: With dead ends: 93 [2022-04-28 10:42:43,379 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:42:43,380 INFO L412 NwaCegarLoop]: 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-28 10:42:43,380 INFO L413 NwaCegarLoop]: 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-28 10:42:43,381 INFO L414 NwaCegarLoop]: 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-28 10:42:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:42:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 10:42:43,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:43,452 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-28 10:42:43,453 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-28 10:42:43,453 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-28 10:42:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:43,458 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:42:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:42:43,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:43,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:43,460 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-28 10:42:43,460 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-28 10:42:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:43,464 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 10:42:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:42:43,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:43,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:43,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:43,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:43,466 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-28 10:42:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-04-28 10:42:43,469 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 60 [2022-04-28 10:42:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:43,469 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-04-28 10:42:43,469 INFO L496 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-28 10:42:43,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 94 transitions. [2022-04-28 10:42:43,615 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-28 10:42:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-04-28 10:42:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 10:42:43,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:43,616 INFO L195 NwaCegarLoop]: 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-28 10:42:43,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:42:43,819 WARN L477 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-28 10:42:43,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 1 times [2022-04-28 10:42:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:43,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918610987] [2022-04-28 10:42:43,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:42:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 589581770, now seen corresponding path program 2 times [2022-04-28 10:42:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261783404] [2022-04-28 10:42:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,926 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-28 10:42:43,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-28 10:42:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:42:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:43,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:43,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-28 10:42:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:42:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-28 10:42:43,939 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-28 10:42:43,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-28 10:42:43,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,939 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-28 10:42:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:42:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:43,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:43,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-28 10:42:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:42:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,953 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-28 10:42:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-28 10:42:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:42:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,958 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-28 10:42:43,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-28 10:42:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:42:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,985 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-28 10:42:43,986 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-28 10:42:43,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-28 10:42:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-28 10:42:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:43,995 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-28 10:42:43,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-28 10:42:43,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-28 10:42:43,996 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-28 10:42:43,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-28 10:42:43,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,996 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-28 10:42:43,997 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-28 10:42:43,997 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-28 10:42:43,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-28 10:42:43,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-28 10:42:43,997 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-28 10:42:43,997 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-28 10:42:43,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:43,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-28 10:42:43,998 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-28 10:42:43,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-28 10:42:43,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:43,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:43,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:43,999 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-28 10:42:43,999 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-28 10:42:44,000 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-28 10:42:44,000 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-28 10:42:44,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,000 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-28 10:42:44,001 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-28 10:42:44,002 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-28 10:42:44,002 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-28 10:42:44,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,002 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-28 10:42:44,002 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-28 10:42:44,003 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-28 10:42:44,003 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-28 10:42:44,004 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-28 10:42:44,005 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-28 10:42:44,005 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-28 10:42:44,005 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-28 10:42:44,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {3538#(<= (+ upsweep_~left~0 2) upsweep_~n)} assume !(~left~0 < ~n); {3495#false} is VALID [2022-04-28 10:42:44,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {3495#false} ~space~0 := 2 * ~space~0; {3495#false} is VALID [2022-04-28 10:42:44,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {3495#false} assume !(~space~0 < ~n); {3495#false} is VALID [2022-04-28 10:42:44,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {3495#false} #res := ~space~0; {3495#false} is VALID [2022-04-28 10:42:44,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-28 10:42:44,006 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3495#false} {3520#(<= 1 main_~n~0)} #152#return; {3495#false} is VALID [2022-04-28 10:42:44,007 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-28 10:42:44,007 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-28 10:42:44,007 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-28 10:42:44,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-28 10:42:44,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-28 10:42:44,007 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-28 10:42:44,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-28 10:42:44,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,007 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-28 10:42:44,008 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-28 10:42:44,008 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-28 10:42:44,008 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-28 10:42:44,008 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-28 10:42:44,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-28 10:42:44,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-28 10:42:44,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-28 10:42:44,008 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-28 10:42:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:44,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261783404] [2022-04-28 10:42:44,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261783404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:44,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051048102] [2022-04-28 10:42:44,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:44,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:44,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:44,010 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-28 10:42:44,047 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-28 10:42:44,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:42:44,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:44,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:42:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:44,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:44,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-28 10:42:44,367 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-28 10:42:44,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-28 10:42:44,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-28 10:42:44,368 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-28 10:42:44,368 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-28 10:42:44,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-28 10:42:44,368 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-28 10:42:44,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-28 10:42:44,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-28 10:42:44,369 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-28 10:42:44,369 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-28 10:42:44,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-28 10:42:44,369 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-28 10:42:44,369 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-28 10:42:44,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-28 10:42:44,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,370 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-28 10:42:44,370 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-28 10:42:44,370 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-28 10:42:44,371 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-28 10:42:44,371 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-28 10:42:44,371 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-28 10:42:44,372 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-28 10:42:44,372 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-28 10:42:44,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~left~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,373 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-28 10:42:44,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~space~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,374 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3663#(< 1 |upsweep_#in~n|)} {3652#(<= main_~n~0 1)} #152#return; {3495#false} is VALID [2022-04-28 10:42:44,375 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-28 10:42:44,375 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-28 10:42:44,375 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-28 10:42:44,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {3495#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3495#false} is VALID [2022-04-28 10:42:44,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {3495#false} assume !(~right~1 < ~n); {3495#false} is VALID [2022-04-28 10:42:44,375 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-28 10:42:44,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {3495#false} assume !(~space > 0); {3495#false} is VALID [2022-04-28 10:42:44,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {3495#false} assume true; {3495#false} is VALID [2022-04-28 10:42:44,375 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3495#false} {3495#false} #154#return; {3495#false} is VALID [2022-04-28 10:42:44,375 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-28 10:42:44,375 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-28 10:42:44,375 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-28 10:42:44,375 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-28 10:42:44,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-28 10:42:44,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-28 10:42:44,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-28 10:42:44,376 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-28 10:42:44,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:42:44,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-04-28 10:42:44,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {3495#false} assume 0 == ~cond; {3495#false} is VALID [2022-04-28 10:42:44,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {3495#false} ~cond := #in~cond; {3495#false} is VALID [2022-04-28 10:42:44,778 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-28 10:42:44,778 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-28 10:42:44,778 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-28 10:42:44,778 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-28 10:42:44,778 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3494#true} {3495#false} #154#return; {3495#false} is VALID [2022-04-28 10:42:44,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {3494#true} assume !(~space > 0); {3494#true} is VALID [2022-04-28 10:42:44,778 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-28 10:42:44,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {3494#true} assume !(~right~1 < ~n); {3494#true} is VALID [2022-04-28 10:42:44,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {3494#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {3494#true} is VALID [2022-04-28 10:42:44,779 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-28 10:42:44,779 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-28 10:42:44,779 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-28 10:42:44,780 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3663#(< 1 |upsweep_#in~n|)} {3652#(<= main_~n~0 1)} #152#return; {3495#false} is VALID [2022-04-28 10:42:44,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume true; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(< 1 |upsweep_#in~n|)} #res := ~space~0; {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~space~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,781 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-28 10:42:44,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {3663#(< 1 |upsweep_#in~n|)} assume !(~left~0 < ~n); {3663#(< 1 |upsweep_#in~n|)} is VALID [2022-04-28 10:42:44,782 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-28 10:42:44,783 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-28 10:42:44,783 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-28 10:42:44,783 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-28 10:42:44,784 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-28 10:42:44,784 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-28 10:42:44,785 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-28 10:42:44,785 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3494#true} {3494#true} #150#return; {3494#true} is VALID [2022-04-28 10:42:44,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-28 10:42:44,785 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-28 10:42:44,785 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-28 10:42:44,785 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3494#true} {3494#true} #148#return; {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {3494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3494#true} is VALID [2022-04-28 10:42:44,786 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-28 10:42:44,786 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-28 10:42:44,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3494#true} {3494#true} #146#return; {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:44,786 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#true} call assume_abort_if_not(#t~ret14); {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3494#true} {3494#true} #144#return; {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {3494#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {3494#true} is VALID [2022-04-28 10:42:44,787 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-28 10:42:44,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {3494#true} ~x := #in~x; {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {3494#true} call #t~ret14 := is_pow2(~n~0); {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3494#true} {3494#true} #142#return; {3494#true} is VALID [2022-04-28 10:42:44,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {3494#true} assume !(0 == ~cond); {3494#true} is VALID [2022-04-28 10:42:44,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#true} ~cond := #in~cond; {3494#true} is VALID [2022-04-28 10:42:44,788 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-28 10:42:44,788 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-28 10:42:44,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {3494#true} call #t~ret20 := main(); {3494#true} is VALID [2022-04-28 10:42:44,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3494#true} {3494#true} #160#return; {3494#true} is VALID [2022-04-28 10:42:44,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} assume true; {3494#true} is VALID [2022-04-28 10:42:44,788 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-28 10:42:44,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2022-04-28 10:42:44,789 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-28 10:42:44,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051048102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:42:44,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:42:44,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:42:44,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918610987] [2022-04-28 10:42:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918610987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:44,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:44,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:42:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789965194] [2022-04-28 10:42:44,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:44,790 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-28 10:42:44,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:44,791 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-28 10:42:44,840 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-28 10:42:44,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:42:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:42:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:42:44,842 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-28 10:42:46,975 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-28 10:42:49,129 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-28 10:42:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:50,044 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-28 10:42:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:42:50,045 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-28 10:42:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:50,045 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-28 10:42:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 10:42:50,047 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-28 10:42:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 10:42:50,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 10:42:50,148 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-28 10:42:50,150 INFO L225 Difference]: With dead ends: 125 [2022-04-28 10:42:50,150 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 10:42:50,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:42:50,151 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 39 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:42:50,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 54 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 230 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 10:42:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 10:42:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-28 10:42:50,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:50,228 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-28 10:42:50,229 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-28 10:42:50,229 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-28 10:42:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:50,232 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 10:42:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 10:42:50,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:50,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:50,233 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-28 10:42:50,233 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-28 10:42:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:50,236 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 10:42:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 10:42:50,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:50,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:50,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:50,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:50,237 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-28 10:42:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2022-04-28 10:42:50,239 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 62 [2022-04-28 10:42:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:50,240 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2022-04-28 10:42:50,240 INFO L496 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-28 10:42:50,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 95 transitions. [2022-04-28 10:42:50,378 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-28 10:42:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-28 10:42:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 10:42:50,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:50,379 INFO L195 NwaCegarLoop]: 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-28 10:42:50,395 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-28 10:42:50,579 WARN L477 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-28 10:42:50,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 1 times [2022-04-28 10:42:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538098986] [2022-04-28 10:42:50,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:42:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 2 times [2022-04-28 10:42:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:50,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860886175] [2022-04-28 10:42:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,698 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-28 10:42:50,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-28 10:42:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:42:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-28 10:42:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:42:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-28 10:42:50,709 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-28 10:42:50,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-28 10:42:50,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,709 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-28 10:42:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:42:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-28 10:42:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:42:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,728 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-28 10:42:50,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-28 10:42:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:42:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,743 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-28 10:42:50,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-28 10:42:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:42:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,754 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-28 10:42:50,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-28 10:42:50,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-28 10:42:50,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,755 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 10:42:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,760 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-28 10:42:50,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-28 10:42:50,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 10:42:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,766 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-28 10:42:50,766 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-28 10:42:50,766 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-28 10:42:50,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-28 10:42:50,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-28 10:42:50,767 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-28 10:42:50,767 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-28 10:42:50,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-28 10:42:50,767 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-28 10:42:50,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-28 10:42:50,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,768 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-28 10:42:50,768 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-28 10:42:50,769 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-28 10:42:50,769 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-28 10:42:50,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,769 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-28 10:42:50,770 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-28 10:42:50,770 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-28 10:42:50,770 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-28 10:42:50,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,771 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-28 10:42:50,771 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-28 10:42:50,771 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-28 10:42:50,772 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-28 10:42:50,772 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-28 10:42:50,773 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-28 10:42:50,773 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-28 10:42:50,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {4507#true} assume !(~space~0 < ~n); {4507#true} is VALID [2022-04-28 10:42:50,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {4507#true} #res := ~space~0; {4507#true} is VALID [2022-04-28 10:42:50,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,774 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:50,774 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-28 10:42:50,775 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-28 10:42:50,775 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-28 10:42:50,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-28 10:42:50,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,776 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:50,777 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-28 10:42:50,777 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-28 10:42:50,778 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-28 10:42:50,778 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-28 10:42:50,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:50,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:50,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:50,779 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-28 10:42:50,780 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-28 10:42:50,780 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-28 10:42:50,780 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-28 10:42:50,780 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-28 10:42:50,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-28 10:42:50,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-28 10:42:50,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-28 10:42:50,781 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-28 10:42:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860886175] [2022-04-28 10:42:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860886175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86772710] [2022-04-28 10:42:50,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:42:50,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:50,783 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-28 10:42:50,814 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-28 10:42:50,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:42:50,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:50,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:42:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:50,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:51,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {4507#true} call ULTIMATE.init(); {4507#true} is VALID [2022-04-28 10:42:51,225 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-28 10:42:51,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4507#true} {4507#true} #160#return; {4507#true} is VALID [2022-04-28 10:42:51,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {4507#true} call #t~ret20 := main(); {4507#true} is VALID [2022-04-28 10:42:51,225 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-28 10:42:51,226 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-28 10:42:51,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:51,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:51,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4507#true} {4507#true} #142#return; {4507#true} is VALID [2022-04-28 10:42:51,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {4507#true} call #t~ret14 := is_pow2(~n~0); {4507#true} is VALID [2022-04-28 10:42:51,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#true} ~x := #in~x; {4507#true} is VALID [2022-04-28 10:42:51,226 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-28 10:42:51,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {4507#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4507#true} {4507#true} #144#return; {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {4507#true} call assume_abort_if_not(#t~ret14); {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,227 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4507#true} {4507#true} #146#return; {4507#true} is VALID [2022-04-28 10:42:51,227 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-28 10:42:51,228 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-28 10:42:51,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-28 10:42:51,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,228 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4507#true} {4507#true} #148#return; {4507#true} is VALID [2022-04-28 10:42:51,228 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-28 10:42:51,228 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-28 10:42:51,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {4507#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4507#true} is VALID [2022-04-28 10:42:51,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,228 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4507#true} {4507#true} #150#return; {4507#true} is VALID [2022-04-28 10:42:51,228 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-28 10:42:51,229 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-28 10:42:51,229 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-28 10:42:51,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {4507#true} assume !(~i~1 < ~n~0); {4507#true} is VALID [2022-04-28 10:42:51,229 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-28 10:42:51,231 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-28 10:42:51,232 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-28 10:42:51,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {4673#(<= |upsweep_#in~n| 1)} #res := ~space~0; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:51,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {4673#(<= |upsweep_#in~n| 1)} assume true; {4673#(<= |upsweep_#in~n| 1)} is VALID [2022-04-28 10:42:51,233 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4673#(<= |upsweep_#in~n| 1)} {4507#true} #152#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:51,234 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-28 10:42:51,234 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-28 10:42:51,234 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-28 10:42:51,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {4507#true} assume !(~space > 0); {4507#true} is VALID [2022-04-28 10:42:51,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,235 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4507#true} {4533#(<= main_~n~0 1)} #154#return; {4533#(<= main_~n~0 1)} is VALID [2022-04-28 10:42:51,235 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-28 10:42:51,236 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-28 10:42:51,236 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-28 10:42:51,236 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-28 10:42:51,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {4507#true} ~cond := #in~cond; {4507#true} is VALID [2022-04-28 10:42:51,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {4507#true} assume !(0 == ~cond); {4507#true} is VALID [2022-04-28 10:42:51,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#true} assume true; {4507#true} is VALID [2022-04-28 10:42:51,237 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-28 10:42:51,237 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-28 10:42:51,238 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-28 10:42:51,239 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-28 10:42:51,239 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-28 10:42:51,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {4508#false} ~cond := #in~cond; {4508#false} is VALID [2022-04-28 10:42:51,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {4508#false} assume 0 == ~cond; {4508#false} is VALID [2022-04-28 10:42:51,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {4508#false} assume !false; {4508#false} is VALID [2022-04-28 10:42:51,239 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-28 10:42:51,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:42:51,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86772710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:51,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:42:51,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2022-04-28 10:42:51,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:51,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538098986] [2022-04-28 10:42:51,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538098986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:51,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:51,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:42:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151967473] [2022-04-28 10:42:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:51,241 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-28 10:42:51,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:51,241 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-28 10:42:51,281 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-28 10:42:51,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:42:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:42:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:42:51,282 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-28 10:43:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:02,636 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-28 10:43:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:43:02,637 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-28 10:43:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:02,637 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-28 10:43:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 10:43:02,640 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-28 10:43:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 10:43:02,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-28 10:43:02,708 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-28 10:43:02,710 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:43:02,710 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 10:43:02,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:43:02,711 INFO L413 NwaCegarLoop]: 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-28 10:43:02,711 INFO L414 NwaCegarLoop]: 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-28 10:43:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 10:43:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-28 10:43:02,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:02,765 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-28 10:43:02,765 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-28 10:43:02,765 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-28 10:43:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:02,767 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-28 10:43:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-28 10:43:02,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:02,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:02,768 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-28 10:43:02,768 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-28 10:43:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:02,771 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-28 10:43:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-04-28 10:43:02,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:02,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:02,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:02,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:02,772 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-28 10:43:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-04-28 10:43:02,774 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 64 [2022-04-28 10:43:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:02,774 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-04-28 10:43:02,774 INFO L496 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-28 10:43:02,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 80 transitions. [2022-04-28 10:43:02,885 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-28 10:43:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-04-28 10:43:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 10:43:02,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:02,886 INFO L195 NwaCegarLoop]: 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-28 10:43:02,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:43:03,086 WARN L477 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-28 10:43:03,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 1 times [2022-04-28 10:43:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:03,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929885167] [2022-04-28 10:43:03,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 2 times [2022-04-28 10:43:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:03,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292371553] [2022-04-28 10:43:03,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:03,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,155 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-28 10:43:03,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-28 10:43:03,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:43:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-28 10:43:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-28 10:43:03,163 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-28 10:43:03,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-28 10:43:03,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,164 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-28 10:43:03,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:43:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-28 10:43:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:43:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,177 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-28 10:43:03,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-28 10:43:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:43:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,181 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-28 10:43:03,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-28 10:43:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-28 10:43:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,244 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-28 10:43:03,245 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-28 10:43:03,245 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-28 10:43:03,246 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-28 10:43:03,246 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-28 10:43:03,247 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-28 10:43:03,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,249 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-28 10:43:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 10:43:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,257 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-28 10:43:03,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-28 10:43:03,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-28 10:43:03,258 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-28 10:43:03,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-28 10:43:03,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,271 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-28 10:43:03,272 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-28 10:43:03,272 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-28 10:43:03,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-28 10:43:03,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-28 10:43:03,272 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-28 10:43:03,272 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-28 10:43:03,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-28 10:43:03,273 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-28 10:43:03,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,273 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-28 10:43:03,273 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-28 10:43:03,274 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-28 10:43:03,274 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-28 10:43:03,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,275 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-28 10:43:03,275 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-28 10:43:03,275 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-28 10:43:03,275 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-28 10:43:03,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,276 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-28 10:43:03,276 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-28 10:43:03,276 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-28 10:43:03,277 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-28 10:43:03,277 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-28 10:43:03,278 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-28 10:43:03,278 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-28 10:43:03,279 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-28 10:43:03,279 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-28 10:43:03,279 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-28 10:43:03,280 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-28 10:43:03,280 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-28 10:43:03,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,282 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-28 10:43:03,282 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-28 10:43:03,282 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-28 10:43:03,282 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-28 10:43:03,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-28 10:43:03,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-28 10:43:03,282 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-28 10:43:03,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-28 10:43:03,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,282 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-28 10:43:03,282 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-28 10:43:03,282 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-28 10:43:03,283 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-28 10:43:03,283 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-28 10:43:03,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-28 10:43:03,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-28 10:43:03,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-28 10:43:03,283 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-28 10:43:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292371553] [2022-04-28 10:43:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292371553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637337161] [2022-04-28 10:43:03,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:03,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:03,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:03,285 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-28 10:43:03,285 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-28 10:43:03,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:03,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:03,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:43:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:03,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-28 10:43:03,590 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-28 10:43:03,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-28 10:43:03,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-28 10:43:03,590 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-28 10:43:03,590 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-28 10:43:03,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-28 10:43:03,591 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-28 10:43:03,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-28 10:43:03,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-28 10:43:03,592 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-28 10:43:03,592 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-28 10:43:03,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-28 10:43:03,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,592 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-28 10:43:03,592 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-28 10:43:03,593 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-28 10:43:03,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-28 10:43:03,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,593 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-28 10:43:03,593 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-28 10:43:03,594 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-28 10:43:03,594 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-28 10:43:03,595 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-28 10:43:03,595 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-28 10:43:03,595 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-28 10:43:03,596 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-28 10:43:03,596 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-28 10:43:03,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~left~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,596 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-28 10:43:03,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,598 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-28 10:43:03,598 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-28 10:43:03,598 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-28 10:43:03,599 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-28 10:43:03,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5256#false} is VALID [2022-04-28 10:43:03,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {5256#false} assume !(~right~1 < ~n); {5256#false} is VALID [2022-04-28 10:43:03,599 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-28 10:43:03,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {5256#false} assume !(~space > 0); {5256#false} is VALID [2022-04-28 10:43:03,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {5256#false} assume true; {5256#false} is VALID [2022-04-28 10:43:03,599 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5256#false} {5256#false} #154#return; {5256#false} is VALID [2022-04-28 10:43:03,599 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-28 10:43:03,599 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-28 10:43:03,599 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-28 10:43:03,599 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-28 10:43:03,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-28 10:43:03,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-28 10:43:03,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-28 10:43:03,600 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-28 10:43:03,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:03,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2022-04-28 10:43:03,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {5256#false} assume 0 == ~cond; {5256#false} is VALID [2022-04-28 10:43:03,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {5256#false} ~cond := #in~cond; {5256#false} is VALID [2022-04-28 10:43:03,938 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-28 10:43:03,938 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-28 10:43:03,938 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-28 10:43:03,938 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-28 10:43:03,938 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5255#true} {5256#false} #154#return; {5256#false} is VALID [2022-04-28 10:43:03,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {5255#true} assume !(~space > 0); {5255#true} is VALID [2022-04-28 10:43:03,938 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-28 10:43:03,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {5255#true} assume !(~right~1 < ~n); {5255#true} is VALID [2022-04-28 10:43:03,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {5255#true} is VALID [2022-04-28 10:43:03,939 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-28 10:43:03,939 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-28 10:43:03,939 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-28 10:43:03,946 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5302#(<= 2 |upsweep_#in~n|)} {5281#(<= main_~n~0 1)} #152#return; {5256#false} is VALID [2022-04-28 10:43:03,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume true; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} #res := ~space~0; {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~space~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,947 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-28 10:43:03,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {5302#(<= 2 |upsweep_#in~n|)} assume !(~left~0 < ~n); {5302#(<= 2 |upsweep_#in~n|)} is VALID [2022-04-28 10:43:03,948 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-28 10:43:03,948 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-28 10:43:03,949 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-28 10:43:03,949 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-28 10:43:03,949 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-28 10:43:03,950 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-28 10:43:03,950 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-28 10:43:03,950 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-28 10:43:03,950 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5255#true} {5255#true} #150#return; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-28 10:43:03,951 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-28 10:43:03,951 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-28 10:43:03,951 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5255#true} {5255#true} #148#return; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {5255#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5255#true} is VALID [2022-04-28 10:43:03,951 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-28 10:43:03,951 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-28 10:43:03,951 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5255#true} {5255#true} #146#return; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,951 INFO L272 TraceCheckUtils]: 18: Hoare triple {5255#true} call assume_abort_if_not(#t~ret14); {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {5255#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5255#true} {5255#true} #144#return; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {5255#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {5255#true} is VALID [2022-04-28 10:43:03,952 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-28 10:43:03,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#true} ~x := #in~x; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L272 TraceCheckUtils]: 11: Hoare triple {5255#true} call #t~ret14 := is_pow2(~n~0); {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5255#true} {5255#true} #142#return; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !(0 == ~cond); {5255#true} is VALID [2022-04-28 10:43:03,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {5255#true} ~cond := #in~cond; {5255#true} is VALID [2022-04-28 10:43:03,953 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-28 10:43:03,953 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-28 10:43:03,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret20 := main(); {5255#true} is VALID [2022-04-28 10:43:03,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #160#return; {5255#true} is VALID [2022-04-28 10:43:03,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2022-04-28 10:43:03,953 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-28 10:43:03,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2022-04-28 10:43:03,954 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-28 10:43:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637337161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:03,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 13 [2022-04-28 10:43:03,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929885167] [2022-04-28 10:43:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929885167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:03,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:03,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:43:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094491804] [2022-04-28 10:43:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:03,955 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-28 10:43:03,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:03,956 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-28 10:43:03,998 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-28 10:43:03,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:43:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:43:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:43:04,000 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-28 10:43:10,466 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-28 10:43:12,618 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-28 10:43:16,914 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-28 10:43:19,069 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-28 10:43:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,225 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-04-28 10:43:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:43:20,225 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-28 10:43:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:20,226 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-28 10:43:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-28 10:43:20,227 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-28 10:43:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-28 10:43:20,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-28 10:43:20,307 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-28 10:43:20,308 INFO L225 Difference]: With dead ends: 107 [2022-04-28 10:43:20,308 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 10:43:20,309 INFO L412 NwaCegarLoop]: 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-28 10:43:20,309 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 42 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 406 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:20,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 55 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 406 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-28 10:43:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 10:43:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-04-28 10:43:20,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:20,371 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-28 10:43:20,371 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-28 10:43:20,371 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-28 10:43:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,373 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-28 10:43:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-28 10:43:20,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:20,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:20,374 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-28 10:43:20,374 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-28 10:43:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,376 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-28 10:43:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-28 10:43:20,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:20,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:20,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:20,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:20,377 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-28 10:43:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-04-28 10:43:20,379 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 63 [2022-04-28 10:43:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:20,379 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-04-28 10:43:20,380 INFO L496 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-28 10:43:20,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 82 transitions. [2022-04-28 10:43:20,478 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-28 10:43:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-28 10:43:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 10:43:20,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:20,479 INFO L195 NwaCegarLoop]: 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-28 10:43:20,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:43:20,680 WARN L477 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-28 10:43:20,680 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 3 times [2022-04-28 10:43:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:20,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966789044] [2022-04-28 10:43:20,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 4 times [2022-04-28 10:43:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:20,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852215082] [2022-04-28 10:43:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,779 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-28 10:43:20,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-28 10:43:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:43:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:20,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:20,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-28 10:43:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-28 10:43:20,789 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-28 10:43:20,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-28 10:43:20,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,789 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-28 10:43:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:43:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:20,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:20,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-28 10:43:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:43:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,817 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-28 10:43:20,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-28 10:43:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:43:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,823 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-28 10:43:20,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-28 10:43:20,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:43:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,830 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-28 10:43:20,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-28 10:43:20,830 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-28 10:43:20,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:20,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-28 10:43:20,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:20,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-28 10:43:20,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,831 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-28 10:43:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:43:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,917 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-28 10:43:20,918 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-28 10:43:20,918 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-28 10:43:20,919 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-28 10:43:20,919 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-28 10:43:20,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-28 10:43:20,921 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-28 10:43:20,921 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-28 10:43:20,921 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-28 10:43:20,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-28 10:43:20,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-28 10:43:20,921 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-28 10:43:20,922 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-28 10:43:20,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-28 10:43:20,922 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-28 10:43:20,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-28 10:43:20,922 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-28 10:43:20,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:20,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:20,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,923 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-28 10:43:20,923 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-28 10:43:20,924 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-28 10:43:20,924 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-28 10:43:20,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,924 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-28 10:43:20,924 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-28 10:43:20,925 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-28 10:43:20,925 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-28 10:43:20,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,925 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-28 10:43:20,925 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-28 10:43:20,925 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-28 10:43:20,926 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-28 10:43:20,926 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-28 10:43:20,927 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-28 10:43:20,927 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-28 10:43:20,928 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-28 10:43:20,928 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-28 10:43:20,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-28 10:43:20,928 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-28 10:43:20,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:20,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-28 10:43:20,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:20,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-28 10:43:20,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:20,929 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-28 10:43:20,929 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-28 10:43:20,930 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-28 10:43:20,930 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-28 10:43:20,931 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-28 10:43:20,931 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-28 10:43:20,932 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-28 10:43:20,933 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-28 10:43:20,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-28 10:43:20,934 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-28 10:43:20,934 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-28 10:43:20,934 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-28 10:43:20,934 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-28 10:43:20,934 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-28 10:43:20,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-28 10:43:20,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-28 10:43:20,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-28 10:43:20,934 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-28 10:43:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852215082] [2022-04-28 10:43:20,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852215082] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139051487] [2022-04-28 10:43:20,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:43:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:20,936 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-28 10:43:20,937 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-28 10:43:21,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:43:21,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:21,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:43:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:21,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:21,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-28 10:43:21,468 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-28 10:43:21,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-28 10:43:21,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-28 10:43:21,468 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-28 10:43:21,469 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-28 10:43:21,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-28 10:43:21,469 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-28 10:43:21,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-28 10:43:21,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-28 10:43:21,470 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-28 10:43:21,470 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-28 10:43:21,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-28 10:43:21,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,471 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-28 10:43:21,471 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-28 10:43:21,471 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-28 10:43:21,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-28 10:43:21,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,471 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-28 10:43:21,479 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-28 10:43:21,480 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-28 10:43:21,481 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-28 10:43:21,481 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-28 10:43:21,482 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-28 10:43:21,482 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-28 10:43:21,482 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-28 10:43:21,482 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-28 10:43:21,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-28 10:43:21,482 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-28 10:43:21,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:21,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-28 10:43:21,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:21,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-28 10:43:21,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:21,483 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-28 10:43:21,484 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-28 10:43:21,484 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-28 10:43:21,491 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-28 10:43:21,492 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-28 10:43:21,493 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-28 10:43:21,494 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-28 10:43:21,494 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-28 10:43:21,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-28 10:43:21,495 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-28 10:43:21,496 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-28 10:43:21,496 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-28 10:43:21,496 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-28 10:43:21,496 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-28 10:43:21,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-28 10:43:21,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-28 10:43:21,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-28 10:43:21,496 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-28 10:43:21,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:22,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {6209#false} assume !false; {6209#false} is VALID [2022-04-28 10:43:22,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {6209#false} assume 0 == ~cond; {6209#false} is VALID [2022-04-28 10:43:22,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {6209#false} ~cond := #in~cond; {6209#false} is VALID [2022-04-28 10:43:22,969 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-28 10:43:22,969 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-28 10:43:22,969 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-28 10:43:22,969 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-28 10:43:22,970 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6257#(<= |downsweep_#in~n| 1)} {6234#(<= 2 main_~n~0)} #154#return; {6209#false} is VALID [2022-04-28 10:43:22,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(<= |downsweep_#in~n| 1)} assume true; {6257#(<= |downsweep_#in~n| 1)} is VALID [2022-04-28 10:43:22,971 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-28 10:43:22,972 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-28 10:43:22,973 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-28 10:43:22,974 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-28 10:43:22,975 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-28 10:43:22,975 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-28 10:43:22,975 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-28 10:43:22,976 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6208#true} {6234#(<= 2 main_~n~0)} #152#return; {6234#(<= 2 main_~n~0)} is VALID [2022-04-28 10:43:22,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {6208#true} #res := ~space~0; {6208#true} is VALID [2022-04-28 10:43:22,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {6208#true} assume !(~space~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:22,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {6208#true} ~space~0 := 2 * ~space~0; {6208#true} is VALID [2022-04-28 10:43:22,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {6208#true} assume !(~left~0 < ~n); {6208#true} is VALID [2022-04-28 10:43:22,977 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-28 10:43:22,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {6208#true} is VALID [2022-04-28 10:43:22,977 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-28 10:43:22,977 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-28 10:43:22,977 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-28 10:43:22,978 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-28 10:43:22,978 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-28 10:43:22,979 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-28 10:43:22,979 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-28 10:43:22,979 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-28 10:43:22,979 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6208#true} {6208#true} #150#return; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-28 10:43:22,980 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-28 10:43:22,980 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-28 10:43:22,980 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6208#true} {6208#true} #148#return; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {6208#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6208#true} is VALID [2022-04-28 10:43:22,980 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-28 10:43:22,980 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-28 10:43:22,980 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6208#true} {6208#true} #146#return; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:22,980 INFO L272 TraceCheckUtils]: 18: Hoare triple {6208#true} call assume_abort_if_not(#t~ret14); {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {6208#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6208#true} {6208#true} #144#return; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {6208#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {6208#true} is VALID [2022-04-28 10:43:22,981 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-28 10:43:22,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {6208#true} ~x := #in~x; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {6208#true} call #t~ret14 := is_pow2(~n~0); {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6208#true} {6208#true} #142#return; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#true} assume !(0 == ~cond); {6208#true} is VALID [2022-04-28 10:43:22,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#true} ~cond := #in~cond; {6208#true} is VALID [2022-04-28 10:43:22,981 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-28 10:43:22,981 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-28 10:43:22,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {6208#true} call #t~ret20 := main(); {6208#true} is VALID [2022-04-28 10:43:22,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6208#true} {6208#true} #160#return; {6208#true} is VALID [2022-04-28 10:43:22,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {6208#true} assume true; {6208#true} is VALID [2022-04-28 10:43:22,982 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-28 10:43:22,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {6208#true} call ULTIMATE.init(); {6208#true} is VALID [2022-04-28 10:43:22,982 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-28 10:43:22,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139051487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:22,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:22,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-28 10:43:22,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:22,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966789044] [2022-04-28 10:43:22,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966789044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:22,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:22,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:43:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216478259] [2022-04-28 10:43:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:22,984 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-28 10:43:22,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:22,985 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-28 10:43:23,031 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-28 10:43:23,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:43:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:43:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:43:23,032 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-28 10:43:27,428 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-28 10:43:33,876 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-28 10:43:35,991 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-28 10:43:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:41,975 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-28 10:43:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:43:41,975 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-28 10:43:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:41,976 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-28 10:43:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-28 10:43:41,977 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-28 10:43:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 95 transitions. [2022-04-28 10:43:41,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 95 transitions. [2022-04-28 10:43:42,077 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-28 10:43:42,078 INFO L225 Difference]: With dead ends: 95 [2022-04-28 10:43:42,078 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 10:43:42,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:43:42,079 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:42,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 62 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 601 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 10:43:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 10:43:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-04-28 10:43:42,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:42,175 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-28 10:43:42,175 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-28 10:43:42,176 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-28 10:43:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:42,179 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-28 10:43:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-28 10:43:42,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:42,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:42,180 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-28 10:43:42,180 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-28 10:43:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:42,182 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-28 10:43:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-28 10:43:42,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:42,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:42,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:42,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:42,183 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-28 10:43:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-04-28 10:43:42,184 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 65 [2022-04-28 10:43:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:42,185 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-04-28 10:43:42,185 INFO L496 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-28 10:43:42,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 86 transitions. [2022-04-28 10:43:42,343 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-28 10:43:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-04-28 10:43:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 10:43:42,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:42,344 INFO L195 NwaCegarLoop]: 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-28 10:43:42,361 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-28 10:43:42,544 WARN L477 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-28 10:43:42,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 1 times [2022-04-28 10:43:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:42,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356736615] [2022-04-28 10:43:42,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 2 times [2022-04-28 10:43:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:42,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755239898] [2022-04-28 10:43:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,464 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-28 10:43:43,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:43,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-28 10:43:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:43:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:43,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:43,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:43,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-28 10:43:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-28 10:43:43,474 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-28 10:43:43,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-28 10:43:43,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:43,475 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-28 10:43:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:43:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:43,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:43,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:43,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-28 10:43:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,547 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-28 10:43:43,548 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-28 10:43:43,549 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-28 10:43:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:43:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,590 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-28 10:43:43,591 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-28 10:43:43,593 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-28 10:43:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:43:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:43,736 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-28 10:43:43,737 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-28 10:43:43,738 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-28 10:43:43,739 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-28 10:43:43,739 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-28 10:43:43,739 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-28 10:43:43,740 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-28 10:43:43,740 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-28 10:43:43,742 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-28 10:43:43,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:43:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:49,515 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-28 10:43:49,517 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-28 10:43:49,523 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-28 10:43:49,528 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-28 10:43:49,530 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-28 10:43:49,533 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-28 10:43:49,535 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-28 10:43:49,588 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-28 10:43:49,590 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-28 10:43:49,590 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-28 10:43:49,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:49,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-28 10:43:49,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-28 10:43:49,590 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-28 10:43:49,590 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-28 10:43:49,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:49,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:49,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:49,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-28 10:43:49,591 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-28 10:43:49,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-28 10:43:49,591 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-28 10:43:49,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:49,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-28 10:43:49,593 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-28 10:43:49,594 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-28 10:43:49,595 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-28 10:43:49,595 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-28 10:43:49,597 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-28 10:43:49,597 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-28 10:43:49,598 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-28 10:43:49,599 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-28 10:43:49,599 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-28 10:43:49,601 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-28 10:43:49,601 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-28 10:43:49,602 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-28 10:43:49,603 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-28 10:43:49,603 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-28 10:43:49,604 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-28 10:43:49,605 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-28 10:43:49,605 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-28 10:43:49,606 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-28 10:43:49,606 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-28 10:43:49,607 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-28 10:43:49,607 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-28 10:43:49,608 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-28 10:43:49,608 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-28 10:43:49,608 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-28 10:43:49,609 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-28 10:43:49,610 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-28 10:43:49,611 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-28 10:43:49,613 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-28 10:43:49,614 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-28 10:43:49,615 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-28 10:43:49,621 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-28 10:43:49,623 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-28 10:43:49,625 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-28 10:43:49,627 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-28 10:43:49,629 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-28 10:43:49,670 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-28 10:43:49,673 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-28 10:43:49,677 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-28 10:43:49,678 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-28 10:43:49,678 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-28 10:43:49,679 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-28 10:43:49,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {7236#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7183#false} is VALID [2022-04-28 10:43:49,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-28 10:43:49,679 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-28 10:43:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755239898] [2022-04-28 10:43:49,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755239898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659776660] [2022-04-28 10:43:49,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:49,682 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-28 10:43:49,682 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-28 10:43:49,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:49,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:49,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 10:43:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:49,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:50,525 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-28 10:43:50,947 INFO L356 Elim1Store]: treesize reduction 151, result has 25.2 percent of original size [2022-04-28 10:43:50,947 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-28 10:43:52,390 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-28 10:43:52,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7182#true} is VALID [2022-04-28 10:43:52,539 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-28 10:43:52,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-28 10:43:52,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-28 10:43:52,539 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-28 10:43:52,540 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-28 10:43:52,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-28 10:43:52,540 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-28 10:43:52,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-28 10:43:52,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:52,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:52,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,541 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-28 10:43:52,541 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-28 10:43:52,541 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-28 10:43:52,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-28 10:43:52,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,542 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-28 10:43:52,543 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-28 10:43:52,543 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-28 10:43:52,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-28 10:43:52,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:52,544 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-28 10:43:52,544 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-28 10:43:52,545 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-28 10:43:52,545 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-28 10:43:52,546 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-28 10:43:52,546 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-28 10:43:52,546 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-28 10:43:52,547 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-28 10:43:52,547 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-28 10:43:52,547 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-28 10:43:52,548 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-28 10:43:52,548 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-28 10:43:52,549 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-28 10:43:52,549 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-28 10:43:52,549 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-28 10:43:52,550 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-28 10:43:52,550 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-28 10:43:52,551 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-28 10:43:52,551 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-28 10:43:52,552 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-28 10:43:52,553 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-28 10:43:52,562 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-28 10:43:52,566 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-28 10:43:52,571 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-28 10:43:52,576 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-28 10:43:52,580 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-28 10:43:52,582 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-28 10:43:52,584 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-28 10:43:52,584 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-28 10:43:52,584 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-28 10:43:52,585 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-28 10:43:52,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:52,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {7459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7183#false} is VALID [2022-04-28 10:43:52,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-28 10:43:52,586 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-28 10:43:52,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:53,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 10:43:53,769 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-28 10:43:53,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:53,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:53,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:53,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:53,959 INFO L356 Elim1Store]: treesize reduction 149, result has 55.4 percent of original size [2022-04-28 10:43:53,959 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-28 10:43:54,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 274 [2022-04-28 10:43:54,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:54,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:54,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:54,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 10:43:54,363 INFO L356 Elim1Store]: treesize reduction 94, result has 16.8 percent of original size [2022-04-28 10:43:54,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 136 [2022-04-28 10:43:54,428 INFO L356 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2022-04-28 10:43:54,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2022-04-28 10:43:55,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-04-28 10:43:55,515 INFO L356 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2022-04-28 10:43:55,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 1 [2022-04-28 10:43:56,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {7183#false} assume !false; {7183#false} is VALID [2022-04-28 10:43:56,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {7459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7183#false} is VALID [2022-04-28 10:43:56,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:56,398 INFO L272 TraceCheckUtils]: 62: Hoare triple {7234#(= |check_#t~mem11| check_~sum~0)} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {7455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:56,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {7478#(or (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (not (< check_~i~0 check_~n)))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {7234#(= |check_#t~mem11| check_~sum~0)} is VALID [2022-04-28 10:43:56,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {7482#(or (= (select (select |#memory_int| |check_#in~a.base|) |check_#in~a.offset|) 0) (<= |check_#in~n| 0))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {7478#(or (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (not (< check_~i~0 check_~n)))} is VALID [2022-04-28 10:43:56,400 INFO L272 TraceCheckUtils]: 59: Hoare triple {7486#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= main_~n~0 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {7482#(or (= (select (select |#memory_int| |check_#in~a.base|) |check_#in~a.offset|) 0) (<= |check_#in~n| 0))} is VALID [2022-04-28 10:43:56,402 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} {7490#(or (and (<= main_~n~0 (* 2 (div main_~space~1 2))) (or (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2))) (= (+ (- 4) (* (div main_~space~1 2) 4)) 0))) (<= (div main_~space~1 2) 0))} #154#return; {7486#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0) (<= main_~n~0 0))} is VALID [2022-04-28 10:43:56,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} assume true; {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} assume !(~space > 0); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} assume !(~right~1 < ~n); {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {7510#(or (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4)) v_ArrVal_268) (+ downsweep_~a.offset (* downsweep_~right~1 4) (* downsweep_~space (- 4))) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)) (not (< downsweep_~right~1 downsweep_~n)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {7494#(or (= 0 (select (select |#memory_int| |downsweep_#in~a.base|) |downsweep_#in~a.offset|)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {7514#(or (not (< 0 downsweep_~space)) (not (< (* 2 downsweep_~space) (+ downsweep_~n 1))) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))) (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8)) v_ArrVal_268) (+ (* downsweep_~space 4) downsweep_~a.offset (- 4)) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {7510#(or (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4)) v_ArrVal_268) (+ downsweep_~a.offset (* downsweep_~right~1 4) (* downsweep_~space (- 4))) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)) (not (< downsweep_~right~1 downsweep_~n)) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))))} is VALID [2022-04-28 10:43:56,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {7514#(or (not (< 0 downsweep_~space)) (not (< (* 2 downsweep_~space) (+ downsweep_~n 1))) (and (or (< (* 2 (div |downsweep_#in~space| 2)) |downsweep_#in~n|) (not (= (* (div |downsweep_#in~space| 2) 4) 4))) (< (* 2 (div |downsweep_#in~space| 2)) (+ |downsweep_#in~n| 1)) (not (<= (div |downsweep_#in~space| 2) 0))) (forall ((v_ArrVal_268 Int)) (= (select (select (store |#memory_int| downsweep_~a.base (store (store (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8)) v_ArrVal_268) (+ (* downsweep_~space 4) downsweep_~a.offset (- 4)) (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (- 4) (* downsweep_~space 8))))) |downsweep_#in~a.base|) |downsweep_#in~a.offset|) 0)))} is VALID [2022-04-28 10:43:56,416 INFO L272 TraceCheckUtils]: 50: Hoare triple {7490#(or (and (<= main_~n~0 (* 2 (div main_~space~1 2))) (or (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2))) (= (+ (- 4) (* (div main_~space~1 2) 4)) 0))) (<= (div main_~space~1 2) 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {7182#true} is VALID [2022-04-28 10:43:56,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {7521#(or (<= (div |main_#t~ret19| 2) 0) (and (or (= 0 (+ (* (div |main_#t~ret19| 2) 4) (- 4))) (<= (+ main_~n~0 1) (* (div |main_#t~ret19| 2) 2))) (<= main_~n~0 (* (div |main_#t~ret19| 2) 2))))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {7490#(or (and (<= main_~n~0 (* 2 (div main_~space~1 2))) (or (<= (+ main_~n~0 1) (* 2 (div main_~space~1 2))) (= (+ (- 4) (* (div main_~space~1 2) 4)) 0))) (<= (div main_~space~1 2) 0))} is VALID [2022-04-28 10:43:56,418 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7528#(or (<= (div |upsweep_#res| 2) 0) (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (+ (- 4) (* (div |upsweep_#res| 2) 4)) 0) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))))} {7182#true} #152#return; {7521#(or (<= (div |main_#t~ret19| 2) 0) (and (or (= 0 (+ (* (div |main_#t~ret19| 2) 4) (- 4))) (<= (+ main_~n~0 1) (* (div |main_#t~ret19| 2) 2))) (<= main_~n~0 (* (div |main_#t~ret19| 2) 2))))} is VALID [2022-04-28 10:43:56,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {7528#(or (<= (div |upsweep_#res| 2) 0) (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (+ (- 4) (* (div |upsweep_#res| 2) 4)) 0) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))))} assume true; {7528#(or (<= (div |upsweep_#res| 2) 0) (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (+ (- 4) (* (div |upsweep_#res| 2) 4)) 0) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))))} is VALID [2022-04-28 10:43:56,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {7535#(or (<= (div upsweep_~space~0 2) 0) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (= (+ (* (div upsweep_~space~0 2) 4) (- 4)) 0) (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))))))} #res := ~space~0; {7528#(or (<= (div |upsweep_#res| 2) 0) (and (<= |upsweep_#in~n| (* (div |upsweep_#res| 2) 2)) (or (= (+ (- 4) (* (div |upsweep_#res| 2) 4)) 0) (<= (+ |upsweep_#in~n| 1) (* (div |upsweep_#res| 2) 2)))))} is VALID [2022-04-28 10:43:56,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {7539#(or (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (= (+ (* (div upsweep_~space~0 2) 4) (- 4)) 0) (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))))))} assume !(~space~0 < ~n); {7535#(or (<= (div upsweep_~space~0 2) 0) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (= (+ (* (div upsweep_~space~0 2) 4) (- 4)) 0) (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))))))} is VALID [2022-04-28 10:43:56,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} ~space~0 := 2 * ~space~0; {7539#(or (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0) (and (<= |upsweep_#in~n| (* 2 (div upsweep_~space~0 2))) (or (= (+ (* (div upsweep_~space~0 2) 4) (- 4)) 0) (<= (+ |upsweep_#in~n| 1) (* 2 (div upsweep_~space~0 2))))))} is VALID [2022-04-28 10:43:56,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} assume !(~left~0 < ~n); {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} is VALID [2022-04-28 10:43:56,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} is VALID [2022-04-28 10:43:56,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {7182#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {7543#(or (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n) (and (<= |upsweep_#in~n| (* 2 upsweep_~space~0)) (or (<= (+ |upsweep_#in~n| 1) (* 2 upsweep_~space~0)) (= (+ (* (div (* 2 upsweep_~space~0) 2) 4) (- 4)) 0))))} is VALID [2022-04-28 10:43:56,426 INFO L272 TraceCheckUtils]: 39: Hoare triple {7182#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {7182#true} assume !(~i~1 < ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {7182#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {7182#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {7182#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {7182#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {7182#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7182#true} {7182#true} #150#return; {7182#true} is VALID [2022-04-28 10:43:56,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L272 TraceCheckUtils]: 29: Hoare triple {7182#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {7182#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7182#true} {7182#true} #148#return; {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {7182#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L272 TraceCheckUtils]: 24: Hoare triple {7182#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {7182#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7182#true} {7182#true} #146#return; {7182#true} is VALID [2022-04-28 10:43:56,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {7182#true} call assume_abort_if_not(#t~ret14); {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {7182#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7182#true} {7182#true} #144#return; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {7182#true} is VALID [2022-04-28 10:43:56,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-28 10:43:56,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#true} ~x := #in~x; {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {7182#true} call #t~ret14 := is_pow2(~n~0); {7182#true} is VALID [2022-04-28 10:43:56,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#true} {7182#true} #142#return; {7182#true} is VALID [2022-04-28 10:43:56,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#true} assume !(0 == ~cond); {7182#true} is VALID [2022-04-28 10:43:56,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#true} ~cond := #in~cond; {7182#true} is VALID [2022-04-28 10:43:56,429 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-28 10:43:56,429 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-28 10:43:56,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#true} call #t~ret20 := main(); {7182#true} is VALID [2022-04-28 10:43:56,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#true} {7182#true} #160#return; {7182#true} is VALID [2022-04-28 10:43:56,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#true} assume true; {7182#true} is VALID [2022-04-28 10:43:56,429 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-28 10:43:56,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {7182#true} call ULTIMATE.init(); {7182#true} is VALID [2022-04-28 10:43:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:43:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659776660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:56,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:56,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 17] total 59 [2022-04-28 10:43:56,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:56,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356736615] [2022-04-28 10:43:56,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356736615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:43:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999080889] [2022-04-28 10:43:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2022-04-28 10:43:56,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:56,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 10:43:56,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:56,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:43:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:43:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3209, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:43:56,552 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 10:44:01,266 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-28 10:44:09,835 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-28 10:44:11,986 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-28 10:44:14,131 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-28 10:44:18,423 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-28 10:44:20,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 10:44:24,875 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-28 10:44:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:33,125 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-04-28 10:44:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:44:33,125 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2022-04-28 10:44:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 10:44:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-28 10:44:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 10:44:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 114 transitions. [2022-04-28 10:44:33,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 114 transitions. [2022-04-28 10:44:33,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:33,306 INFO L225 Difference]: With dead ends: 110 [2022-04-28 10:44:33,306 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 10:44:33,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=551, Invalid=6421, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 10:44:33,308 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 211 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 188 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:33,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 72 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1269 Invalid, 7 Unknown, 0 Unchecked, 17.6s Time] [2022-04-28 10:44:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 10:44:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-04-28 10:44:33,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:33,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:44:33,499 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:44:33,499 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:44:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:33,502 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-28 10:44:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-28 10:44:33,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:33,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 108 states. [2022-04-28 10:44:33,503 INFO L87 Difference]: Start difference. First operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 108 states. [2022-04-28 10:44:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:33,506 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-28 10:44:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-28 10:44:33,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:33,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:33,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:33,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:44:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-04-28 10:44:33,509 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 66 [2022-04-28 10:44:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:33,509 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-04-28 10:44:33,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 10:44:33,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 107 transitions. [2022-04-28 10:44:33,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-04-28 10:44:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 10:44:33,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:33,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:33,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:33,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:44:33,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1470293173, now seen corresponding path program 3 times [2022-04-28 10:44:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:33,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761027744] [2022-04-28 10:44:33,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1470293173, now seen corresponding path program 4 times [2022-04-28 10:44:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:33,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016273055] [2022-04-28 10:44:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-28 10:44:34,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-28 10:44:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:44:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-28 10:44:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:44:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-28 10:44:34,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-28 10:44:34,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-28 10:44:34,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,043 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-28 10:44:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:44:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-28 10:44:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:44:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-28 10:44:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:44:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-28 10:44:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:44:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,073 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:44:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} is VALID [2022-04-28 10:44:34,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} is VALID [2022-04-28 10:44:34,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,159 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-28 10:44:34,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:34,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {8386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-28 10:44:34,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-28 10:44:34,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-28 10:44:34,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-28 10:44:34,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,161 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-28 10:44:34,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,167 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:34,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,167 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-28 10:44:34,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,168 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:34,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,168 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-28 10:44:34,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8364#(= main_~i~1 0)} is VALID [2022-04-28 10:44:34,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {8364#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8364#(= main_~i~1 0)} is VALID [2022-04-28 10:44:34,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {8364#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:34,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:34,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-28 10:44:34,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {8366#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,172 INFO L272 TraceCheckUtils]: 39: Hoare triple {8367#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,173 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {8367#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,175 INFO L272 TraceCheckUtils]: 50: Hoare triple {8367#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8387#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:34,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {8387#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} is VALID [2022-04-28 10:44:34,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n| (* 2 downsweep_~space)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} is VALID [2022-04-28 10:44:34,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {8390#(<= (+ downsweep_~n 3) (+ downsweep_~right~1 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,181 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-28 10:44:34,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-28 10:44:34,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-28 10:44:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:44:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:34,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016273055] [2022-04-28 10:44:34,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016273055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:34,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990106199] [2022-04-28 10:44:34,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:44:34,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:34,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:34,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:34,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:44:34,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:44:34,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:34,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:44:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:34,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:34,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-28 10:44:34,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,653 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-28 10:44:34,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8494#(<= main_~i~1 0)} is VALID [2022-04-28 10:44:34,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {8494#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8494#(<= main_~i~1 0)} is VALID [2022-04-28 10:44:34,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {8494#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:34,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:34,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-28 10:44:34,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {8366#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,656 INFO L272 TraceCheckUtils]: 39: Hoare triple {8367#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-28 10:44:34,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:34,658 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8367#(<= main_~n~0 2)} #152#return; {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {8367#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8367#(<= main_~n~0 2)} is VALID [2022-04-28 10:44:34,658 INFO L272 TraceCheckUtils]: 50: Hoare triple {8367#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8340#true} is VALID [2022-04-28 10:44:34,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8388#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {8388#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8552#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} is VALID [2022-04-28 10:44:34,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {8552#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8556#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 4)))} is VALID [2022-04-28 10:44:34,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {8556#(and (<= downsweep_~n |downsweep_#in~n|) (< 0 (div (+ downsweep_~right~1 1) 4)))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:34,663 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8367#(<= main_~n~0 2)} #154#return; {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-28 10:44:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:44:34,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:35,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {8341#false} assume !false; {8341#false} is VALID [2022-04-28 10:44:35,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {8341#false} assume 0 == ~cond; {8341#false} is VALID [2022-04-28 10:44:35,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {8341#false} ~cond := #in~cond; {8341#false} is VALID [2022-04-28 10:44:35,826 INFO L272 TraceCheckUtils]: 63: Hoare triple {8341#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {8341#false} is VALID [2022-04-28 10:44:35,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {8341#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {8341#false} is VALID [2022-04-28 10:44:35,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {8341#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {8341#false} is VALID [2022-04-28 10:44:35,827 INFO L272 TraceCheckUtils]: 60: Hoare triple {8341#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {8341#false} is VALID [2022-04-28 10:44:35,828 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8391#(<= 4 |downsweep_#in~n|)} {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} #154#return; {8341#false} is VALID [2022-04-28 10:44:35,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume true; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:35,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:35,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:35,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {8391#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:35,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {8636#(or (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8391#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:44:35,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {8640#(or (<= downsweep_~n (+ downsweep_~right~1 (* 2 downsweep_~space))) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {8636#(or (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:44:35,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {8644#(or (<= 4 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 4)) 1))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {8640#(or (<= downsweep_~n (+ downsweep_~right~1 (* 2 downsweep_~space))) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:44:35,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {8644#(or (<= 4 |downsweep_#in~n|) (<= (div (+ (- 1) (* (- 1) downsweep_~n)) (- 4)) 1))} is VALID [2022-04-28 10:44:35,832 INFO L272 TraceCheckUtils]: 50: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {8340#true} is VALID [2022-04-28 10:44:35,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-28 10:44:35,833 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8340#true} {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} #152#return; {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {8340#true} #res := ~space~0; {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#true} assume !(~space~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#true} ~space~0 := 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#true} assume !(~left~0 < ~n); {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {8340#true} is VALID [2022-04-28 10:44:35,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {8340#true} is VALID [2022-04-28 10:44:35,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {8340#true} is VALID [2022-04-28 10:44:35,834 INFO L272 TraceCheckUtils]: 39: Hoare triple {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {8340#true} is VALID [2022-04-28 10:44:35,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {8684#(<= (div (+ (* (- 1) main_~i~1) (- 5)) (- 4)) 2)} assume !(~i~1 < ~n~0); {8617#(<= (div (+ (- 1) (* (- 1) main_~n~0)) (- 4)) 1)} is VALID [2022-04-28 10:44:35,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {8366#(<= main_~i~1 2)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8684#(<= (div (+ (* (- 1) main_~i~1) (- 5)) (- 4)) 2)} is VALID [2022-04-28 10:44:35,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {8366#(<= main_~i~1 2)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8366#(<= main_~i~1 2)} is VALID [2022-04-28 10:44:35,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {8365#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {8366#(<= main_~i~1 2)} is VALID [2022-04-28 10:44:35,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {8365#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:35,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {8340#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {8365#(<= main_~i~1 1)} is VALID [2022-04-28 10:44:35,836 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#true} {8340#true} #150#return; {8340#true} is VALID [2022-04-28 10:44:35,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L272 TraceCheckUtils]: 29: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {8340#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8340#true} {8340#true} #148#return; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {8340#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L272 TraceCheckUtils]: 24: Hoare triple {8340#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {8340#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8340#true} {8340#true} #146#return; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L272 TraceCheckUtils]: 18: Hoare triple {8340#true} call assume_abort_if_not(#t~ret14); {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {8340#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8340#true} is VALID [2022-04-28 10:44:35,837 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8340#true} {8340#true} #144#return; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {8340#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {8340#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {8340#true} ~x := #in~x; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {8340#true} call #t~ret14 := is_pow2(~n~0); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8340#true} {8340#true} #142#return; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {8340#true} assume !(0 == ~cond); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {8340#true} ~cond := #in~cond; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {8340#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {8340#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {8340#true} call #t~ret20 := main(); {8340#true} is VALID [2022-04-28 10:44:35,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8340#true} {8340#true} #160#return; {8340#true} is VALID [2022-04-28 10:44:35,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {8340#true} assume true; {8340#true} is VALID [2022-04-28 10:44:35,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {8340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8340#true} is VALID [2022-04-28 10:44:35,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {8340#true} call ULTIMATE.init(); {8340#true} is VALID [2022-04-28 10:44:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:44:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990106199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:35,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:44:35,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-28 10:44:35,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761027744] [2022-04-28 10:44:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761027744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:44:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59796228] [2022-04-28 10:44:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-04-28 10:44:35,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:35,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:44:35,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:35,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:44:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:44:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:44:35,884 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:44:38,077 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-28 10:44:42,370 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-28 10:44:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:50,667 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-04-28 10:44:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:44:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-04-28 10:44:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:44:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-28 10:44:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:44:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-28 10:44:50,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 114 transitions. [2022-04-28 10:44:50,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:50,772 INFO L225 Difference]: With dead ends: 114 [2022-04-28 10:44:50,772 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 10:44:50,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:44:50,773 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:50,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 65 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 551 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 10:44:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 10:44:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-04-28 10:44:51,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:51,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-28 10:44:51,034 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-28 10:44:51,034 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-28 10:44:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:51,037 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 10:44:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-04-28 10:44:51,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:51,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) Second operand 102 states. [2022-04-28 10:44:51,038 INFO L87 Difference]: Start difference. First operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) Second operand 102 states. [2022-04-28 10:44:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:51,040 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 10:44:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2022-04-28 10:44:51,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:51,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:51,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:51,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 74 states have internal predecessors, (86), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2022-04-28 10:44:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2022-04-28 10:44:51,044 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 67 [2022-04-28 10:44:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:51,044 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2022-04-28 10:44:51,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:44:51,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 118 transitions. [2022-04-28 10:44:51,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2022-04-28 10:44:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 10:44:51,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:51,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:51,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:51,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:51,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1247511922, now seen corresponding path program 5 times [2022-04-28 10:44:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562096956] [2022-04-28 10:44:51,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:44:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1247511922, now seen corresponding path program 6 times [2022-04-28 10:44:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137219530] [2022-04-28 10:44:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-28 10:44:51,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-28 10:44:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:44:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:51,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:51,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-28 10:44:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:44:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~x := #in~x; {9452#true} is VALID [2022-04-28 10:44:51,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9452#true} is VALID [2022-04-28 10:44:51,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9452#true} is VALID [2022-04-28 10:44:51,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,600 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9452#true} {9452#true} #144#return; {9452#true} is VALID [2022-04-28 10:44:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:44:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:51,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:51,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #146#return; {9452#true} is VALID [2022-04-28 10:44:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:44:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:51,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #148#return; {9452#true} is VALID [2022-04-28 10:44:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:44:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:51,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9452#true} {9452#true} #150#return; {9452#true} is VALID [2022-04-28 10:44:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 10:44:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} is VALID [2022-04-28 10:44:51,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} is VALID [2022-04-28 10:44:51,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} assume !(~left~0 < ~n); {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= |upsweep_#in~n| 2)} #res := ~space~0; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= |upsweep_#in~n| 2)} assume true; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,741 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {9503#(<= |upsweep_#in~n| 2)} {9479#(<= 3 main_~n~0)} #152#return; {9453#false} is VALID [2022-04-28 10:44:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 10:44:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {9452#true} assume !(~right~1 < ~n); {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {9452#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume !(~space > 0); {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,750 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9452#true} {9453#false} #154#return; {9453#false} is VALID [2022-04-28 10:44:51,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:51,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {9497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-28 10:44:51,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-28 10:44:51,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-28 10:44:51,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-28 10:44:51,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {9452#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {9452#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,752 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9452#true} {9452#true} #144#return; {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {9452#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L272 TraceCheckUtils]: 18: Hoare triple {9452#true} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9452#true} {9452#true} #146#return; {9452#true} is VALID [2022-04-28 10:44:51,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {9452#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:51,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {9452#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:51,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:51,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,754 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9452#true} #148#return; {9452#true} is VALID [2022-04-28 10:44:51,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {9452#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:51,755 INFO L272 TraceCheckUtils]: 29: Hoare triple {9452#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:51,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:51,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,756 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9452#true} #150#return; {9452#true} is VALID [2022-04-28 10:44:51,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {9452#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9476#(= main_~i~1 0)} is VALID [2022-04-28 10:44:51,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {9476#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9476#(= main_~i~1 0)} is VALID [2022-04-28 10:44:51,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {9476#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9477#(<= 1 main_~i~1)} is VALID [2022-04-28 10:44:51,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {9477#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9477#(<= 1 main_~i~1)} is VALID [2022-04-28 10:44:51,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {9477#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9478#(<= 2 main_~i~1)} is VALID [2022-04-28 10:44:51,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {9478#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9479#(<= 3 main_~n~0)} is VALID [2022-04-28 10:44:51,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {9479#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9479#(<= 3 main_~n~0)} is VALID [2022-04-28 10:44:51,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {9479#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {9479#(<= 3 main_~n~0)} is VALID [2022-04-28 10:44:51,760 INFO L272 TraceCheckUtils]: 41: Hoare triple {9479#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:51,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {9499#(and (<= upsweep_~space~0 1) (= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} is VALID [2022-04-28 10:44:51,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {9500#(and (= |upsweep_#in~n| upsweep_~n) (<= (+ (* 2 upsweep_~space~0) upsweep_~left~0) 2))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} is VALID [2022-04-28 10:44:51,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {9501#(and (= |upsweep_#in~n| upsweep_~n) (<= upsweep_~left~0 2))} assume !(~left~0 < ~n); {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:51,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {9502#(and (<= upsweep_~n 2) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {9503#(<= |upsweep_#in~n| 2)} #res := ~space~0; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {9503#(<= |upsweep_#in~n| 2)} assume true; {9503#(<= |upsweep_#in~n| 2)} is VALID [2022-04-28 10:44:51,765 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9503#(<= |upsweep_#in~n| 2)} {9479#(<= 3 main_~n~0)} #152#return; {9453#false} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {9453#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9453#false} is VALID [2022-04-28 10:44:51,766 INFO L272 TraceCheckUtils]: 52: Hoare triple {9453#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {9498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {9452#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {9452#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {9452#true} assume !(~right~1 < ~n); {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {9452#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {9452#true} assume !(~space > 0); {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:51,766 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9452#true} {9453#false} #154#return; {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L272 TraceCheckUtils]: 61: Hoare triple {9453#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {9453#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {9453#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-28 10:44:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:44:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137219530] [2022-04-28 10:44:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137219530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554547802] [2022-04-28 10:44:51,768 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:44:51,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:51,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:51,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:44:51,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:44:51,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:51,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:44:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:53,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9452#true} is VALID [2022-04-28 10:44:53,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-28 10:44:53,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:53,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-28 10:44:53,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-28 10:44:53,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-28 10:44:53,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9543#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-28 10:44:53,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {9543#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9547#(and (or (not (< 1 (mod is_pow2_~x 4294967296))) (not (= (mod is_pow2_~x 2) 0))) (= |is_pow2_#in~x| is_pow2_~x))} is VALID [2022-04-28 10:44:53,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {9547#(and (or (not (< 1 (mod is_pow2_~x 4294967296))) (not (= (mod is_pow2_~x 2) 0))) (= |is_pow2_#in~x| is_pow2_~x))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} is VALID [2022-04-28 10:44:53,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} assume true; {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} is VALID [2022-04-28 10:44:53,073 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9551#(and (or (and (= |is_pow2_#res| 1) (= (mod |is_pow2_#in~x| 4294967296) 1)) (and (= |is_pow2_#res| 0) (not (= (mod |is_pow2_#in~x| 4294967296) 1)))) (or (not (< 1 (mod |is_pow2_#in~x| 4294967296))) (not (= (mod |is_pow2_#in~x| 2) 0))))} {9452#true} #144#return; {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} is VALID [2022-04-28 10:44:53,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} is VALID [2022-04-28 10:44:53,074 INFO L272 TraceCheckUtils]: 18: Hoare triple {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-28 10:44:53,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:44:53,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {9568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:44:53,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:44:53,075 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} {9558#(and (or (not (< 1 (mod main_~n~0 4294967296))) (not (= (mod main_~n~0 2) 0))) (or (and (= |main_#t~ret14| 0) (not (= (mod main_~n~0 4294967296) 1))) (and (= (mod main_~n~0 4294967296) 1) (= |main_#t~ret14| 1))))} #146#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,076 INFO L272 TraceCheckUtils]: 24: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:53,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:53,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:53,076 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9579#(= (mod main_~n~0 4294967296) 1)} #148#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,078 INFO L272 TraceCheckUtils]: 29: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:53,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:53,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:53,080 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9579#(= (mod main_~n~0 4294967296) 1)} #150#return; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} assume !(~i~1 < ~n~0); {9579#(= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-28 10:44:53,083 INFO L272 TraceCheckUtils]: 41: Hoare triple {9579#(= (mod main_~n~0 4294967296) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9452#true} is VALID [2022-04-28 10:44:53,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9640#(and (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-28 10:44:53,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {9640#(and (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-28 10:44:53,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-28 10:44:53,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} assume !(~left~0 < ~n); {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} is VALID [2022-04-28 10:44:53,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {9644#(and (< upsweep_~space~0 upsweep_~n) (= |upsweep_#in~n| upsweep_~n) (= upsweep_~space~0 1))} ~space~0 := 2 * ~space~0; {9654#(and (< 1 upsweep_~n) (= 2 upsweep_~space~0) (= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:44:53,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {9654#(and (< 1 upsweep_~n) (= 2 upsweep_~space~0) (= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {9658#(and (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 |upsweep_#in~n|)) (= 2 upsweep_~space~0))} is VALID [2022-04-28 10:44:53,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {9658#(and (< 1 |upsweep_#in~n|) (not (< upsweep_~space~0 |upsweep_#in~n|)) (= 2 upsweep_~space~0))} #res := ~space~0; {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} is VALID [2022-04-28 10:44:53,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} assume true; {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} is VALID [2022-04-28 10:44:53,089 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9662#(and (not (< 2 |upsweep_#in~n|)) (< 1 |upsweep_#in~n|) (= |upsweep_#res| 2))} {9579#(= (mod main_~n~0 4294967296) 1)} #152#return; {9453#false} is VALID [2022-04-28 10:44:53,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {9453#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9453#false} is VALID [2022-04-28 10:44:53,089 INFO L272 TraceCheckUtils]: 52: Hoare triple {9453#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9453#false} is VALID [2022-04-28 10:44:53,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {9453#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9453#false} is VALID [2022-04-28 10:44:53,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {9453#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {9453#false} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {9453#false} assume !(~right~1 < ~n); {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {9453#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {9453#false} assume !(~space > 0); {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {9453#false} assume true; {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9453#false} {9453#false} #154#return; {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L272 TraceCheckUtils]: 61: Hoare triple {9453#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {9453#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {9453#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-28 10:44:53,090 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-28 10:44:53,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-28 10:44:53,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-28 10:44:53,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-28 10:44:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:44:53,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:54,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {9453#false} assume !false; {9453#false} is VALID [2022-04-28 10:44:54,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {9453#false} assume 0 == ~cond; {9453#false} is VALID [2022-04-28 10:44:54,921 INFO L290 TraceCheckUtils]: 65: Hoare triple {9453#false} ~cond := #in~cond; {9453#false} is VALID [2022-04-28 10:44:54,921 INFO L272 TraceCheckUtils]: 64: Hoare triple {9453#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {9453#false} is VALID [2022-04-28 10:44:54,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {9732#(not (< check_~i~0 check_~n))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {9453#false} is VALID [2022-04-28 10:44:54,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {9736#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {9732#(not (< check_~i~0 check_~n))} is VALID [2022-04-28 10:44:54,923 INFO L272 TraceCheckUtils]: 61: Hoare triple {9740#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {9736#(<= |check_#in~n| 0)} is VALID [2022-04-28 10:44:54,925 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9748#(< 0 (div |downsweep_#in~space| 2))} {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} #154#return; {9740#(<= main_~n~0 0)} is VALID [2022-04-28 10:44:54,925 INFO L290 TraceCheckUtils]: 59: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume true; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,925 INFO L290 TraceCheckUtils]: 58: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !(~space > 0); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !(~right~1 < ~n); {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {9748#(< 0 (div |downsweep_#in~space| 2))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {9767#(or (< 0 (div |downsweep_#in~space| 2)) (not (< 0 downsweep_~space)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {9748#(< 0 (div |downsweep_#in~space| 2))} is VALID [2022-04-28 10:44:54,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {9767#(or (< 0 (div |downsweep_#in~space| 2)) (not (< 0 downsweep_~space)))} is VALID [2022-04-28 10:44:54,929 INFO L272 TraceCheckUtils]: 52: Hoare triple {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {9452#true} is VALID [2022-04-28 10:44:54,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {9774#(or (<= (div |main_#t~ret19| 2) 0) (<= main_~n~0 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {9744#(or (<= main_~n~0 0) (<= (div main_~space~1 2) 0))} is VALID [2022-04-28 10:44:54,930 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #152#return; {9774#(or (<= (div |main_#t~ret19| 2) 0) (<= main_~n~0 0))} is VALID [2022-04-28 10:44:54,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} assume true; {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} is VALID [2022-04-28 10:44:54,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {9789#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div upsweep_~space~0 2) 0))} #res := ~space~0; {9782#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div |upsweep_#res| 2) 0))} is VALID [2022-04-28 10:44:54,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {9793#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0))} assume !(~space~0 < ~n); {9789#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= (div upsweep_~space~0 2) 0))} is VALID [2022-04-28 10:44:54,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} ~space~0 := 2 * ~space~0; {9793#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< upsweep_~space~0 upsweep_~n) (<= (div upsweep_~space~0 2) 0))} is VALID [2022-04-28 10:44:54,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !(~left~0 < ~n); {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:44:54,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:44:54,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {9807#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< (* 2 upsweep_~space~0) upsweep_~n) (<= upsweep_~n upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {9797#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (<= upsweep_~space~0 0) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:44:54,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {9452#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {9807#(or (<= |upsweep_#in~n| 0) (and (not (< 2 |upsweep_#in~n|)) (not (<= |upsweep_#in~n| 1))) (< (* 2 upsweep_~space~0) upsweep_~n) (<= upsweep_~n upsweep_~space~0))} is VALID [2022-04-28 10:44:54,937 INFO L272 TraceCheckUtils]: 41: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {9452#true} is VALID [2022-04-28 10:44:54,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !(~i~1 < ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,941 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9452#true} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #150#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:54,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:54,942 INFO L272 TraceCheckUtils]: 29: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:54,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,943 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9452#true} {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} #148#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:54,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9452#true} is VALID [2022-04-28 10:44:54,943 INFO L272 TraceCheckUtils]: 24: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {9452#true} is VALID [2022-04-28 10:44:54,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,945 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} #146#return; {9778#(or (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {9572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:44:54,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {9878#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {9572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:44:54,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {9452#true} ~cond := #in~cond; {9878#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 10:44:54,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} call assume_abort_if_not(#t~ret14); {9452#true} is VALID [2022-04-28 10:44:54,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,947 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} {9452#true} #144#return; {9868#(or (= |main_#t~ret14| 0) (< 2 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:44:54,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} assume true; {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} is VALID [2022-04-28 10:44:54,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {9891#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (= |is_pow2_#res| 0))} is VALID [2022-04-28 10:44:54,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} is VALID [2022-04-28 10:44:54,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {9452#true} ~x := #in~x; {9898#(or (< 2 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1) (not (= (mod is_pow2_~x 4294967296) 1)))} is VALID [2022-04-28 10:44:54,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {9452#true} call #t~ret14 := is_pow2(~n~0); {9452#true} is VALID [2022-04-28 10:44:54,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9452#true} {9452#true} #142#return; {9452#true} is VALID [2022-04-28 10:44:54,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:54,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {9452#true} assume !(0 == ~cond); {9452#true} is VALID [2022-04-28 10:44:54,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {9452#true} ~cond := #in~cond; {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {9452#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {9452#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {9452#true} call #t~ret20 := main(); {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9452#true} {9452#true} #160#return; {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {9452#true} assume true; {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {9452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9452#true} is VALID [2022-04-28 10:44:54,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {9452#true} call ULTIMATE.init(); {9452#true} is VALID [2022-04-28 10:44:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:44:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554547802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:54,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:44:54,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 20] total 42 [2022-04-28 10:44:54,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:54,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562096956] [2022-04-28 10:44:54,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562096956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:54,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:54,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:44:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752994309] [2022-04-28 10:44:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2022-04-28 10:44:54,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:54,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:44:55,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:55,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:44:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:44:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:44:55,015 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:44:57,225 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-28 10:45:01,520 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-28 10:45:10,082 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-28 10:45:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:12,124 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2022-04-28 10:45:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:45:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2022-04-28 10:45:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:45:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 125 transitions. [2022-04-28 10:45:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:45:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 125 transitions. [2022-04-28 10:45:12,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 125 transitions. [2022-04-28 10:45:12,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:12,267 INFO L225 Difference]: With dead ends: 166 [2022-04-28 10:45:12,267 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 10:45:12,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=2822, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:45:12,269 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 75 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:12,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 62 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 590 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2022-04-28 10:45:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 10:45:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2022-04-28 10:45:12,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:12,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-28 10:45:12,559 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-28 10:45:12,559 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-28 10:45:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:12,562 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-28 10:45:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-28 10:45:12,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:12,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:12,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Second operand 116 states. [2022-04-28 10:45:12,563 INFO L87 Difference]: Start difference. First operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Second operand 116 states. [2022-04-28 10:45:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:12,566 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-28 10:45:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-28 10:45:12,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:12,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:12,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:12,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 83 states have internal predecessors, (97), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2022-04-28 10:45:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2022-04-28 10:45:12,570 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 68 [2022-04-28 10:45:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:12,570 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2022-04-28 10:45:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:45:12,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 130 transitions. [2022-04-28 10:45:12,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2022-04-28 10:45:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 10:45:12,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:12,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:12,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:45:13,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 10:45:13,039 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 617921138, now seen corresponding path program 1 times [2022-04-28 10:45:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776938184] [2022-04-28 10:45:13,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:45:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 617921138, now seen corresponding path program 2 times [2022-04-28 10:45:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291351605] [2022-04-28 10:45:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:45:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-28 10:45:13,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-28 10:45:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:45:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-28 10:45:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:45:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-28 10:45:13,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-28 10:45:13,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-28 10:45:13,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,145 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-28 10:45:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:45:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-28 10:45:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:45:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:13,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-28 10:45:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:45:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:13,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-28 10:45:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:45:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {10793#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {10794#(<= 2 upsweep_~space~0)} assume !(~space~0 < ~n); {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {10794#(<= 2 upsweep_~space~0)} #res := ~space~0; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-28 10:45:13,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {10795#(<= 2 |upsweep_#res|)} assume true; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-28 10:45:13,221 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10795#(<= 2 |upsweep_#res|)} {10771#(<= 2 main_~n~0)} #152#return; {10781#(<= 2 |main_#t~ret19|)} is VALID [2022-04-28 10:45:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:45:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:45:13,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:13,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:13,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10782#(<= 2 main_~space~1)} #154#return; {10746#false} is VALID [2022-04-28 10:45:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 10:45:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10746#false} #158#return; {10746#false} is VALID [2022-04-28 10:45:13,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {10745#true} call ULTIMATE.init(); {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:45:13,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {10791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {10745#true} call #t~ret20 := main(); {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {10745#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {10745#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {10745#true} is VALID [2022-04-28 10:45:13,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L272 TraceCheckUtils]: 11: Hoare triple {10745#true} call #t~ret14 := is_pow2(~n~0); {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-28 10:45:13,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {10745#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L272 TraceCheckUtils]: 18: Hoare triple {10745#true} call assume_abort_if_not(#t~ret14); {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-28 10:45:13,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {10745#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:13,343 INFO L272 TraceCheckUtils]: 24: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:13,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:13,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,343 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-28 10:45:13,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {10745#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:13,344 INFO L272 TraceCheckUtils]: 29: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:13,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:13,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,345 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-28 10:45:13,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {10745#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {10769#(= main_~i~1 0)} is VALID [2022-04-28 10:45:13,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {10769#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10769#(= main_~i~1 0)} is VALID [2022-04-28 10:45:13,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {10769#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10770#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:13,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {10770#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10771#(<= 2 main_~n~0)} is VALID [2022-04-28 10:45:13,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {10771#(<= 2 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10771#(<= 2 main_~n~0)} is VALID [2022-04-28 10:45:13,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {10771#(<= 2 main_~n~0)} assume !(~i~1 < ~n~0); {10771#(<= 2 main_~n~0)} is VALID [2022-04-28 10:45:13,348 INFO L272 TraceCheckUtils]: 39: Hoare triple {10771#(<= 2 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:13,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {10793#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {10793#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {10793#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {10794#(<= 2 upsweep_~space~0)} assume !(~space~0 < ~n); {10794#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:45:13,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {10794#(<= 2 upsweep_~space~0)} #res := ~space~0; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-28 10:45:13,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {10795#(<= 2 |upsweep_#res|)} assume true; {10795#(<= 2 |upsweep_#res|)} is VALID [2022-04-28 10:45:13,352 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10795#(<= 2 |upsweep_#res|)} {10771#(<= 2 main_~n~0)} #152#return; {10781#(<= 2 |main_#t~ret19|)} is VALID [2022-04-28 10:45:13,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {10781#(<= 2 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {10782#(<= 2 main_~space~1)} is VALID [2022-04-28 10:45:13,354 INFO L272 TraceCheckUtils]: 50: Hoare triple {10782#(<= 2 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {10792#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:13,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {10792#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:45:13,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {10796#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:13,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:13,358 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10782#(<= 2 main_~space~1)} #154#return; {10746#false} is VALID [2022-04-28 10:45:13,358 INFO L272 TraceCheckUtils]: 55: Hoare triple {10746#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {10746#false} is VALID [2022-04-28 10:45:13,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {10746#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {10746#false} is VALID [2022-04-28 10:45:13,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {10746#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-28 10:45:13,358 INFO L272 TraceCheckUtils]: 58: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10745#true} is VALID [2022-04-28 10:45:13,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:13,359 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10745#true} {10746#false} #158#return; {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 63: Hoare triple {10746#false} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {10746#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {10746#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L272 TraceCheckUtils]: 66: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {10746#false} ~cond := #in~cond; {10746#false} is VALID [2022-04-28 10:45:13,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {10746#false} assume 0 == ~cond; {10746#false} is VALID [2022-04-28 10:45:13,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {10746#false} assume !false; {10746#false} is VALID [2022-04-28 10:45:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:45:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:45:13,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291351605] [2022-04-28 10:45:13,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291351605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:45:13,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645237321] [2022-04-28 10:45:13,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:45:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:13,362 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:45:13,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 10:45:13,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:45:13,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:45:13,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:45:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:13,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:45:14,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {10745#true} call ULTIMATE.init(); {10745#true} is VALID [2022-04-28 10:45:14,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10745#true} is VALID [2022-04-28 10:45:14,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10745#true} {10745#true} #160#return; {10745#true} is VALID [2022-04-28 10:45:14,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {10745#true} call #t~ret20 := main(); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {10745#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {10745#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10745#true} {10745#true} #142#return; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L272 TraceCheckUtils]: 11: Hoare triple {10745#true} call #t~ret14 := is_pow2(~n~0); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {10745#true} ~x := #in~x; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {10745#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {10745#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10745#true} {10745#true} #144#return; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {10745#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10745#true} is VALID [2022-04-28 10:45:14,049 INFO L272 TraceCheckUtils]: 18: Hoare triple {10745#true} call assume_abort_if_not(#t~ret14); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10745#true} {10745#true} #146#return; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {10745#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L272 TraceCheckUtils]: 24: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {10745#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10745#true} {10745#true} #148#return; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {10745#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L272 TraceCheckUtils]: 29: Hoare triple {10745#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {10745#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,050 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10745#true} {10745#true} #150#return; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {10745#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {10745#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {10745#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {10745#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {10745#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {10745#true} assume !(~i~1 < ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L272 TraceCheckUtils]: 39: Hoare triple {10745#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {10745#true} is VALID [2022-04-28 10:45:14,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {10745#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-28 10:45:14,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-28 10:45:14,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-28 10:45:14,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !(~left~0 < ~n); {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-28 10:45:14,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} ~space~0 := 2 * ~space~0; {10921#(<= |upsweep_#in~n| upsweep_~n)} is VALID [2022-04-28 10:45:14,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {10921#(<= |upsweep_#in~n| upsweep_~n)} assume !(~space~0 < ~n); {10937#(<= |upsweep_#in~n| upsweep_~space~0)} is VALID [2022-04-28 10:45:14,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {10937#(<= |upsweep_#in~n| upsweep_~space~0)} #res := ~space~0; {10941#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-28 10:45:14,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {10941#(<= |upsweep_#in~n| |upsweep_#res|)} assume true; {10941#(<= |upsweep_#in~n| |upsweep_#res|)} is VALID [2022-04-28 10:45:14,054 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10941#(<= |upsweep_#in~n| |upsweep_#res|)} {10745#true} #152#return; {10948#(<= main_~n~0 |main_#t~ret19|)} is VALID [2022-04-28 10:45:14,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(<= main_~n~0 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {10952#(<= main_~n~0 main_~space~1)} is VALID [2022-04-28 10:45:14,055 INFO L272 TraceCheckUtils]: 50: Hoare triple {10952#(<= main_~n~0 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {10745#true} is VALID [2022-04-28 10:45:14,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {10745#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {10959#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} is VALID [2022-04-28 10:45:14,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {10959#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} assume !(~space > 0); {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:14,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {10797#(<= |downsweep_#in~space| 1)} assume true; {10797#(<= |downsweep_#in~space| 1)} is VALID [2022-04-28 10:45:14,058 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10797#(<= |downsweep_#in~space| 1)} {10952#(<= main_~n~0 main_~space~1)} #154#return; {10969#(<= main_~n~0 1)} is VALID [2022-04-28 10:45:14,058 INFO L272 TraceCheckUtils]: 55: Hoare triple {10969#(<= main_~n~0 1)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {10973#(<= |check_#in~n| 1)} is VALID [2022-04-28 10:45:14,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {10973#(<= |check_#in~n| 1)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-28 10:45:14,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-28 10:45:14,059 INFO L272 TraceCheckUtils]: 58: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10745#true} is VALID [2022-04-28 10:45:14,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {10745#true} ~cond := #in~cond; {10745#true} is VALID [2022-04-28 10:45:14,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {10745#true} assume !(0 == ~cond); {10745#true} is VALID [2022-04-28 10:45:14,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {10745#true} assume true; {10745#true} is VALID [2022-04-28 10:45:14,060 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10745#true} {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} #158#return; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-28 10:45:14,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} is VALID [2022-04-28 10:45:14,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {10977#(and (<= check_~n 1) (<= 0 check_~i~0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11002#(and (<= check_~n 1) (<= 1 check_~i~0))} is VALID [2022-04-28 10:45:14,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {11002#(and (<= check_~n 1) (<= 1 check_~i~0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {10746#false} is VALID [2022-04-28 10:45:14,061 INFO L272 TraceCheckUtils]: 66: Hoare triple {10746#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {10746#false} is VALID [2022-04-28 10:45:14,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {10746#false} ~cond := #in~cond; {10746#false} is VALID [2022-04-28 10:45:14,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {10746#false} assume 0 == ~cond; {10746#false} is VALID [2022-04-28 10:45:14,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {10746#false} assume !false; {10746#false} is VALID [2022-04-28 10:45:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:45:14,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:45:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645237321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:14,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:45:14,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2022-04-28 10:45:14,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:45:14,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776938184] [2022-04-28 10:45:14,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776938184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:14,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:45:14,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:45:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269164896] [2022-04-28 10:45:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:45:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-04-28 10:45:14,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:45:14,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:45:14,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:14,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:45:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:45:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:45:14,107 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:45:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:37,087 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2022-04-28 10:45:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:45:37,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-04-28 10:45:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:45:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-04-28 10:45:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:45:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-04-28 10:45:37,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2022-04-28 10:45:37,169 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-28 10:45:37,171 INFO L225 Difference]: With dead ends: 129 [2022-04-28 10:45:37,171 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 10:45:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:45:37,172 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 536 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:45:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 10:45:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2022-04-28 10:45:37,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:37,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:45:37,462 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:45:37,462 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:45:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:37,464 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-28 10:45:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-04-28 10:45:37,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:37,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:37,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-28 10:45:37,466 INFO L87 Difference]: Start difference. First operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-28 10:45:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:37,468 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-28 10:45:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-04-28 10:45:37,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:37,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:37,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:37,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.236842105263158) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:45:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-04-28 10:45:37,472 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2022-04-28 10:45:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:37,472 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-04-28 10:45:37,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:45:37,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 125 transitions. [2022-04-28 10:45:37,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-04-28 10:45:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 10:45:37,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:37,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:37,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 10:45:38,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:45:38,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash -677053431, now seen corresponding path program 7 times [2022-04-28 10:45:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259627229] [2022-04-28 10:45:38,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:45:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash -677053431, now seen corresponding path program 8 times [2022-04-28 10:45:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556576309] [2022-04-28 10:45:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:45:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-28 10:45:38,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-28 10:45:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:45:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:38,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:38,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-28 10:45:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:45:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-28 10:45:38,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-28 10:45:38,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-28 10:45:38,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,145 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-28 10:45:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:45:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:38,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:38,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-28 10:45:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:45:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:38,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-28 10:45:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:45:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:38,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-28 10:45:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 10:45:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11761#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:38,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {11761#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11762#(<= 0 upsweep_~left~0)} is VALID [2022-04-28 10:45:38,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {11762#(<= 0 upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} is VALID [2022-04-28 10:45:38,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} assume !(~left~0 < ~n); {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} ~space~0 := 2 * ~space~0; {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} assume !(~space~0 < ~n); {11714#false} is VALID [2022-04-28 10:45:38,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {11714#false} #res := ~space~0; {11714#false} is VALID [2022-04-28 10:45:38,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-28 10:45:38,274 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11714#false} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-28 10:45:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 10:45:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,284 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-28 10:45:38,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {11759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:38,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,294 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-28 10:45:38,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:38,297 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:38,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:38,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,297 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-28 10:45:38,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:38,298 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:38,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:38,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,300 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-28 10:45:38,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11737#(= main_~i~1 0)} is VALID [2022-04-28 10:45:38,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {11737#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11737#(= main_~i~1 0)} is VALID [2022-04-28 10:45:38,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {11737#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:38,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:38,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-28 10:45:38,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:38,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:38,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:38,304 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:38,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11761#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:45:38,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {11761#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11762#(<= 0 upsweep_~left~0)} is VALID [2022-04-28 10:45:38,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {11762#(<= 0 upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} is VALID [2022-04-28 10:45:38,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {11763#(<= (* 2 upsweep_~space~0) upsweep_~left~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} assume !(~left~0 < ~n); {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {11764#(<= (+ (* 2 upsweep_~space~0) 1) upsweep_~n)} ~space~0 := 2 * ~space~0; {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} is VALID [2022-04-28 10:45:38,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {11765#(<= (+ upsweep_~space~0 1) upsweep_~n)} assume !(~space~0 < ~n); {11714#false} is VALID [2022-04-28 10:45:38,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {11714#false} #res := ~space~0; {11714#false} is VALID [2022-04-28 10:45:38,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-28 10:45:38,309 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11714#false} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-28 10:45:38,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-28 10:45:38,309 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11760#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:45:38,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {11760#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:38,310 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-28 10:45:38,310 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-28 10:45:38,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-28 10:45:38,310 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-28 10:45:38,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-28 10:45:38,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-28 10:45:38,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-28 10:45:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:45:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:45:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556576309] [2022-04-28 10:45:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556576309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:45:38,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689152581] [2022-04-28 10:45:38,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:45:38,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:38,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:38,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:45:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 10:45:38,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:45:38,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:45:38,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:45:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:38,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:45:39,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-28 10:45:39,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-28 10:45:39,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-28 10:45:39,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,148 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:39,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,148 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-28 10:45:39,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11868#(<= 0 main_~i~1)} is VALID [2022-04-28 10:45:39,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {11868#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11868#(<= 0 main_~i~1)} is VALID [2022-04-28 10:45:39,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {11868#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:39,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:39,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-28 10:45:39,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,152 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {11896#(and (<= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {11912#(and (<= (div (- upsweep_~space~0) (- 2)) 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:45:39,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {11912#(and (<= (div (- upsweep_~space~0) (- 2)) 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} #res := ~space~0; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} assume true; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,158 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {11714#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {11714#false} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {11714#false} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {11714#false} assume !(~right~1 < ~n); {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {11714#false} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {11714#false} assume !(~space > 0); {11714#false} is VALID [2022-04-28 10:45:39,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {11714#false} assume true; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11714#false} {11714#false} #154#return; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-28 10:45:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:45:39,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {11714#false} assume !false; {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {11714#false} assume 0 == ~cond; {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {11714#false} ~cond := #in~cond; {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L272 TraceCheckUtils]: 65: Hoare triple {11714#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {11714#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {11714#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L272 TraceCheckUtils]: 62: Hoare triple {11714#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11713#true} {11714#false} #154#return; {11714#false} is VALID [2022-04-28 10:45:39,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {11713#true} assume !(~space > 0); {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {11713#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {11713#true} assume !(~right~1 < ~n); {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {11713#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {11713#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L272 TraceCheckUtils]: 53: Hoare triple {11714#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {11713#true} is VALID [2022-04-28 10:45:39,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {11714#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {11714#false} is VALID [2022-04-28 10:45:39,863 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} {11740#(<= 3 main_~n~0)} #152#return; {11714#false} is VALID [2022-04-28 10:45:39,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} assume true; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} #res := ~space~0; {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {12040#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< upsweep_~space~0 upsweep_~n))} assume !(~space~0 < ~n); {11916#(<= (div (- |upsweep_#in~n|) (- 2)) 1)} is VALID [2022-04-28 10:45:39,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} ~space~0 := 2 * ~space~0; {12040#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< upsweep_~space~0 upsweep_~n))} is VALID [2022-04-28 10:45:39,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !(~left~0 < ~n); {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:45:39,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:45:39,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:45:39,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:45:39,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {11713#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12044#(or (<= (div (- |upsweep_#in~n|) (- 2)) 1) (< (* 2 upsweep_~space~0) upsweep_~n))} is VALID [2022-04-28 10:45:39,867 INFO L272 TraceCheckUtils]: 41: Hoare triple {11740#(<= 3 main_~n~0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {11740#(<= 3 main_~n~0)} assume !(~i~1 < ~n~0); {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {11740#(<= 3 main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {11739#(<= 2 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11740#(<= 3 main_~n~0)} is VALID [2022-04-28 10:45:39,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {11738#(<= 1 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11739#(<= 2 main_~i~1)} is VALID [2022-04-28 10:45:39,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {11738#(<= 1 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:39,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {11868#(<= 0 main_~i~1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {11738#(<= 1 main_~i~1)} is VALID [2022-04-28 10:45:39,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {11868#(<= 0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {11868#(<= 0 main_~i~1)} is VALID [2022-04-28 10:45:39,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {11713#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {11868#(<= 0 main_~i~1)} is VALID [2022-04-28 10:45:39,871 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11713#true} {11713#true} #150#return; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L272 TraceCheckUtils]: 29: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {11713#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11713#true} {11713#true} #148#return; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {11713#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L272 TraceCheckUtils]: 24: Hoare triple {11713#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {11713#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11713#true} {11713#true} #146#return; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:39,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L272 TraceCheckUtils]: 18: Hoare triple {11713#true} call assume_abort_if_not(#t~ret14); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {11713#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11713#true} {11713#true} #144#return; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {11713#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {11713#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {11713#true} ~x := #in~x; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L272 TraceCheckUtils]: 11: Hoare triple {11713#true} call #t~ret14 := is_pow2(~n~0); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11713#true} {11713#true} #142#return; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {11713#true} assume !(0 == ~cond); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {11713#true} ~cond := #in~cond; {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {11713#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11713#true} is VALID [2022-04-28 10:45:39,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {11713#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {11713#true} call #t~ret20 := main(); {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11713#true} {11713#true} #160#return; {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {11713#true} assume true; {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {11713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {11713#true} call ULTIMATE.init(); {11713#true} is VALID [2022-04-28 10:45:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:45:39,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689152581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:45:39,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:45:39,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 19 [2022-04-28 10:45:39,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:45:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259627229] [2022-04-28 10:45:39,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259627229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:39,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:45:39,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:45:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344594692] [2022-04-28 10:45:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:45:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2022-04-28 10:45:39,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:45:39,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:45:39,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:39,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:45:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:39,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:45:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:45:39,919 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:45:44,352 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-28 10:45:48,633 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-28 10:45:55,102 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-28 10:45:57,258 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-28 10:46:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:01,892 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-04-28 10:46:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:46:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2022-04-28 10:46:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:46:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2022-04-28 10:46:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:46:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 111 transitions. [2022-04-28 10:46:01,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 111 transitions. [2022-04-28 10:46:02,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:02,012 INFO L225 Difference]: With dead ends: 165 [2022-04-28 10:46:02,012 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 10:46:02,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:46:02,013 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 63 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 65 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 726 Invalid, 4 Unknown, 0 Unchecked, 9.5s Time] [2022-04-28 10:46:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 10:46:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-28 10:46:02,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:02,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:46:02,389 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:46:02,389 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:46:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:02,392 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2022-04-28 10:46:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-04-28 10:46:02,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:02,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:02,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-28 10:46:02,393 INFO L87 Difference]: Start difference. First operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Second operand 110 states. [2022-04-28 10:46:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:02,396 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2022-04-28 10:46:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-04-28 10:46:02,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:02,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:02,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:02,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 86 states have internal predecessors, (102), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2022-04-28 10:46:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2022-04-28 10:46:02,400 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 69 [2022-04-28 10:46:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:02,400 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2022-04-28 10:46:02,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:46:02,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 133 transitions. [2022-04-28 10:46:02,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2022-04-28 10:46:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 10:46:02,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:02,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:02,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 10:46:02,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:46:02,918 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1405616165, now seen corresponding path program 9 times [2022-04-28 10:46:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:02,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064675792] [2022-04-28 10:46:02,918 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:46:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1405616165, now seen corresponding path program 10 times [2022-04-28 10:46:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:02,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416873853] [2022-04-28 10:46:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:46:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-28 10:46:03,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-28 10:46:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:46:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-28 10:46:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:46:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-28 10:46:03,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-28 10:46:03,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-28 10:46:03,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,018 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-28 10:46:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:46:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-28 10:46:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:46:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-28 10:46:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:46:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-28 10:46:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:46:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,044 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:46:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13027#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {13027#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} assume !(~right~1 < ~n); {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} is VALID [2022-04-28 10:46:03,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-28 10:46:03,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-28 10:46:03,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,225 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-28 10:46:03,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:46:03,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {13025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,228 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-28 10:46:03,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:03,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,232 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-28 10:46:03,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,233 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:03,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,234 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-28 10:46:03,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13000#(= main_~i~1 0)} is VALID [2022-04-28 10:46:03,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {13000#(= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13000#(= main_~i~1 0)} is VALID [2022-04-28 10:46:03,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:03,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:03,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-28 10:46:03,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,237 INFO L272 TraceCheckUtils]: 39: Hoare triple {13003#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:03,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-28 10:46:03,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-28 10:46:03,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,239 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {13003#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,240 INFO L272 TraceCheckUtils]: 50: Hoare triple {13003#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {13026#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:03,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {13026#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13027#(= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {13027#(= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {13028#(and (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (= downsweep_~n |downsweep_#in~n|) (<= 1 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} assume !(~right~1 < ~n); {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} is VALID [2022-04-28 10:46:03,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {13029#(and (= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) downsweep_~n) (<= 1 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} is VALID [2022-04-28 10:46:03,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {13030#(and (= downsweep_~n |downsweep_#in~n|) (<= (* downsweep_~space 4) downsweep_~n))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-28 10:46:03,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} is VALID [2022-04-28 10:46:03,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {13031#(and (= downsweep_~n |downsweep_#in~n|) (<= 4 downsweep_~n))} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,248 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-28 10:46:03,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-28 10:46:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:46:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:03,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416873853] [2022-04-28 10:46:03,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416873853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:46:03,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974665664] [2022-04-28 10:46:03,250 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:46:03,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:03,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:03,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:46:03,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 10:46:03,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:46:03,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:03,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:46:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:03,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:03,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-28 10:46:03,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,907 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-28 10:46:03,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13135#(<= main_~i~1 0)} is VALID [2022-04-28 10:46:03,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {13135#(<= main_~i~1 0)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13135#(<= main_~i~1 0)} is VALID [2022-04-28 10:46:03,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {13135#(<= main_~i~1 0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:03,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:03,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-28 10:46:03,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 2)} assume !(~i~1 < ~n~0); {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,911 INFO L272 TraceCheckUtils]: 39: Hoare triple {13003#(<= main_~n~0 2)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-28 10:46:03,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:03,913 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13003#(<= main_~n~0 2)} #152#return; {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {13003#(<= main_~n~0 2)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13003#(<= main_~n~0 2)} is VALID [2022-04-28 10:46:03,913 INFO L272 TraceCheckUtils]: 50: Hoare triple {13003#(<= main_~n~0 2)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {12976#true} is VALID [2022-04-28 10:46:03,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13190#(<= downsweep_~n |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {13190#(<= downsweep_~n |downsweep_#in~n|)} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13194#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} is VALID [2022-04-28 10:46:03,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {13194#(and (<= downsweep_~n |downsweep_#in~n|) (<= (* 2 downsweep_~space) (+ downsweep_~right~1 1)) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} is VALID [2022-04-28 10:46:03,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} assume !(~right~1 < ~n); {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} is VALID [2022-04-28 10:46:03,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {13198#(and (< (* 2 downsweep_~space) (+ |downsweep_#in~n| 1)) (< 0 downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13205#(and (< downsweep_~space (+ (div (div |downsweep_#in~n| 2) 2) 1)) (< 0 (div |downsweep_#in~n| 2)))} is VALID [2022-04-28 10:46:03,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {13205#(and (< downsweep_~space (+ (div (div |downsweep_#in~n| 2) 2) 1)) (< 0 (div |downsweep_#in~n| 2)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:03,919 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13003#(<= main_~n~0 2)} #154#return; {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-28 10:46:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:46:03,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:08,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {12977#false} assume !false; {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {12977#false} assume 0 == ~cond; {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {12977#false} ~cond := #in~cond; {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L272 TraceCheckUtils]: 66: Hoare triple {12977#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {12977#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {12977#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {12977#false} is VALID [2022-04-28 10:46:08,980 INFO L272 TraceCheckUtils]: 63: Hoare triple {12977#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {12977#false} is VALID [2022-04-28 10:46:08,981 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13032#(<= 4 |downsweep_#in~n|)} {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} #154#return; {12977#false} is VALID [2022-04-28 10:46:08,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume true; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~space > 0); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !(~right~1 < ~n); {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {13032#(<= 4 |downsweep_#in~n|)} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {13291#(or (<= 4 |downsweep_#in~n|) (not (< 0 downsweep_~space)))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13032#(<= 4 |downsweep_#in~n|)} is VALID [2022-04-28 10:46:08,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13291#(or (<= 4 |downsweep_#in~n|) (not (< 0 downsweep_~space)))} is VALID [2022-04-28 10:46:08,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} assume !(~right~1 < ~n); {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:46:08,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {13302#(or (<= (div downsweep_~space 2) 0) (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {13295#(or (<= (div downsweep_~space 2) 0) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:46:08,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {13306#(or (<= (div (* (- 1) (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2))) (- 2)) 1) (<= 4 |downsweep_#in~n|))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {13302#(or (<= (div downsweep_~space 2) 0) (not (< downsweep_~right~1 downsweep_~n)) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:46:08,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {13306#(or (<= (div (* (- 1) (div (+ (- 1) (* (- 1) downsweep_~n)) (- 2))) (- 2)) 1) (<= 4 |downsweep_#in~n|))} is VALID [2022-04-28 10:46:08,987 INFO L272 TraceCheckUtils]: 50: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {12976#true} is VALID [2022-04-28 10:46:08,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-28 10:46:08,988 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12976#true} {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} #152#return; {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-28 10:46:08,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {12976#true} #res := ~space~0; {12976#true} is VALID [2022-04-28 10:46:08,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {12976#true} assume !(~space~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:08,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {12976#true} ~space~0 := 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:08,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {12976#true} assume !(~left~0 < ~n); {12976#true} is VALID [2022-04-28 10:46:08,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {12976#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {12976#true} is VALID [2022-04-28 10:46:08,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {12976#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {12976#true} is VALID [2022-04-28 10:46:08,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {12976#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {12976#true} is VALID [2022-04-28 10:46:08,989 INFO L272 TraceCheckUtils]: 39: Hoare triple {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {12976#true} is VALID [2022-04-28 10:46:08,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {13346#(<= (div (+ (- 1) (div (+ (* (- 1) main_~i~1) (- 3)) 2)) (- 2)) 2)} assume !(~i~1 < ~n~0); {13269#(<= (div (* (- 1) (div (+ (- 1) (* (- 1) main_~n~0)) (- 2))) (- 2)) 1)} is VALID [2022-04-28 10:46:08,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {13002#(<= main_~i~1 2)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13346#(<= (div (+ (- 1) (div (+ (* (- 1) main_~i~1) (- 3)) 2)) (- 2)) 2)} is VALID [2022-04-28 10:46:08,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {13002#(<= main_~i~1 2)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13002#(<= main_~i~1 2)} is VALID [2022-04-28 10:46:08,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {13001#(<= main_~i~1 1)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {13002#(<= main_~i~1 2)} is VALID [2022-04-28 10:46:08,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {13001#(<= main_~i~1 1)} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {12976#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {13001#(<= main_~i~1 1)} is VALID [2022-04-28 10:46:08,992 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12976#true} {12976#true} #150#return; {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L272 TraceCheckUtils]: 29: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {12976#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12976#true} {12976#true} #148#return; {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {12976#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L272 TraceCheckUtils]: 24: Hoare triple {12976#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:08,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {12976#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12976#true} {12976#true} #146#return; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L272 TraceCheckUtils]: 18: Hoare triple {12976#true} call assume_abort_if_not(#t~ret14); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {12976#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12976#true} {12976#true} #144#return; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {12976#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} ~x := #in~x; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L272 TraceCheckUtils]: 11: Hoare triple {12976#true} call #t~ret14 := is_pow2(~n~0); {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12976#true} {12976#true} #142#return; {12976#true} is VALID [2022-04-28 10:46:08,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} assume !(0 == ~cond); {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} ~cond := #in~cond; {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {12976#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} call #t~ret20 := main(); {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} #160#return; {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} assume true; {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} call ULTIMATE.init(); {12976#true} is VALID [2022-04-28 10:46:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:46:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974665664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:46:08,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:46:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 25 [2022-04-28 10:46:08,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064675792] [2022-04-28 10:46:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064675792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:08,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:46:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194318454] [2022-04-28 10:46:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2022-04-28 10:46:08,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:08,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:46:09,044 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-28 10:46:09,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:46:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:46:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:46:09,045 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:46:11,253 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-28 10:46:15,562 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-28 10:46:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:19,361 INFO L93 Difference]: Finished difference Result 127 states and 153 transitions. [2022-04-28 10:46:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:46:19,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2022-04-28 10:46:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:46:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-04-28 10:46:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:46:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-04-28 10:46:19,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 104 transitions. [2022-04-28 10:46:19,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:19,485 INFO L225 Difference]: With dead ends: 127 [2022-04-28 10:46:19,485 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 10:46:19,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:46:19,486 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:19,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 382 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 10:46:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 10:46:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2022-04-28 10:46:19,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:19,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 10:46:19,841 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 10:46:19,841 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 10:46:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:19,844 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-28 10:46:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-28 10:46:19,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:19,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:19,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Second operand 115 states. [2022-04-28 10:46:19,845 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Second operand 115 states. [2022-04-28 10:46:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:19,848 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-28 10:46:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-28 10:46:19,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:19,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:19,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:19,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 10:46:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-04-28 10:46:19,851 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 70 [2022-04-28 10:46:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:19,851 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-04-28 10:46:19,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:46:19,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 121 transitions. [2022-04-28 10:46:20,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-04-28 10:46:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 10:46:20,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:20,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:20,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 10:46:20,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 10:46:20,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -495926943, now seen corresponding path program 1 times [2022-04-28 10:46:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:20,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033679920] [2022-04-28 10:46:20,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:46:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -495926943, now seen corresponding path program 2 times [2022-04-28 10:46:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228470027] [2022-04-28 10:46:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:46:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-28 10:46:20,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-28 10:46:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:46:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-28 10:46:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:46:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~x := #in~x; {14223#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-28 10:46:20,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {14223#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} is VALID [2022-04-28 10:46:20,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-28 10:46:20,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} assume true; {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-28 10:46:20,687 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} {14172#true} #144#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:46:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #146#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:46:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-28 10:46:20,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #148#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:46:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-28 10:46:20,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #150#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 10:46:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14172#true} is VALID [2022-04-28 10:46:20,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14172#true} is VALID [2022-04-28 10:46:20,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {14172#true} assume !(~left~0 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {14172#true} ~space~0 := 2 * ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume !(~space~0 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {14172#true} #res := ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,725 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14172#true} {14173#false} #152#return; {14173#false} is VALID [2022-04-28 10:46:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 10:46:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-28 10:46:20,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14172#true} is VALID [2022-04-28 10:46:20,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14172#true} is VALID [2022-04-28 10:46:20,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {14172#true} assume !(~right~1 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {14172#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-28 10:46:20,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume !(~space > 0); {14172#true} is VALID [2022-04-28 10:46:20,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,734 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14172#true} {14173#false} #154#return; {14173#false} is VALID [2022-04-28 10:46:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 10:46:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14173#false} #158#return; {14173#false} is VALID [2022-04-28 10:46:20,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {14172#true} call ULTIMATE.init(); {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:46:20,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-28 10:46:20,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-28 10:46:20,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {14172#true} call #t~ret20 := main(); {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {14172#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-28 10:46:20,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {14172#true} call #t~ret14 := is_pow2(~n~0); {14172#true} is VALID [2022-04-28 10:46:20,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {14172#true} ~x := #in~x; {14223#(= |is_pow2_#in~x| is_pow2_~x)} is VALID [2022-04-28 10:46:20,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {14223#(= |is_pow2_#in~x| is_pow2_~x)} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} is VALID [2022-04-28 10:46:20,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {14224#(and (= |is_pow2_#in~x| is_pow2_~x) (or (not (<= is_pow2_~x (* 2 (div is_pow2_~x 2)))) (not (<= (div is_pow2_~x 4294967296) 0)) (<= (div is_pow2_~x 2) 0)))} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-28 10:46:20,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} assume true; {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} is VALID [2022-04-28 10:46:20,752 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14225#(or (<= 3 |is_pow2_#in~x|) (<= |is_pow2_#in~x| 1))} {14172#true} #144#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,752 INFO L272 TraceCheckUtils]: 18: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call assume_abort_if_not(#t~ret14); {14172#true} is VALID [2022-04-28 10:46:20,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,753 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #146#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,755 INFO L272 TraceCheckUtils]: 24: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:20,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-28 10:46:20,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,756 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #148#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,757 INFO L272 TraceCheckUtils]: 29: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:20,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14172#true} is VALID [2022-04-28 10:46:20,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,758 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14172#true} {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} #150#return; {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 10:46:20,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {14186#(or (<= 3 main_~n~0) (<= main_~n~0 1))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} is VALID [2022-04-28 10:46:20,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} is VALID [2022-04-28 10:46:20,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {14197#(and (or (<= 3 main_~n~0) (<= main_~n~0 1)) (= main_~i~1 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14198#(or (<= main_~n~0 main_~i~1) (<= (+ main_~i~1 2) main_~n~0))} is VALID [2022-04-28 10:46:20,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {14198#(or (<= main_~n~0 main_~i~1) (<= (+ main_~i~1 2) main_~n~0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14199#(<= (+ main_~i~1 2) main_~n~0)} is VALID [2022-04-28 10:46:20,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {14199#(<= (+ main_~i~1 2) main_~n~0)} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14200#(<= (+ main_~i~1 1) main_~n~0)} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {14200#(<= (+ main_~i~1 1) main_~n~0)} assume !(~i~1 < ~n~0); {14173#false} is VALID [2022-04-28 10:46:20,762 INFO L272 TraceCheckUtils]: 39: Hoare triple {14173#false} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {14172#true} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {14172#true} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {14172#true} assume !(~left~0 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {14172#true} ~space~0 := 2 * ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {14172#true} assume !(~space~0 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {14172#true} #res := ~space~0; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,762 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14172#true} {14173#false} #152#return; {14173#false} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {14173#false} is VALID [2022-04-28 10:46:20,763 INFO L272 TraceCheckUtils]: 50: Hoare triple {14173#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {14172#true} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {14172#true} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {14172#true} assume !(~right~1 < ~n); {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {14172#true} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {14172#true} assume !(~space > 0); {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,763 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14172#true} {14173#false} #154#return; {14173#false} is VALID [2022-04-28 10:46:20,763 INFO L272 TraceCheckUtils]: 59: Hoare triple {14173#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {14173#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L272 TraceCheckUtils]: 62: Hoare triple {14173#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14172#true} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:46:20,764 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14172#true} {14173#false} #158#return; {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#false} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {14173#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14173#false} is VALID [2022-04-28 10:46:20,764 INFO L272 TraceCheckUtils]: 70: Hoare triple {14173#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14173#false} is VALID [2022-04-28 10:46:20,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#false} ~cond := #in~cond; {14173#false} is VALID [2022-04-28 10:46:20,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#false} assume 0 == ~cond; {14173#false} is VALID [2022-04-28 10:46:20,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#false} assume !false; {14173#false} is VALID [2022-04-28 10:46:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:46:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228470027] [2022-04-28 10:46:20,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228470027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:46:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668346044] [2022-04-28 10:46:20,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:20,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:20,768 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:46:20,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 10:46:20,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:46:20,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:20,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 114 conjunts are in the unsatisfiable core [2022-04-28 10:46:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:20,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:20,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-28 10:46:21,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-04-28 10:46:21,140 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-28 10:46:21,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-28 10:46:21,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-04-28 10:46:21,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-04-28 10:46:21,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-04-28 10:46:27,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-04-28 10:46:33,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-04-28 10:46:41,696 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (= (let ((.cse1 (* downsweep_~left~1 4))) (store (let ((.cse0 (store (store .cse2 (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0))) (store .cse0 4 (+ (select .cse0 4) (select .cse0 .cse1)))) .cse1 v_ArrVal_571)) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (= .cse2 (select |c_#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0)))) is different from true [2022-04-28 10:47:02,734 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-04-28 10:47:02,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 175 [2022-04-28 10:47:04,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {14172#true} call ULTIMATE.init(); {14172#true} is VALID [2022-04-28 10:47:04,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {14172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14172#true} {14172#true} #160#return; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {14172#true} call #t~ret20 := main(); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {14172#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {14172#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14172#true} {14172#true} #142#return; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {14172#true} call #t~ret14 := is_pow2(~n~0); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {14172#true} ~x := #in~x; {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {14172#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {14172#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {14172#true} is VALID [2022-04-28 10:47:04,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14172#true} {14172#true} #144#return; {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {14172#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L272 TraceCheckUtils]: 18: Hoare triple {14172#true} call assume_abort_if_not(#t~ret14); {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {14172#true} ~cond := #in~cond; {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {14172#true} assume !(0 == ~cond); {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {14172#true} assume true; {14172#true} is VALID [2022-04-28 10:47:04,671 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14172#true} {14172#true} #146#return; {14172#true} is VALID [2022-04-28 10:47:04,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {14172#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-28 10:47:04,673 INFO L272 TraceCheckUtils]: 24: Hoare triple {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {14303#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|)))} is VALID [2022-04-28 10:47:04,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {14303#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:47:04,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:47:04,675 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14307#(and (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_1|))) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {14299#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {14314#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-28 10:47:04,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {14314#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-28 10:47:04,676 INFO L272 TraceCheckUtils]: 29: Hoare triple {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:04,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} is VALID [2022-04-28 10:47:04,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} assume true; {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} is VALID [2022-04-28 10:47:04,678 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14325#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| ((as const (Array Int Int)) 0)))} {14318#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {14332#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-28 10:47:04,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {14332#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} assume !(~i~1 < ~n~0); {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is VALID [2022-04-28 10:47:04,682 INFO L272 TraceCheckUtils]: 39: Hoare triple {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:04,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {14358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:04,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {14358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {14362#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:04,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {14362#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:05,704 WARN L290 TraceCheckUtils]: 43: Hoare triple {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is UNKNOWN [2022-04-28 10:47:06,578 WARN L290 TraceCheckUtils]: 44: Hoare triple {14366#(and (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= (* 2 upsweep_~space~0) (+ upsweep_~right~0 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {14373#(and (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (<= |upsweep_#in~n| upsweep_~n))} is UNKNOWN [2022-04-28 10:47:06,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {14373#(and (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {14377#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is VALID [2022-04-28 10:47:07,429 WARN L290 TraceCheckUtils]: 46: Hoare triple {14377#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} #res := ~space~0; {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} is UNKNOWN [2022-04-28 10:47:07,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} assume true; {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} is VALID [2022-04-28 10:47:08,117 WARN L284 TraceCheckUtils]: 48: Hoare quadruple {14381#(and (<= |upsweep_#in~n| 2) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))) (= |upsweep_#res| 2))} {14336#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} #152#return; {14388#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} is UNKNOWN [2022-04-28 10:47:08,707 WARN L290 TraceCheckUtils]: 49: Hoare triple {14388#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} is UNKNOWN [2022-04-28 10:47:08,709 INFO L272 TraceCheckUtils]: 50: Hoare triple {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {14226#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:08,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {14226#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14399#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} is VALID [2022-04-28 10:47:08,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {14399#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {14403#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} is VALID [2022-04-28 10:47:08,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {14403#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is VALID [2022-04-28 10:47:10,737 WARN L290 TraceCheckUtils]: 54: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume !(~right~1 < ~n); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-28 10:47:12,639 WARN L290 TraceCheckUtils]: 55: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-28 10:47:14,644 WARN L290 TraceCheckUtils]: 56: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume !(~space > 0); {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-28 10:47:16,374 WARN L290 TraceCheckUtils]: 57: Hoare triple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} assume true; {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} is UNKNOWN [2022-04-28 10:47:18,378 WARN L284 TraceCheckUtils]: 58: Hoare quadruple {14407#(and (< 0 (div |downsweep_#in~space| 2)) (exists ((v_ArrVal_571 Int) (downsweep_~left~1 Int)) (and (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4))))) (+ |downsweep_#in~a.offset| (* downsweep_~left~1 4)) v_ArrVal_571))) (<= (+ downsweep_~left~1 1) (div |downsweep_#in~space| 2)))))} {14392#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (= 2 main_~space~1) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565)) (<= main_~a~0.offset upsweep_~a.offset))))} #154#return; {14423#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset (* downsweep_~left~1 4))))) (+ main_~a~0.offset (* downsweep_~left~1 4)) v_ArrVal_571)) (<= main_~a~0.offset upsweep_~a.offset))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} is UNKNOWN [2022-04-28 10:47:20,382 WARN L272 TraceCheckUtils]: 59: Hoare triple {14423#(and (<= main_~n~0 2) (= main_~a~0.offset 0) (exists ((v_ArrVal_565 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset (* downsweep_~left~1 4))))) (+ main_~a~0.offset (* downsweep_~left~1 4)) v_ArrVal_571)) (<= main_~a~0.offset upsweep_~a.offset))) (not (= main_~a~0.base main_~a0~0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a0~0.base)))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {14427#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a0.base|)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| |check_#in~a.base|)) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_59) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0))))} is UNKNOWN [2022-04-28 10:47:22,385 WARN L290 TraceCheckUtils]: 60: Hoare triple {14427#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a0.base|)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| |check_#in~a.base|)) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_59) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0))))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is UNKNOWN [2022-04-28 10:47:24,389 WARN L290 TraceCheckUtils]: 61: Hoare triple {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is UNKNOWN [2022-04-28 10:47:26,443 WARN L272 TraceCheckUtils]: 62: Hoare triple {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is UNKNOWN [2022-04-28 10:47:28,467 WARN L290 TraceCheckUtils]: 63: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} ~cond := #in~cond; {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is UNKNOWN [2022-04-28 10:47:28,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} assume !(0 == ~cond); {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is VALID [2022-04-28 10:47:30,622 WARN L290 TraceCheckUtils]: 65: Hoare triple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} assume true; {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} is UNKNOWN [2022-04-28 10:47:30,624 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14438#(exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1))))} {14431#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} #158#return; {14451#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)))) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} is VALID [2022-04-28 10:47:32,662 WARN L290 TraceCheckUtils]: 67: Hoare triple {14451#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (not (= check_~a.base check_~a0.base)) (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_ArrVal_571 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)) (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= downsweep_~left~1 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)))) (= check_~i~0 0) (= check_~sum~0 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)) (= check_~a.offset 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {14455#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (= (+ check_~sum~0 (* (- 1) (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))))) 0) (not (= check_~a.base check_~a0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))) (= check_~a.offset 0))} is UNKNOWN [2022-04-28 10:47:34,669 WARN L290 TraceCheckUtils]: 68: Hoare triple {14455#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (= (+ check_~sum~0 (* (- 1) (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))))) 0) (not (= check_~a.base check_~a0.base)) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14459#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 1) (= check_~a.offset 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) check_~a0.offset)) check_~sum~0) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))))} is UNKNOWN [2022-04-28 10:47:34,677 INFO L290 TraceCheckUtils]: 69: Hoare triple {14459#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (<= downsweep_~left~1 0) (= (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) (select |#memory_int| check_~a.base)) (<= check_~n v_main_~n~0_BEFORE_CALL_59))) (exists ((v_ArrVal_573 Int) (v_ArrVal_572 Int) (v_check_~a0.base_BEFORE_CALL_1 Int) (v_check_~a.base_BEFORE_CALL_1 Int) (v_downsweep_~left~1_29 Int) (v_main_~n~0_BEFORE_CALL_60 Int) (v_upsweep_~a.offset_36 Int) (v_upsweep_~right~0_29 Int)) (and (<= 0 v_upsweep_~a.offset_36) (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_1) (store (store (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) (* v_downsweep_~left~1_29 4)) (select (store (store ((as const (Array Int Int)) 0) (+ v_upsweep_~a.offset_36 (* v_upsweep_~right~0_29 4)) v_ArrVal_572) (+ (- 4) (* v_main_~n~0_BEFORE_CALL_60 4)) 0) 4))) (* v_downsweep_~left~1_29 4) v_ArrVal_573)) (not (= v_check_~a0.base_BEFORE_CALL_1 v_check_~a.base_BEFORE_CALL_1)) (<= v_downsweep_~left~1_29 0) (<= v_main_~n~0_BEFORE_CALL_60 2) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a0.base_BEFORE_CALL_1)) (<= 1 v_upsweep_~right~0_29))) (= check_~i~0 1) (= check_~a.offset 0) (exists ((check_~a0.base Int) (check_~a0.offset Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) check_~a0.offset)) check_~sum~0) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a0.base)))))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {14463#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (= (select (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) 4) |check_#t~mem11|) (< 1 v_main_~n~0_BEFORE_CALL_59) (<= downsweep_~left~1 0))) (exists ((check_~a0.offset Int)) (= (+ (* (- 1) (select ((as const (Array Int Int)) 0) check_~a0.offset)) check_~sum~0) 0)))} is VALID [2022-04-28 10:47:34,679 INFO L272 TraceCheckUtils]: 70: Hoare triple {14463#(and (exists ((v_ArrVal_565 Int) (v_main_~n~0_BEFORE_CALL_59 Int) (upsweep_~a.offset Int) (v_ArrVal_571 Int) (downsweep_~left~1 Int) (upsweep_~right~0 Int)) (and (<= 0 upsweep_~a.offset) (<= v_main_~n~0_BEFORE_CALL_59 2) (<= 1 upsweep_~right~0) (= (select (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) v_ArrVal_565) (+ (* v_main_~n~0_BEFORE_CALL_59 4) (- 4)) 0) (* downsweep_~left~1 4)))) (* downsweep_~left~1 4) v_ArrVal_571) 4) |check_#t~mem11|) (< 1 v_main_~n~0_BEFORE_CALL_59) (<= downsweep_~left~1 0))) (exists ((check_~a0.offset Int)) (= (+ (* (- 1) (select ((as const (Array Int Int)) 0) check_~a0.offset)) check_~sum~0) 0)))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {14467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:34,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {14467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:34,680 INFO L290 TraceCheckUtils]: 72: Hoare triple {14471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14173#false} is VALID [2022-04-28 10:47:34,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#false} assume !false; {14173#false} is VALID [2022-04-28 10:47:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2022-04-28 10:47:34,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:47:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668346044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:47:35,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:47:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-04-28 10:47:35,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:35,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033679920] [2022-04-28 10:47:35,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033679920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:35,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:35,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:47:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777549670] [2022-04-28 10:47:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-04-28 10:47:35,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:35,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:47:35,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:35,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:47:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:47:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1776, Unknown=10, NotChecked=84, Total=1980 [2022-04-28 10:47:35,462 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:47:37,875 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-28 10:47:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:40,144 INFO L93 Difference]: Finished difference Result 185 states and 226 transitions. [2022-04-28 10:47:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:47:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-04-28 10:47:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:47:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-28 10:47:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:47:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-04-28 10:47:40,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 129 transitions. [2022-04-28 10:47:40,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:40,278 INFO L225 Difference]: With dead ends: 185 [2022-04-28 10:47:40,278 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 10:47:40,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=190, Invalid=2884, Unknown=10, NotChecked=108, Total=3192 [2022-04-28 10:47:40,280 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:40,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 63 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 10:47:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 10:47:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-04-28 10:47:40,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:40,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-28 10:47:40,627 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-28 10:47:40,627 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-28 10:47:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:40,629 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-28 10:47:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-28 10:47:40,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:40,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:40,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) Second operand 123 states. [2022-04-28 10:47:40,630 INFO L87 Difference]: Start difference. First operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) Second operand 123 states. [2022-04-28 10:47:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:40,633 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-28 10:47:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-28 10:47:40,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:40,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:40,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:40,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.206896551724138) internal successors, (105), 90 states have internal predecessors, (105), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-04-28 10:47:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-04-28 10:47:40,637 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 74 [2022-04-28 10:47:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:40,637 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-04-28 10:47:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:47:40,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 141 transitions. [2022-04-28 10:47:40,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-04-28 10:47:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 10:47:40,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:40,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:41,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:47:41,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:41,174 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1541127366, now seen corresponding path program 11 times [2022-04-28 10:47:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:41,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245402702] [2022-04-28 10:47:41,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1541127366, now seen corresponding path program 12 times [2022-04-28 10:47:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:41,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011692598] [2022-04-28 10:47:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:47:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-28 10:47:41,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-28 10:47:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:47:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:41,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:41,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-28 10:47:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:47:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-28 10:47:41,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-28 10:47:41,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-28 10:47:41,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,265 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-28 10:47:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:47:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:41,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:41,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-28 10:47:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:47:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:41,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-28 10:47:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:47:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:41,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-28 10:47:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 10:47:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {15430#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !(~left~0 < ~n); {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {15431#(<= 2 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {15432#(<= 4 upsweep_~space~0)} assume !(~space~0 < ~n); {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {15432#(<= 4 upsweep_~space~0)} #res := ~space~0; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-28 10:47:41,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {15433#(<= 4 |upsweep_#res|)} assume true; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-28 10:47:41,375 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15433#(<= 4 |upsweep_#res|)} {15380#true} #152#return; {15418#(<= 4 |main_#t~ret19|)} is VALID [2022-04-28 10:47:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-28 10:47:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~right~1 < ~n); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} is VALID [2022-04-28 10:47:41,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:41,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:41,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15419#(<= 4 main_~space~1)} #154#return; {15381#false} is VALID [2022-04-28 10:47:41,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:47:41,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-28 10:47:41,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-28 10:47:41,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-28 10:47:41,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:41,556 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:41,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:41,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,557 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-28 10:47:41,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:41,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:41,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:41,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-28 10:47:41,560 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:41,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {15430#(<= 1 upsweep_~space~0)} assume !(~left~0 < ~n); {15430#(<= 1 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {15430#(<= 1 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {15431#(<= 2 upsweep_~space~0)} assume !(~left~0 < ~n); {15431#(<= 2 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {15431#(<= 2 upsweep_~space~0)} ~space~0 := 2 * ~space~0; {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {15432#(<= 4 upsweep_~space~0)} assume !(~space~0 < ~n); {15432#(<= 4 upsweep_~space~0)} is VALID [2022-04-28 10:47:41,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {15432#(<= 4 upsweep_~space~0)} #res := ~space~0; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-28 10:47:41,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {15433#(<= 4 |upsweep_#res|)} assume true; {15433#(<= 4 |upsweep_#res|)} is VALID [2022-04-28 10:47:41,565 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15433#(<= 4 |upsweep_#res|)} {15380#true} #152#return; {15418#(<= 4 |main_#t~ret19|)} is VALID [2022-04-28 10:47:41,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {15418#(<= 4 |main_#t~ret19|)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15419#(<= 4 main_~space~1)} is VALID [2022-04-28 10:47:41,566 INFO L272 TraceCheckUtils]: 57: Hoare triple {15419#(<= 4 main_~space~1)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15429#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:47:41,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {15429#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} assume !(~right~1 < ~n); {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} is VALID [2022-04-28 10:47:41,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {15434#(or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} is VALID [2022-04-28 10:47:41,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {15435#(<= |downsweep_#in~space| (+ (* downsweep_~space 4) 3))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:41,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:41,574 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15419#(<= 4 main_~space~1)} #154#return; {15381#false} is VALID [2022-04-28 10:47:41,574 INFO L272 TraceCheckUtils]: 66: Hoare triple {15381#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15381#false} is VALID [2022-04-28 10:47:41,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {15381#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15381#false} is VALID [2022-04-28 10:47:41,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {15381#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-28 10:47:41,574 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-28 10:47:41,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-28 10:47:41,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-28 10:47:41,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-28 10:47:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:47:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:41,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011692598] [2022-04-28 10:47:41,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011692598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:47:41,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725814699] [2022-04-28 10:47:41,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:47:41,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:41,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:41,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:47:41,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 10:47:41,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:47:41,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:41,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:47:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:41,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:47:43,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15380#true} is VALID [2022-04-28 10:47:43,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-28 10:47:43,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-28 10:47:43,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-28 10:47:43,905 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:43,906 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,907 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15380#true} is VALID [2022-04-28 10:47:43,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {15566#(and (<= 1 upsweep_~space~0) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !(~left~0 < ~n); {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {15582#(and (<= 1 (div upsweep_~space~0 2)) (<= |upsweep_#in~n| upsweep_~n))} ~space~0 := 2 * ~space~0; {15595#(and (<= 1 (div (div upsweep_~space~0 2) 2)) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:47:43,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {15595#(and (<= 1 (div (div upsweep_~space~0 2) 2)) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {15599#(and (<= |upsweep_#in~n| upsweep_~space~0) (<= 1 (div (div upsweep_~space~0 2) 2)))} is VALID [2022-04-28 10:47:43,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {15599#(and (<= |upsweep_#in~n| upsweep_~space~0) (<= 1 (div (div upsweep_~space~0 2) 2)))} #res := ~space~0; {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} is VALID [2022-04-28 10:47:43,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} assume true; {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} is VALID [2022-04-28 10:47:43,915 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15603#(and (<= 1 (div (div |upsweep_#res| 2) 2)) (<= |upsweep_#in~n| |upsweep_#res|))} {15380#true} #152#return; {15610#(and (<= 1 (div (div |main_#t~ret19| 2) 2)) (<= main_~n~0 |main_#t~ret19|))} is VALID [2022-04-28 10:47:43,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {15610#(and (<= 1 (div (div |main_#t~ret19| 2) 2)) (<= main_~n~0 |main_#t~ret19|))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} is VALID [2022-04-28 10:47:43,915 INFO L272 TraceCheckUtils]: 57: Hoare triple {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15380#true} is VALID [2022-04-28 10:47:43,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15621#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} is VALID [2022-04-28 10:47:43,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {15621#(or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (<= (div |downsweep_#in~space| 2) downsweep_~space)) (<= (+ (div |downsweep_#in~space| 2) 1) downsweep_~space))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-28 10:47:43,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-28 10:47:43,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} assume !(~right~1 < ~n); {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} is VALID [2022-04-28 10:47:43,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {15625#(and (< 0 downsweep_~space) (<= (div |downsweep_#in~space| 2) downsweep_~space))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15635#(and (< (div (+ (* (- 1) (div |downsweep_#in~space| 2)) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} is VALID [2022-04-28 10:47:43,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {15635#(and (< (div (+ (* (- 1) (div |downsweep_#in~space| 2)) 1) (- 2)) (+ downsweep_~space 1)) (< 0 (+ downsweep_~space 1)))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:43,921 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:43,922 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15614#(and (<= main_~n~0 main_~space~1) (<= 1 (div (div main_~space~1 2) 2)))} #154#return; {15381#false} is VALID [2022-04-28 10:47:43,922 INFO L272 TraceCheckUtils]: 66: Hoare triple {15381#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15381#false} is VALID [2022-04-28 10:47:43,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {15381#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15381#false} is VALID [2022-04-28 10:47:43,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {15381#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-28 10:47:43,922 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-28 10:47:43,923 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-28 10:47:43,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-28 10:47:43,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-28 10:47:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:47:43,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:47:54,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {15381#false} assume !false; {15381#false} is VALID [2022-04-28 10:47:54,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {15381#false} assume 0 == ~cond; {15381#false} is VALID [2022-04-28 10:47:54,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {15381#false} ~cond := #in~cond; {15381#false} is VALID [2022-04-28 10:47:54,432 INFO L272 TraceCheckUtils]: 69: Hoare triple {15381#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {15381#false} is VALID [2022-04-28 10:47:54,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {15678#(not (< check_~i~0 check_~n))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {15381#false} is VALID [2022-04-28 10:47:54,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {15682#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {15678#(not (< check_~i~0 check_~n))} is VALID [2022-04-28 10:47:54,434 INFO L272 TraceCheckUtils]: 66: Hoare triple {15686#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {15682#(<= |check_#in~n| 0)} is VALID [2022-04-28 10:47:54,435 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {15436#(<= |downsweep_#in~space| 3)} {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} #154#return; {15686#(<= main_~n~0 0)} is VALID [2022-04-28 10:47:54,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {15436#(<= |downsweep_#in~space| 3)} assume true; {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:54,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {15700#(or (<= |downsweep_#in~space| 3) (< 0 downsweep_~space))} assume !(~space > 0); {15436#(<= |downsweep_#in~space| 3)} is VALID [2022-04-28 10:47:54,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15700#(or (<= |downsweep_#in~space| 3) (< 0 downsweep_~space))} is VALID [2022-04-28 10:47:54,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} assume !(~right~1 < ~n); {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-28 10:47:54,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-28 10:47:54,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {15714#(or (< 0 (div downsweep_~space 2)) (not (< 0 downsweep_~space)) (<= |downsweep_#in~space| 3))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {15704#(or (< 0 (div downsweep_~space 2)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-28 10:47:54,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {15714#(or (< 0 (div downsweep_~space 2)) (not (< 0 downsweep_~space)) (<= |downsweep_#in~space| 3))} is VALID [2022-04-28 10:47:54,438 INFO L272 TraceCheckUtils]: 57: Hoare triple {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {15380#true} is VALID [2022-04-28 10:47:54,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {15721#(or (<= main_~n~0 0) (<= 0 (+ (div (+ (- 1) (div (+ |main_#t~ret19| (- 6)) 2)) 2) 1)))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {15690#(or (<= main_~n~0 0) (<= 0 (div (+ (- 1) (div (+ (- 2) main_~space~1) 2)) 2)))} is VALID [2022-04-28 10:47:54,440 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} {15380#true} #152#return; {15721#(or (<= main_~n~0 0) (<= 0 (+ (div (+ (- 1) (div (+ |main_#t~ret19| (- 6)) 2)) 2) 1)))} is VALID [2022-04-28 10:47:54,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} assume true; {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} is VALID [2022-04-28 10:47:54,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {15735#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} #res := ~space~0; {15728#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 2 (div (+ (- 1) (div (+ |upsweep_#res| (- 10)) 2)) 2))))} is VALID [2022-04-28 10:47:54,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {15739#(or (<= |upsweep_#in~n| 0) (< upsweep_~space~0 upsweep_~n) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} assume !(~space~0 < ~n); {15735#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} is VALID [2022-04-28 10:47:54,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} ~space~0 := 2 * ~space~0; {15739#(or (<= |upsweep_#in~n| 0) (< upsweep_~space~0 upsweep_~n) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 14) upsweep_~space~0) 2)) 2))))} is VALID [2022-04-28 10:47:54,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !(~left~0 < ~n); {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-28 10:47:54,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-28 10:47:54,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-28 10:47:54,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} ~space~0 := 2 * ~space~0; {15743#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 0 (+ (div (+ upsweep_~space~0 (- 10)) 2) 4)))} is VALID [2022-04-28 10:47:54,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !(~left~0 < ~n); {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:47:54,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:47:54,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:47:54,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:47:54,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {15380#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {15756#(or (<= |upsweep_#in~n| 0) (<= 0 (+ 4 (div (+ (- 1) (div (+ (- 18) upsweep_~n) 2)) 2))) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:47:54,453 INFO L272 TraceCheckUtils]: 41: Hoare triple {15380#true} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {15380#true} assume !(~i~1 < ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#true} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#true} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15380#true} {15380#true} #150#return; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L272 TraceCheckUtils]: 29: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {15380#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15380#true} {15380#true} #148#return; {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {15380#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L272 TraceCheckUtils]: 24: Hoare triple {15380#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {15380#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15380#true} {15380#true} #146#return; {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:54,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L272 TraceCheckUtils]: 18: Hoare triple {15380#true} call assume_abort_if_not(#t~ret14); {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {15380#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15380#true} {15380#true} #144#return; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {15380#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {15380#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {15380#true} ~x := #in~x; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {15380#true} call #t~ret14 := is_pow2(~n~0); {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15380#true} {15380#true} #142#return; {15380#true} is VALID [2022-04-28 10:47:54,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {15380#true} assume !(0 == ~cond); {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#true} ~cond := #in~cond; {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {15380#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {15380#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {15380#true} call #t~ret20 := main(); {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15380#true} {15380#true} #160#return; {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {15380#true} assume true; {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {15380#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15380#true} is VALID [2022-04-28 10:47:54,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {15380#true} call ULTIMATE.init(); {15380#true} is VALID [2022-04-28 10:47:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:47:54,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725814699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:47:54,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:47:54,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2022-04-28 10:47:54,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:54,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245402702] [2022-04-28 10:47:54,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245402702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:54,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:54,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:47:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175559585] [2022-04-28 10:47:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-04-28 10:47:54,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:54,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:47:54,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:47:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:47:54,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:47:54,522 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:47:56,896 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-28 10:47:59,043 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-28 10:48:01,192 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-28 10:48:05,485 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-28 10:48:07,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 10:48:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:12,423 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-28 10:48:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:48:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-04-28 10:48:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:48:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 106 transitions. [2022-04-28 10:48:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:48:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 106 transitions. [2022-04-28 10:48:12,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 106 transitions. [2022-04-28 10:48:12,553 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-28 10:48:12,555 INFO L225 Difference]: With dead ends: 180 [2022-04-28 10:48:12,556 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 10:48:12,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=2023, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:48:12,557 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 38 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:12,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 64 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 678 Invalid, 5 Unknown, 0 Unchecked, 11.4s Time] [2022-04-28 10:48:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 10:48:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2022-04-28 10:48:13,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:13,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-28 10:48:13,067 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-28 10:48:13,067 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-28 10:48:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:13,071 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-04-28 10:48:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2022-04-28 10:48:13,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:13,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:13,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Second operand 158 states. [2022-04-28 10:48:13,072 INFO L87 Difference]: Start difference. First operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Second operand 158 states. [2022-04-28 10:48:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:13,076 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2022-04-28 10:48:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2022-04-28 10:48:13,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:13,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:13,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:13,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 104 states have internal predecessors, (122), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-04-28 10:48:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2022-04-28 10:48:13,080 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 73 [2022-04-28 10:48:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:13,080 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2022-04-28 10:48:13,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 10:48:13,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 162 transitions. [2022-04-28 10:48:13,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-28 10:48:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 10:48:13,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:13,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:13,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:48:13,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:48:13,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1213658525, now seen corresponding path program 1 times [2022-04-28 10:48:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458756617] [2022-04-28 10:48:13,709 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1213658525, now seen corresponding path program 2 times [2022-04-28 10:48:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:13,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505209162] [2022-04-28 10:48:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:48:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-28 10:48:14,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:14,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-28 10:48:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:48:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:14,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:14,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:14,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-28 10:48:14,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:48:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-28 10:48:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-28 10:48:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:14,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:14,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:14,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-28 10:48:14,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-28 10:48:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:48:14,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:48:14,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-28 10:48:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 10:48:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:14,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:48:14,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:48:14,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-28 10:48:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 10:48:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:15,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:48:15,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-28 10:48:15,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:15,220 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 10:48:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:17,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} is VALID [2022-04-28 10:48:17,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} is VALID [2022-04-28 10:48:17,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,168 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-28 10:48:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:17,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:17,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:17,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:48:17,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {16862#true} call ULTIMATE.init(); {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:48:17,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {16927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-28 10:48:17,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-28 10:48:17,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {16862#true} call #t~ret20 := main(); {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {16862#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {16862#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {16862#true} call #t~ret14 := is_pow2(~n~0); {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-28 10:48:17,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {16862#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L272 TraceCheckUtils]: 19: Hoare triple {16862#true} call assume_abort_if_not(#t~ret14); {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,175 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-28 10:48:17,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {16862#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-28 10:48:17,185 INFO L272 TraceCheckUtils]: 25: Hoare triple {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:48:17,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:48:17,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:48:17,187 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16929#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-28 10:48:17,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-28 10:48:17,189 INFO L272 TraceCheckUtils]: 30: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:48:17,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:48:17,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:48:17,192 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16930#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-28 10:48:17,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {16891#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a0~0.base) (+ main_~a0~0.offset (* main_~i~1 4))) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {16891#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a0~0.base) (+ main_~a0~0.offset (* main_~i~1 4))) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {16892#(and (<= 1 main_~i~1) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {16892#(and (<= 1 main_~i~1) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {16893#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {16893#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 1) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {16894#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {16894#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= main_~i~1 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !(~i~1 < ~n~0); {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,196 INFO L272 TraceCheckUtils]: 40: Hoare triple {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:48:17,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:48:17,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {16931#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-28 10:48:17,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {16932#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {16933#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {16934#(or (and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 2) (<= 2 upsweep_~space~0)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:48:17,204 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16935#(or (and (= |#memory_int| |old(#memory_int)|) (<= |upsweep_#res| 2) (<= 2 |upsweep_#res|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {16895#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (<= 2 main_~n~0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,206 INFO L290 TraceCheckUtils]: 50: Hoare triple {16905#(and (<= main_~n~0 2) (<= (* |main_#t~ret19| 2) 4) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 |main_#t~ret19|) (not (= main_~a~0.base main_~a0~0.base)) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* |main_#t~ret19| 2) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= main_~a0~0.offset 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,208 INFO L272 TraceCheckUtils]: 51: Hoare triple {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:48:17,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} is VALID [2022-04-28 10:48:17,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {16936#(and (= downsweep_~n |downsweep_#in~n|) (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (<= |downsweep_#in~a.offset| downsweep_~a.offset) (= (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 4)) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base))) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0))))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4))) 0))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} is VALID [2022-04-28 10:48:17,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {16937#(and (or (not (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4))) (and (or (and (= downsweep_~a.base |downsweep_#in~a.base|) (or (and (or (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2))) (<= 0 |downsweep_#in~space|)) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= |downsweep_#in~space| (* 2 (div |downsweep_#in~space| 2)))) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)) (not (<= 0 |downsweep_#in~space|)))) (or (and (<= (+ (* (div |downsweep_#in~space| 2) 4) downsweep_~a.offset (* downsweep_~right~1 4) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset| (* downsweep_~space 8))) (= (store (select |#memory_int| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) (select (select |old(#memory_int)| downsweep_~a.base) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)))) (select |old(#memory_int)| downsweep_~a.base)) (<= (+ |downsweep_#in~a.offset| 4) (+ downsweep_~a.offset (* downsweep_~right~1 4)))) (<= (+ |downsweep_#in~space| 1) 0)) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (select |#memory_int| downsweep_~a.base)))) (not (= |downsweep_#in~a.offset| 0))) (= (select (select |#memory_int| downsweep_~a.base) (+ downsweep_~a.offset (* downsweep_~right~1 4))) 0))) (or (= (* downsweep_~n 4) (+ (* downsweep_~right~1 4) 4)) (and (= downsweep_~n |downsweep_#in~n|) (or (<= 1 downsweep_~right~1) (<= downsweep_~n (+ downsweep_~right~1 1))))))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {16938#(or (and (<= 3 downsweep_~n) (= downsweep_~n |downsweep_#in~n|)) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} assume !(~right~1 < ~n); {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {16939#(or (<= 3 |downsweep_#in~n|) (and (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (* (div |downsweep_#in~space| 2) 4) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= (+ 5 (* (div |downsweep_#in~space| 2) 4)) (+ (* |downsweep_#in~space| 2) (* downsweep_~space 4) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (<= (+ |downsweep_#in~space| (* 2 downsweep_~space)) (+ (* 2 (div |downsweep_#in~space| 2)) 1))) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2) 1) 0) (not (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)) (not (<= 0 |downsweep_#in~space|))) (and (= (+ (* (- 1) downsweep_~space) (div |downsweep_#in~space| 2)) 0) (or (<= 0 |downsweep_#in~space|) (= (+ |downsweep_#in~space| (* (- 2) (div |downsweep_#in~space| 2))) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (not (= |downsweep_#in~a.offset| 0)))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume !(~space > 0); {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} assume true; {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} is VALID [2022-04-28 10:48:17,232 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16940#(or (and (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= (select (select |#memory_int| |downsweep_#in~a.base|) 4) 0) (and (<= (+ (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 4) (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|)))) (<= |downsweep_#in~space| 1) (<= 5 (+ (* |downsweep_#in~space| 2) |downsweep_#in~a.offset|)) (not (= ((as const (Array Int Int)) 0) (store (select |old(#memory_int)| |downsweep_#in~a.base|) (@diff (select |old(#memory_int)| |downsweep_#in~a.base|) ((as const (Array Int Int)) 0)) 0)))) (or (= |#memory_int| |old(#memory_int)|) (= |downsweep_#in~a.base| (@diff |old(#memory_int)| |#memory_int|)))) (<= 3 |downsweep_#in~n|) (not (= |downsweep_#in~a.offset| 0)))} {16906#(and (<= main_~n~0 2) (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= main_~a~0.offset 0) (<= 2 main_~space~1) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= (* 2 main_~space~1) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (<= (* main_~space~1 4) 8) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:48:17,233 INFO L272 TraceCheckUtils]: 60: Hoare triple {16915#(and (= (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset) 0) (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {16916#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a0.base|) 0) 0) (= |check_#in~a0.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 4) 0))} is VALID [2022-04-28 10:48:17,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {16916#(and (= |check_#in~a.offset| 0) (= (select (select |#memory_int| |check_#in~a0.base|) 0) 0) (= |check_#in~a0.offset| 0) (= (select (select |#memory_int| |check_#in~a.base|) 4) 0))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:48:17,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:48:17,234 INFO L272 TraceCheckUtils]: 63: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {16862#true} is VALID [2022-04-28 10:48:17,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:48:17,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:48:17,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:48:17,235 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16862#true} {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:48:17,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {16917#(and (= (select (select |#memory_int| check_~a0.base) (+ check_~a0.offset (* check_~i~0 4))) 0) (= check_~a0.offset 0) (= check_~i~0 0) (= (select (select |#memory_int| check_~a.base) 4) 0) (= check_~sum~0 0) (= check_~a.offset 0))} havoc #t~mem11;call #t~mem12 := read~int(~a0.base, ~a0.offset + 4 * ~i~0, 4);~sum~0 := ~sum~0 + #t~mem12;havoc #t~mem12; {16922#(and (= (select (select |#memory_int| check_~a.base) 4) check_~sum~0) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:48:17,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {16922#(and (= (select (select |#memory_int| check_~a.base) 4) check_~sum~0) (= check_~i~0 0) (= check_~sum~0 0) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16923#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-28 10:48:17,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {16923#(and (= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0) (= check_~sum~0 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-28 10:48:17,237 INFO L272 TraceCheckUtils]: 71: Hoare triple {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {16925#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:17,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {16925#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16926#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:48:17,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16863#false} is VALID [2022-04-28 10:48:17,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {16863#false} assume !false; {16863#false} is VALID [2022-04-28 10:48:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:48:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505209162] [2022-04-28 10:48:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505209162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:48:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535182628] [2022-04-28 10:48:17,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:17,240 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:48:17,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 10:48:17,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:17,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:17,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-28 10:48:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:17,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:17,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-28 10:48:17,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-04-28 10:48:17,634 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-28 10:48:17,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-28 10:48:17,660 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_678 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_678))) is different from true [2022-04-28 10:48:17,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-04-28 10:48:17,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-28 10:48:17,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-04-28 10:48:17,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-04-28 10:48:17,857 INFO L356 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2022-04-28 10:48:17,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-04-28 10:48:29,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-04-28 10:48:33,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-04-28 10:49:48,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 164 [2022-04-28 10:49:48,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-04-28 10:49:49,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {16862#true} call ULTIMATE.init(); {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {16862#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16862#true} {16862#true} #160#return; {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {16862#true} call #t~ret20 := main(); {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {16862#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {16862#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:49:49,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16862#true} {16862#true} #142#return; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L272 TraceCheckUtils]: 11: Hoare triple {16862#true} call #t~ret14 := is_pow2(~n~0); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#true} ~x := #in~x; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {16862#true} assume !!(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1);~x := (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then 1 + ~x % 4294967296 / 2 else ~x % 4294967296 / 2); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {16862#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16862#true} {16862#true} #144#return; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {16862#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {16862#true} call assume_abort_if_not(#t~ret14); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {16862#true} ~cond := #in~cond; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {16862#true} assume !(0 == ~cond); {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {16862#true} assume true; {16862#true} is VALID [2022-04-28 10:49:49,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16862#true} {16862#true} #146#return; {16862#true} is VALID [2022-04-28 10:49:49,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {16862#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} is VALID [2022-04-28 10:49:49,392 INFO L272 TraceCheckUtils]: 25: Hoare triple {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {17019#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1))} is VALID [2022-04-28 10:49:49,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {17019#(exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-28 10:49:49,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} assume true; {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-28 10:49:49,394 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17023#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_main_#t~malloc15.base_BEFORE_CALL_2| Int)) (= (select |#valid| |v_main_#t~malloc15.base_BEFORE_CALL_2|) 1)))} {16881#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-28 10:49:49,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {16885#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-28 10:49:49,395 INFO L272 TraceCheckUtils]: 30: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:49:49,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} is VALID [2022-04-28 10:49:49,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} assume true; {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} is VALID [2022-04-28 10:49:49,397 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17039#(exists ((v_ArrVal_678 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_678)))} {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} #150#return; {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} is VALID [2022-04-28 10:49:49,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {16886#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)) (= |main_#t~malloc16.offset| 0))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~i~1 0) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume !(~i~1 < ~n~0); {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:49,401 INFO L272 TraceCheckUtils]: 40: Hoare triple {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:49:49,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {17071#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:49:49,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {17071#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {17075#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} is VALID [2022-04-28 10:49:49,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {17075#(and (= |#memory_int| |old(#memory_int)|) (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.base| upsweep_~a.base) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is VALID [2022-04-28 10:49:51,416 WARN L290 TraceCheckUtils]: 44: Hoare triple {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} assume !(~left~0 < ~n); {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} is UNKNOWN [2022-04-28 10:49:53,420 WARN L290 TraceCheckUtils]: 45: Hoare triple {17079#(and (= upsweep_~space~0 1) (<= |upsweep_#in~n| upsweep_~n) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= (+ v_upsweep_~left~0_60 upsweep_~space~0) upsweep_~right~0) (<= upsweep_~space~0 (+ v_upsweep_~left~0_60 1)) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset))))} ~space~0 := 2 * ~space~0; {17086#(and (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (<= |upsweep_#in~n| upsweep_~n))} is UNKNOWN [2022-04-28 10:49:55,422 WARN L290 TraceCheckUtils]: 46: Hoare triple {17086#(and (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (<= |upsweep_#in~n| upsweep_~n))} assume !(~space~0 < ~n); {17090#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} is UNKNOWN [2022-04-28 10:49:57,426 WARN L290 TraceCheckUtils]: 47: Hoare triple {17090#(and (<= |upsweep_#in~n| upsweep_~space~0) (= 2 upsweep_~space~0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} #res := ~space~0; {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} is UNKNOWN [2022-04-28 10:49:57,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} assume true; {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} is VALID [2022-04-28 10:49:57,484 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17094#(and (<= |upsweep_#in~n| 2) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= |#memory_int| (store |old(#memory_int)| |upsweep_#in~a.base| (store (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)) (select (select |old(#memory_int)| |upsweep_#in~a.base|) (+ (* upsweep_~right~0 4) upsweep_~a.offset)))))) (<= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |upsweep_#res| 2))} {17052#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #152#return; {17101#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:57,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {17101#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= |main_#t~ret19| 2) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:57,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {16928#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:49:57,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {16928#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {17112#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} is VALID [2022-04-28 10:49:57,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {17112#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (or (and (or (= (mod |downsweep_#in~space| 2) 0) (not (< |downsweep_#in~space| 0))) (= downsweep_~space (div |downsweep_#in~space| 2))) (and (not (= (mod |downsweep_#in~space| 2) 0)) (< |downsweep_#in~space| 0) (= downsweep_~space (+ (div |downsweep_#in~space| 2) 1)))))} assume !!(~space > 0);~right~1 := 2 * ~space - 1; {17116#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} is VALID [2022-04-28 10:49:57,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {17116#(and (= downsweep_~a.base |downsweep_#in~a.base|) (= |#memory_int| (store |old(#memory_int)| downsweep_~a.base (store (select |old(#memory_int)| downsweep_~a.base) (+ (* |downsweep_#in~n| 4) downsweep_~a.offset (- 4)) 0))) (= downsweep_~a.offset |downsweep_#in~a.offset|) (= downsweep_~space (div |downsweep_#in~space| 2)) (= downsweep_~right~1 (+ (- 1) (* 2 downsweep_~space))) (< 0 downsweep_~space))} assume !!(~right~1 < ~n);~left~1 := ~right~1 - ~space;call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~left~1, 4);call #t~mem9 := read~int(~a.base, ~a.offset + 4 * ~right~1, 4);call write~int(#t~mem8 + #t~mem9, ~a.base, ~a.offset + 4 * ~right~1, 4);havoc #t~mem8;havoc #t~mem9;call write~int(~temp~0, ~a.base, ~a.offset + 4 * ~left~1, 4);~right~1 := ~right~1 + 2 * ~space; {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-28 10:49:57,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume !(~right~1 < ~n); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-28 10:49:57,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} ~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-28 10:49:57,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume !(~space > 0); {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-28 10:49:57,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} assume true; {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} is VALID [2022-04-28 10:49:57,499 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17120#(and (< 0 (div |downsweep_#in~space| 2)) (= |#memory_int| (store |old(#memory_int)| |downsweep_#in~a.base| (store (store (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|) (+ (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|)) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|)))) (+ (* (div |downsweep_#in~space| 2) 4) (- 4) |downsweep_#in~a.offset|) (select (store (select |old(#memory_int)| |downsweep_#in~a.base|) (+ (* |downsweep_#in~n| 4) (- 4) |downsweep_#in~a.offset|) 0) (+ (- 4) (* 8 (div |downsweep_#in~space| 2)) |downsweep_#in~a.offset|))))))} {17105#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (= 2 main_~space~1) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset))))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} #154#return; {17136#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) main_~a~0.offset (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} is VALID [2022-04-28 10:49:57,502 INFO L272 TraceCheckUtils]: 60: Hoare triple {17136#(and (<= main_~n~0 2) (= (select ((as const (Array Int Int)) 0) main_~a~0.offset) (select (select |#memory_int| main_~a0~0.base) main_~a0~0.offset)) (= main_~a~0.offset 0) (exists ((upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| main_~a~0.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4) (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) main_~a~0.offset (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ main_~a~0.offset (* main_~n~0 4) (- 4)) 0) (+ main_~a~0.offset 4)))) (<= main_~a~0.offset upsweep_~a.offset) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (not (= main_~a~0.base main_~a0~0.base)) (= main_~a0~0.offset 0))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {17140#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= |check_#in~a0.offset| 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| |check_#in~a0.base|) 0)) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (= (select |#memory_int| |check_#in~a.base|) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= 0 v_upsweep_~left~0_60) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_67) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} is VALID [2022-04-28 10:49:57,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {17140#(and (= |check_#in~a.offset| 0) (not (= |check_#in~a0.base| |check_#in~a.base|)) (= |check_#in~a0.offset| 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| |check_#in~a0.base|) 0)) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (= (select |#memory_int| |check_#in~a.base|) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= 0 v_upsweep_~left~0_60) (<= |check_#in~n| v_main_~n~0_BEFORE_CALL_67) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))))} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:49:57,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:49:57,548 INFO L272 TraceCheckUtils]: 63: Hoare triple {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is VALID [2022-04-28 10:49:59,553 WARN L290 TraceCheckUtils]: 64: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} ~cond := #in~cond; {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-28 10:50:01,558 WARN L290 TraceCheckUtils]: 65: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} assume !(0 == ~cond); {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-28 10:50:03,562 WARN L290 TraceCheckUtils]: 66: Hoare triple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} assume true; {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} is UNKNOWN [2022-04-28 10:50:03,563 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {17151#(exists ((v_check_~a0.base_BEFORE_CALL_2 Int) (upsweep_~a.offset Int) (v_main_~n~0_BEFORE_CALL_67 Int) (v_check_~a.base_BEFORE_CALL_2 Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (= (select |#memory_int| v_check_~a.base_BEFORE_CALL_2) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= 0 v_upsweep_~left~0_60) (not (= v_check_~a0.base_BEFORE_CALL_2 v_check_~a.base_BEFORE_CALL_2)) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| v_check_~a0.base_BEFORE_CALL_2) 0))))} {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} #158#return; {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} is VALID [2022-04-28 10:50:03,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {17144#(and (= check_~a0.offset 0) (not (= check_~a.base check_~a0.base)) (= check_~i~0 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)) (= check_~sum~0 0) (= check_~a.offset 0))} 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; {17167#(and (= check_~i~0 0) (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (* check_~i~0 4))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= check_~a.offset 0))} is VALID [2022-04-28 10:50:03,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {17167#(and (= check_~i~0 0) (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (* check_~i~0 4))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= check_~a.offset 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17171#(and (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (+ (* check_~i~0 4) (- 4)))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (= (+ (- 1) check_~i~0) 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= check_~a.offset 0))} is VALID [2022-04-28 10:50:03,573 INFO L290 TraceCheckUtils]: 70: Hoare triple {17171#(and (exists ((check_~a0.base Int)) (and (not (= check_~a.base check_~a0.base)) (= (+ (* (- 1) (select (select |#memory_int| check_~a0.base) (+ (* check_~i~0 4) (- 4)))) check_~sum~0) 0) (= (select ((as const (Array Int Int)) 0) 0) (select (select |#memory_int| check_~a0.base) 0)))) (= (+ (- 1) check_~i~0) 0) (exists ((v_main_~n~0_BEFORE_CALL_67 Int) (upsweep_~a.offset Int) (v_upsweep_~left~0_60 Int) (upsweep_~right~0 Int)) (and (<= v_main_~n~0_BEFORE_CALL_67 2) (<= 0 upsweep_~a.offset) (<= check_~n v_main_~n~0_BEFORE_CALL_67) (<= 0 v_upsweep_~left~0_60) (= (select |#memory_int| check_~a.base) (store (store (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4 (+ (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4) (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 0))) 0 (select (store (store ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset) (+ (select ((as const (Array Int Int)) 0) (+ (* upsweep_~right~0 4) upsweep_~a.offset)) (select ((as const (Array Int Int)) 0) (+ (* v_upsweep_~left~0_60 4) upsweep_~a.offset)))) (+ (* v_main_~n~0_BEFORE_CALL_67 4) (- 4)) 0) 4))) (<= (+ v_upsweep_~left~0_60 1) upsweep_~right~0))) (= check_~a.offset 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} is VALID [2022-04-28 10:50:03,573 INFO L272 TraceCheckUtils]: 71: Hoare triple {16924#(and (= |check_#t~mem11| check_~sum~0) (= check_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {17178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:50:03,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {17178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:50:03,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {17182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16863#false} is VALID [2022-04-28 10:50:03,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {16863#false} assume !false; {16863#false} is VALID [2022-04-28 10:50:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-04-28 10:50:03,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:50:55,499 WARN L804 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-04-28 10:50:58,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~n~0 Int)) (or (< 2 main_~n~0) (<= main_~n~0 1) (forall ((v_upsweep_~a.offset_43 Int) (v_upsweep_~right~0_40 Int) (v_upsweep_~left~0_66 Int)) (or (let ((.cse1 (store (let ((.cse5 (+ v_upsweep_~a.offset_43 (* v_upsweep_~right~0_40 4))) (.cse4 (select |c_#memory_int| c_main_~a~0.base))) (store .cse4 .cse5 (+ (select .cse4 .cse5) (select .cse4 (+ v_upsweep_~a.offset_43 (* v_upsweep_~left~0_66 4)))))) (+ c_main_~a~0.offset (* main_~n~0 4) (- 4)) 0)) (.cse2 (+ c_main_~a~0.offset 4))) (let ((.cse3 (select .cse1 .cse2))) (let ((.cse0 (+ .cse3 (select .cse1 c_main_~a~0.offset)))) (= .cse0 (select (select (store |c_#memory_int| c_main_~a~0.base (store (store .cse1 .cse2 .cse0) c_main_~a~0.offset .cse3)) c_main_~a0~0.base) c_main_~a0~0.offset))))) (< v_upsweep_~a.offset_43 c_main_~a~0.offset) (not (<= 0 v_upsweep_~left~0_66)) (not (<= (+ v_upsweep_~left~0_66 1) v_upsweep_~right~0_40)))))) is different from false [2022-04-28 10:50:58,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535182628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:50:58,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:50:58,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 58 [2022-04-28 10:50:58,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:50:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458756617] [2022-04-28 10:50:58,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458756617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:50:58,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:50:58,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 10:50:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551605246] [2022-04-28 10:50:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:50:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 75 [2022-04-28 10:50:58,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:50:58,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-28 10:50:58,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:50:58,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 10:50:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:50:58,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 10:50:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4381, Unknown=46, NotChecked=270, Total=4970 [2022-04-28 10:50:58,326 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-28 10:51:03,492 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-28 10:51:07,787 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-28 10:51:12,084 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-28 10:51:16,353 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-28 10:51:20,651 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-28 10:51:22,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 10:51:27,097 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-28 10:51:31,393 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-28 10:51:33,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 10:51:39,991 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-28 10:51:42,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 10:51:46,417 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-28 10:51:50,719 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-28 10:52:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:35,008 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-04-28 10:52:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:52:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 75 [2022-04-28 10:52:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:52:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-28 10:52:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-28 10:52:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-28 10:52:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-28 10:52:35,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 128 transitions. [2022-04-28 10:52:35,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:35,236 INFO L225 Difference]: With dead ends: 164 [2022-04-28 10:52:35,237 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 10:52:35,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2498 ImplicationChecksByTransitivity, 171.2s TimeCoverageRelationStatistics Valid=660, Invalid=9793, Unknown=61, NotChecked=406, Total=10920 [2022-04-28 10:52:35,240 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 145 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:52:35,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 71 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2011 Invalid, 13 Unknown, 0 Unchecked, 31.9s Time] [2022-04-28 10:52:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 10:52:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2022-04-28 10:52:35,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:52:35,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-28 10:52:35,808 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-28 10:52:35,812 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-28 10:52:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:35,815 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2022-04-28 10:52:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2022-04-28 10:52:35,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:35,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:35,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) Second operand 162 states. [2022-04-28 10:52:35,817 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) Second operand 162 states. [2022-04-28 10:52:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:35,820 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2022-04-28 10:52:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2022-04-28 10:52:35,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:35,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:35,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:52:35,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:52:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2022-04-28 10:52:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2022-04-28 10:52:35,824 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 75 [2022-04-28 10:52:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:52:35,825 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2022-04-28 10:52:35,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.7) internal successors, (51), 28 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-04-28 10:52:35,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 175 transitions. [2022-04-28 10:52:36,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2022-04-28 10:52:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 10:52:36,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:52:36,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:52:36,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:52:36,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:52:36,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:52:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:52:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1496849804, now seen corresponding path program 13 times [2022-04-28 10:52:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320556306] [2022-04-28 10:52:36,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:52:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1496849804, now seen corresponding path program 14 times [2022-04-28 10:52:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:52:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028370416] [2022-04-28 10:52:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:52:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:52:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:52:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {18353#(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); {18288#true} is VALID [2022-04-28 10:52:38,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {18288#true} assume true; {18288#true} is VALID [2022-04-28 10:52:38,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18288#true} {18288#true} #160#return; {18288#true} is VALID [2022-04-28 10:52:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:52:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {18288#true} ~cond := #in~cond; {18288#true} is VALID [2022-04-28 10:52:38,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {18288#true} assume !(0 == ~cond); {18288#true} is VALID [2022-04-28 10:52:38,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {18288#true} assume true; {18288#true} is VALID [2022-04-28 10:52:38,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18288#true} {18288#true} #142#return; {18288#true} is VALID [2022-04-28 10:52:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:52:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {18288#true} ~x := #in~x; {18288#true} is VALID [2022-04-28 10:52:38,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {18288#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {18288#true} is VALID [2022-04-28 10:52:38,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {18288#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {18288#true} is VALID [2022-04-28 10:52:38,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {18288#true} assume true; {18288#true} is VALID [2022-04-28 10:52:38,792 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18288#true} {18288#true} #144#return; {18288#true} is VALID [2022-04-28 10:52:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 10:52:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {18288#true} ~cond := #in~cond; {18288#true} is VALID [2022-04-28 10:52:38,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {18288#true} assume !(0 == ~cond); {18288#true} is VALID [2022-04-28 10:52:38,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {18288#true} assume true; {18288#true} is VALID [2022-04-28 10:52:38,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18288#true} {18288#true} #146#return; {18288#true} is VALID [2022-04-28 10:52:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 10:52:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {18354#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:52:38,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {18355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {18355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 10:52:38,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18355#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {18306#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= |main_#t~malloc15.offset| 0))} #148#return; {18310#(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-28 10:52:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:52:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {18354#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18356#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:52:38,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {18356#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {18356#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-28 10:52:38,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18356#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {18311#(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; {18311#(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-28 10:52:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 10:52:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:41,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {18354#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {18357#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} is VALID [2022-04-28 10:52:41,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {18357#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= upsweep_~space~0 1) (<= 1 upsweep_~space~0))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {18358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ upsweep_~left~0 upsweep_~space~0) 1) (<= 3 (+ upsweep_~left~0 (* 3 upsweep_~space~0)))) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} is VALID [2022-04-28 10:52:41,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {18358#(and (= |#memory_int| |old(#memory_int)|) (= |upsweep_#in~a.base| upsweep_~a.base) (or (and (<= upsweep_~space~0 (+ upsweep_~left~0 1)) (= |upsweep_#in~a.offset| upsweep_~a.offset) (<= (+ upsweep_~left~0 upsweep_~space~0) 1) (<= 3 (+ upsweep_~left~0 (* 3 upsweep_~space~0)))) (not (= (select (select |#memory_int| upsweep_~a.base) (+ (* upsweep_~left~0 4) upsweep_~a.offset)) 0))))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18359#(or (and (or (and (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (<= (+ upsweep_~left~0 1) (* 3 upsweep_~space~0)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (<= (+ upsweep_~space~0 1) upsweep_~left~0) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-28 10:52:41,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {18359#(or (and (or (and (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (<= (+ upsweep_~left~0 1) (* 3 upsweep_~space~0)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (<= (+ upsweep_~space~0 1) upsweep_~left~0) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18360#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-28 10:52:41,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {18360#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !(~left~0 < ~n); {18360#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-28 10:52:41,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {18360#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4) (+ (* 16 upsweep_~space~0) upsweep_~a.offset))) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) 8) (= |upsweep_#in~a.base| upsweep_~a.base)) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} ~space~0 := 2 * ~space~0; {18361#(or (and (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4))) (= |upsweep_#in~a.base| upsweep_~a.base) (= 8 (+ upsweep_~a.offset (* upsweep_~space~0 4)))) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-28 10:52:41,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {18361#(or (and (or (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (+ (* upsweep_~space~0 8) upsweep_~a.offset) (+ (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) 4))) (= |upsweep_#in~a.base| upsweep_~a.base) (= 8 (+ upsweep_~a.offset (* upsweep_~space~0 4)))) (<= (+ upsweep_~a.offset 1) 0) (<= 1 upsweep_~a.offset)) (= |upsweep_#in~a.offset| upsweep_~a.offset)) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~space~0 < ~n);~left~0 := ~space~0 - 1; {18362#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (<= (+ upsweep_~a.offset 1) 0) (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (+ (* upsweep_~left~0 4) upsweep_~a.offset (* upsweep_~space~0 4)))) (= (+ (* upsweep_~left~0 4) upsweep_~a.offset) 4) (= |upsweep_#in~a.base| upsweep_~a.base) (<= 2 upsweep_~space~0)) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} is VALID [2022-04-28 10:52:41,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {18362#(or (and (= |upsweep_#in~a.offset| upsweep_~a.offset) (or (<= (+ upsweep_~a.offset 1) 0) (and (= (store (select |old(#memory_int)| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (select (select |#memory_int| upsweep_~a.base) (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)))) (select |#memory_int| upsweep_~a.base)) (or (= (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (= (@diff (select |old(#memory_int)| upsweep_~a.base) (select |#memory_int| upsweep_~a.base)) (+ (* upsweep_~left~0 4) upsweep_~a.offset (* upsweep_~space~0 4)))) (= (+ (* upsweep_~left~0 4) upsweep_~a.offset) 4) (= |upsweep_#in~a.base| upsweep_~a.base) (<= 2 upsweep_~space~0)) (<= 1 upsweep_~a.offset))) (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| upsweep_~a.base))) (= |upsweep_#in~a.base| upsweep_~a.base)))} assume !!(~left~0 < ~n);~right~0 := ~left~0 + ~space~0;call #t~mem5 := read~int(~a.base, ~a.offset + 4 * ~left~0, 4);call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~right~0, 4);call write~int(#t~mem5 + #t~mem6, ~a.base, ~a.offset + 4 * ~right~0, 4);havoc #t~mem5;havoc #t~mem6;~left~0 := ~left~0 + 2 * ~space~0; {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~left~0 < ~n); {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} ~space~0 := 2 * ~space~0; {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume !(~space~0 < ~n); {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} #res := ~space~0; {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} assume true; {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} is VALID [2022-04-28 10:52:41,258 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18363#(or (and (or (= (select |#memory_int| |upsweep_#in~a.base|) (select |old(#memory_int)| |upsweep_#in~a.base|)) (<= (+ |upsweep_#in~a.offset| 12) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))) (= (select |#memory_int| |upsweep_#in~a.base|) (store (select |old(#memory_int)| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)) (select (select |#memory_int| |upsweep_#in~a.base|) (@diff (select |old(#memory_int)| |upsweep_#in~a.base|) (select |#memory_int| |upsweep_#in~a.base|)))))) (<= (+ |upsweep_#in~a.offset| 1) 0) (<= 1 |upsweep_#in~a.offset|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |upsweep_#in~a.base|))))} {18320#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 3 main_~n~0) (not (= main_~a~0.base main_~a0~0.base)) (<= main_~n~0 3))} #152#return; {18335#(and (= main_~a~0.offset 0) (<= (* main_~n~0 4) 12) (= (select (select |#memory_int| main_~a~0.base) 4) 0) (<= 3 main_~n~0) (or (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (<= 4 (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= main_~a~0.base main_~a0~0.base)) (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (<= 4 (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (<= 4 (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))) (= ((as const (Array Int Int)) 0) (store (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-28 10:52:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-28 10:52:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat