/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:54:57,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:54:57,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:54:57,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:54:57,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:54:57,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:54:57,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:54:57,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:54:57,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:54:57,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:54:57,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:54:57,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:54:57,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:54:57,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:54:57,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:54:57,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:54:57,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:54:57,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:54:57,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:54:57,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:54:57,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:54:57,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:54:57,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:54:57,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:54:57,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:54:57,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:54:57,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:54:57,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:54:57,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:54:57,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:54:57,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:54:57,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:54:57,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:54:57,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:54:57,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:54:57,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:54:57,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:54:57,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:54:57,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:54:57,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:54:57,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:54:57,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:54:57,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:54:57,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:54:57,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:54:57,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:54:57,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:54:57,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:54:57,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:54:57,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:54:57,100 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:54:57,100 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 02:54:57,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:54:57,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:54:57,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:54:57,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:54:57,298 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:54:57,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i [2022-04-28 02:54:57,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a807cdaa/44bcf0f73986493b8e38625eb2faa4c8/FLAG804febbcc [2022-04-28 02:54:57,657 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:54:57,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i [2022-04-28 02:54:57,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a807cdaa/44bcf0f73986493b8e38625eb2faa4c8/FLAG804febbcc [2022-04-28 02:54:58,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a807cdaa/44bcf0f73986493b8e38625eb2faa4c8 [2022-04-28 02:54:58,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:54:58,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:54:58,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:54:58,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:54:58,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:54:58,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68965e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58, skipping insertion in model container [2022-04-28 02:54:58,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:54:58,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:54:58,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i[809,822] [2022-04-28 02:54:58,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:54:58,260 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:54:58,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i[809,822] [2022-04-28 02:54:58,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:54:58,281 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:54:58,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58 WrapperNode [2022-04-28 02:54:58,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:54:58,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:54:58,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:54:58,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:54:58,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:54:58,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:54:58,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:54:58,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:54:58,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (1/1) ... [2022-04-28 02:54:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:54:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:54:58,343 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 02:54:58,349 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 02:54:58,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:54:58,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:54:58,367 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:54:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:54:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 02:54:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:54:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:54:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:54:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:54:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:54:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:54:58,442 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:54:58,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:54:58,588 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:54:58,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:54:58,597 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:54:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:54:58 BoogieIcfgContainer [2022-04-28 02:54:58,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:54:58,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:54:58,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:54:58,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:54:58,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:54:58" (1/3) ... [2022-04-28 02:54:58,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c8fa48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:54:58, skipping insertion in model container [2022-04-28 02:54:58,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:54:58" (2/3) ... [2022-04-28 02:54:58,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c8fa48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:54:58, skipping insertion in model container [2022-04-28 02:54:58,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:54:58" (3/3) ... [2022-04-28 02:54:58,605 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-2-simple.i [2022-04-28 02:54:58,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:54:58,614 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:54:58,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:54:58,654 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@3f552099, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31a4860b [2022-04-28 02:54:58,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:54:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:54:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:54:58,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:54:58,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:54:58,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:54:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:54:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -445681932, now seen corresponding path program 1 times [2022-04-28 02:54:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341355617] [2022-04-28 02:54:58,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:54:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -445681932, now seen corresponding path program 2 times [2022-04-28 02:54:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:54:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960584377] [2022-04-28 02:54:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:54:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:54:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:54:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:58,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(12, 2); {24#true} is VALID [2022-04-28 02:54:58,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:54:58,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-28 02:54:58,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:54:58,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(12, 2); {24#true} is VALID [2022-04-28 02:54:58,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 02:54:58,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-28 02:54:58,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 02:54:58,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24#true} is VALID [2022-04-28 02:54:58,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 02:54:58,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25#false} is VALID [2022-04-28 02:54:58,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {25#false} is VALID [2022-04-28 02:54:58,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 02:54:58,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 02:54:58,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 02:54:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:54:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:54:58,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960584377] [2022-04-28 02:54:58,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960584377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:54:58,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:54:58,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:54:58,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:54:58,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341355617] [2022-04-28 02:54:58,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341355617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:54:58,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:54:58,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:54:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997385749] [2022-04-28 02:54:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:54:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:54:58,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:54:58,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:58,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:54:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:54:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:54:58,945 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,015 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 02:54:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:54:59,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:54:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:54:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 02:54:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 02:54:59,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-28 02:54:59,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,082 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:54:59,083 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 02:54:59,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:54:59,089 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:54:59,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:54:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 02:54:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 02:54:59,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:54:59,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,113 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,113 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,118 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 02:54:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:54:59,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 02:54:59,120 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 02:54:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,123 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 02:54:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:54:59,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:54:59,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:54:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 02:54:59,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 02:54:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:54:59,128 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 02:54:59,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 02:54:59,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:54:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:54:59,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:54:59,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:54:59,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:54:59,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:54:59,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:54:59,155 INFO L85 PathProgramCache]: Analyzing trace with hash -617456838, now seen corresponding path program 1 times [2022-04-28 02:54:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:59,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604314163] [2022-04-28 02:54:59,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:54:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash -617456838, now seen corresponding path program 2 times [2022-04-28 02:54:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:54:59,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473034205] [2022-04-28 02:54:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:54:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:54:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:54:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:59,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(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(12, 2); {156#true} is VALID [2022-04-28 02:54:59,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 02:54:59,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #44#return; {156#true} is VALID [2022-04-28 02:54:59,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:54:59,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(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(12, 2); {156#true} is VALID [2022-04-28 02:54:59,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 02:54:59,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #44#return; {156#true} is VALID [2022-04-28 02:54:59,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret5 := main(); {156#true} is VALID [2022-04-28 02:54:59,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {161#(= main_~i~0 0)} is VALID [2022-04-28 02:54:59,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~i~0 0)} assume !(~i~0 < 2048); {157#false} is VALID [2022-04-28 02:54:59,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {157#false} is VALID [2022-04-28 02:54:59,245 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {157#false} is VALID [2022-04-28 02:54:59,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-28 02:54:59,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-28 02:54:59,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 02:54:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:54:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:54:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473034205] [2022-04-28 02:54:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473034205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:54:59,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:54:59,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:54:59,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:54:59,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604314163] [2022-04-28 02:54:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604314163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:54:59,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:54:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:54:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362254316] [2022-04-28 02:54:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:54:59,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:54:59,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:54:59,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:54:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:54:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:54:59,297 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,341 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:54:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:54:59,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:54:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:54:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:54:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:54:59,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-28 02:54:59,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,362 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:54:59,362 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 02:54:59,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 02:54:59,363 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:54:59,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:54:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 02:54:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 02:54:59,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:54:59,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,367 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,368 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,369 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:54:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:54:59,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 02:54:59,369 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 02:54:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,370 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:54:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:54:59,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:54:59,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:54:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:54:59,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 02:54:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:54:59,372 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:54:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:54:59,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:54:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:54:59,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:54:59,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:54:59,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:54:59,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:54:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:54:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1544621860, now seen corresponding path program 1 times [2022-04-28 02:54:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697555721] [2022-04-28 02:54:59,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:54:59,406 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:54:59,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:54:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1544621860, now seen corresponding path program 2 times [2022-04-28 02:54:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:54:59,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172198202] [2022-04-28 02:54:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:54:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:54:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:54:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:59,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(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(12, 2); {273#true} is VALID [2022-04-28 02:54:59,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 02:54:59,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-28 02:54:59,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:54:59,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#(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(12, 2); {273#true} is VALID [2022-04-28 02:54:59,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 02:54:59,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-28 02:54:59,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-28 02:54:59,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {278#(= main_~i~0 0)} is VALID [2022-04-28 02:54:59,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {278#(= main_~i~0 0)} is VALID [2022-04-28 02:54:59,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {279#(<= main_~i~0 1)} is VALID [2022-04-28 02:54:59,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(<= main_~i~0 1)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-28 02:54:59,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {274#false} is VALID [2022-04-28 02:54:59,475 INFO L272 TraceCheckUtils]: 10: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {274#false} is VALID [2022-04-28 02:54:59,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-28 02:54:59,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-28 02:54:59,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 02:54:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:54:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:54:59,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172198202] [2022-04-28 02:54:59,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172198202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:54:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340851711] [2022-04-28 02:54:59,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:54:59,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:54:59,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:54:59,478 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 02:54:59,479 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 02:54:59,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:54:59,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:54:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 02:54:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:54:59,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:54:59,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-28 02:54:59,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(12, 2); {273#true} is VALID [2022-04-28 02:54:59,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 02:54:59,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-28 02:54:59,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-28 02:54:59,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {299#(<= main_~i~0 0)} is VALID [2022-04-28 02:54:59,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {299#(<= main_~i~0 0)} is VALID [2022-04-28 02:54:59,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {279#(<= main_~i~0 1)} is VALID [2022-04-28 02:54:59,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(<= main_~i~0 1)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-28 02:54:59,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {274#false} is VALID [2022-04-28 02:54:59,626 INFO L272 TraceCheckUtils]: 10: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {274#false} is VALID [2022-04-28 02:54:59,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-28 02:54:59,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-28 02:54:59,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 02:54:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:54:59,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:54:59,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 02:54:59,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-28 02:54:59,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-28 02:54:59,716 INFO L272 TraceCheckUtils]: 10: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {274#false} is VALID [2022-04-28 02:54:59,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {274#false} is VALID [2022-04-28 02:54:59,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#(< main_~i~0 2048)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-28 02:54:59,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {339#(< main_~i~0 2048)} is VALID [2022-04-28 02:54:59,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {343#(< main_~i~0 2047)} is VALID [2022-04-28 02:54:59,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {343#(< main_~i~0 2047)} is VALID [2022-04-28 02:54:59,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-28 02:54:59,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-28 02:54:59,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 02:54:59,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(12, 2); {273#true} is VALID [2022-04-28 02:54:59,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-28 02:54:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:54:59,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340851711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:54:59,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:54:59,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:54:59,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:54:59,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697555721] [2022-04-28 02:54:59,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697555721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:54:59,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:54:59,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:54:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99466171] [2022-04-28 02:54:59,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:54:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:54:59,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:54:59,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:54:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:54:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:54:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:54:59,734 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,828 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:54:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:54:59,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:54:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:54:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:54:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:54:59,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 02:54:59,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,850 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:54:59,850 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:54:59,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:54:59,856 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:54:59,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:54:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:54:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 02:54:59,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:54:59,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,866 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,866 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,869 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:54:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:54:59,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:54:59,872 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:54:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:54:59,873 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:54:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:54:59,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:54:59,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:54:59,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:54:59,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:54:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 02:54:59,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 02:54:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:54:59,875 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 02:54:59,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:54:59,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 02:54:59,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:54:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:54:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:54:59,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:54:59,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:54:59,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:00,107 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 02:55:00,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash 802989566, now seen corresponding path program 3 times [2022-04-28 02:55:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:00,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344176744] [2022-04-28 02:55:00,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:00,111 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:00,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 802989566, now seen corresponding path program 4 times [2022-04-28 02:55:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:00,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549823329] [2022-04-28 02:55:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {497#(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(12, 2); {489#true} is VALID [2022-04-28 02:55:00,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-28 02:55:00,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-28 02:55:00,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:00,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(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(12, 2); {489#true} is VALID [2022-04-28 02:55:00,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-28 02:55:00,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-28 02:55:00,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-28 02:55:00,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {494#(= main_~i~0 0)} is VALID [2022-04-28 02:55:00,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {494#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {494#(= main_~i~0 0)} is VALID [2022-04-28 02:55:00,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {494#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {495#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {495#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {496#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= main_~i~0 2)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-28 02:55:00,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {490#false} is VALID [2022-04-28 02:55:00,200 INFO L272 TraceCheckUtils]: 12: Hoare triple {490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {490#false} is VALID [2022-04-28 02:55:00,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-28 02:55:00,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-28 02:55:00,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-28 02:55:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:00,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:00,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549823329] [2022-04-28 02:55:00,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549823329] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:00,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84064745] [2022-04-28 02:55:00,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:00,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:00,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:00,202 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 02:55:00,204 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 02:55:00,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:00,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:00,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:55:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:00,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-28 02:55:00,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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(12, 2); {489#true} is VALID [2022-04-28 02:55:00,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-28 02:55:00,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-28 02:55:00,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-28 02:55:00,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {516#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:00,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {516#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:00,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {495#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {495#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {496#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= main_~i~0 2)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-28 02:55:00,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {490#false} is VALID [2022-04-28 02:55:00,316 INFO L272 TraceCheckUtils]: 12: Hoare triple {490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {490#false} is VALID [2022-04-28 02:55:00,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-28 02:55:00,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-28 02:55:00,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-28 02:55:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:00,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:00,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-28 02:55:00,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-28 02:55:00,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-28 02:55:00,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {490#false} is VALID [2022-04-28 02:55:00,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {490#false} is VALID [2022-04-28 02:55:00,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {562#(< main_~i~0 2048)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-28 02:55:00,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {562#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:00,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {566#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:00,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {566#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:00,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {573#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {573#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:00,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {573#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:00,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-28 02:55:00,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-28 02:55:00,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-28 02:55:00,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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(12, 2); {489#true} is VALID [2022-04-28 02:55:00,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-28 02:55:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84064745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:00,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:55:00,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:00,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344176744] [2022-04-28 02:55:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344176744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:00,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:55:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544796867] [2022-04-28 02:55:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:55:00,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:00,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:55:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:00,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:55:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:55:00,412 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:00,495 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:55:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:55:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:55:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:55:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 02:55:00,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 02:55:00,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:00,523 INFO L225 Difference]: With dead ends: 26 [2022-04-28 02:55:00,523 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:55:00,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:55:00,524 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:00,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:55:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 02:55:00,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:00,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,530 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,530 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:00,531 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:55:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:55:00,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:00,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:00,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:55:00,532 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:55:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:00,532 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:55:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:55:00,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:00,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:00,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:00,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 02:55:00,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-28 02:55:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:00,534 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 02:55:00,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:00,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 02:55:00,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:55:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:55:00,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:00,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:00,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 02:55:00,763 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 02:55:00,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1999739552, now seen corresponding path program 5 times [2022-04-28 02:55:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:00,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271020298] [2022-04-28 02:55:00,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:00,767 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:00,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1999739552, now seen corresponding path program 6 times [2022-04-28 02:55:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:00,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493545436] [2022-04-28 02:55:00,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:00,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#(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(12, 2); {733#true} is VALID [2022-04-28 02:55:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 02:55:00,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-28 02:55:00,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:00,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#(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(12, 2); {733#true} is VALID [2022-04-28 02:55:00,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 02:55:00,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-28 02:55:00,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-28 02:55:00,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {738#(= main_~i~0 0)} is VALID [2022-04-28 02:55:00,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {738#(= main_~i~0 0)} is VALID [2022-04-28 02:55:00,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {739#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {739#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {740#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {740#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {740#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {740#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {741#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#(<= main_~i~0 3)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {734#false} is VALID [2022-04-28 02:55:00,817 INFO L272 TraceCheckUtils]: 14: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {734#false} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-28 02:55:00,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 02:55:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:00,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493545436] [2022-04-28 02:55:00,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493545436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:00,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967371792] [2022-04-28 02:55:00,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:00,819 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 02:55:00,820 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 02:55:00,862 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:55:00,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:00,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:55:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:00,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:00,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2022-04-28 02:55:00,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#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(12, 2); {733#true} is VALID [2022-04-28 02:55:00,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 02:55:00,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-28 02:55:00,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-28 02:55:00,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {761#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:00,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {761#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {761#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:00,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {761#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {739#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {739#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:00,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {740#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {740#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {740#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:00,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {740#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {741#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:00,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#(<= main_~i~0 3)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-28 02:55:00,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {734#false} is VALID [2022-04-28 02:55:00,942 INFO L272 TraceCheckUtils]: 14: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {734#false} is VALID [2022-04-28 02:55:00,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-28 02:55:00,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-28 02:55:00,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 02:55:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:00,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:01,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 02:55:01,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-28 02:55:01,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-28 02:55:01,030 INFO L272 TraceCheckUtils]: 14: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {734#false} is VALID [2022-04-28 02:55:01,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {734#false} is VALID [2022-04-28 02:55:01,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(< main_~i~0 2048)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-28 02:55:01,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {817#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {813#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:01,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {817#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {817#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:01,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {824#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {817#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:01,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {824#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {824#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:01,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {824#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:01,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {831#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:01,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {831#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:01,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-28 02:55:01,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-28 02:55:01,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 02:55:01,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#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(12, 2); {733#true} is VALID [2022-04-28 02:55:01,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2022-04-28 02:55:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967371792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:01,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:01,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:55:01,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271020298] [2022-04-28 02:55:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271020298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:01,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:01,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:55:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019447618] [2022-04-28 02:55:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:55:01,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:01,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:55:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:55:01,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:55:01,046 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,126 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:55:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:55:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:55:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:55:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 02:55:01,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 02:55:01,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,149 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:55:01,149 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:55:01,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:55:01,150 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:01,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:55:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 02:55:01,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:01,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,158 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,158 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,161 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:55:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:55:01,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:01,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:01,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:55:01,161 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:55:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,162 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:55:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:55:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:01,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:01,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:01,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 02:55:01,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-28 02:55:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:01,164 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 02:55:01,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 02:55:01,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:55:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:55:01,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:01,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:01,209 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 02:55:01,403 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 02:55:01,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1025240770, now seen corresponding path program 7 times [2022-04-28 02:55:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:01,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403526883] [2022-04-28 02:55:01,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:01,423 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:01,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1025240770, now seen corresponding path program 8 times [2022-04-28 02:55:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:01,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190817684] [2022-04-28 02:55:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:01,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#(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(12, 2); {1005#true} is VALID [2022-04-28 02:55:01,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-28 02:55:01,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-28 02:55:01,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:01,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#(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(12, 2); {1005#true} is VALID [2022-04-28 02:55:01,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-28 02:55:01,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-28 02:55:01,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-28 02:55:01,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1010#(= main_~i~0 0)} is VALID [2022-04-28 02:55:01,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {1010#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1010#(= main_~i~0 0)} is VALID [2022-04-28 02:55:01,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {1010#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1011#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:01,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1011#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:01,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {1011#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1012#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:01,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {1012#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1012#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:01,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {1012#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1013#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:01,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {1013#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1013#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:01,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {1013#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1014#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:01,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {1006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L272 TraceCheckUtils]: 16: Hoare triple {1006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-28 02:55:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:01,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190817684] [2022-04-28 02:55:01,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190817684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:01,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517883622] [2022-04-28 02:55:01,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:01,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:01,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:01,508 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 02:55:01,509 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 02:55:01,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:01,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:01,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:55:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:01,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:01,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2022-04-28 02:55:01,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#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(12, 2); {1005#true} is VALID [2022-04-28 02:55:01,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-28 02:55:01,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-28 02:55:01,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-28 02:55:01,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {1005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1034#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:01,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {1034#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1034#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:01,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1034#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1011#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:01,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1011#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:01,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1011#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1012#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:01,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {1012#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1012#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:01,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {1012#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1013#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:01,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {1013#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1013#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {1013#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1014#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {1006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1006#false} is VALID [2022-04-28 02:55:01,633 INFO L272 TraceCheckUtils]: 16: Hoare triple {1006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1006#false} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-28 02:55:01,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-28 02:55:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:01,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:01,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-28 02:55:01,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-28 02:55:01,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-28 02:55:01,756 INFO L272 TraceCheckUtils]: 16: Hoare triple {1006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1006#false} is VALID [2022-04-28 02:55:01,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1006#false} is VALID [2022-04-28 02:55:01,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-28 02:55:01,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {1096#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:01,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1096#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:01,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:01,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {1103#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1103#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:01,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1103#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:01,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1110#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:01,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1117#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1110#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:01,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {1117#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1117#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:01,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1117#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:01,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-28 02:55:01,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-28 02:55:01,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-28 02:55:01,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#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(12, 2); {1005#true} is VALID [2022-04-28 02:55:01,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2022-04-28 02:55:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517883622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:01,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:01,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:55:01,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403526883] [2022-04-28 02:55:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403526883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:01,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:01,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:55:01,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964787062] [2022-04-28 02:55:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:55:01,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:01,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:55:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:55:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:55:01,777 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,874 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:55:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:55:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:55:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:55:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:55:01,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 02:55:01,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,896 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:55:01,896 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:55:01,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:55:01,896 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:01,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:55:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 02:55:01,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:01,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,904 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,905 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,905 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:55:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:55:01,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:01,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:01,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:55:01,906 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:55:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:01,907 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:55:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:55:01,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:01,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:01,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:01,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 02:55:01,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-28 02:55:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:01,908 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 02:55:01,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:01,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 02:55:01,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:55:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:55:01,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:01,923 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:01,942 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 02:55:02,140 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 02:55:02,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:02,141 INFO L85 PathProgramCache]: Analyzing trace with hash 834781796, now seen corresponding path program 9 times [2022-04-28 02:55:02,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:02,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203030218] [2022-04-28 02:55:02,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:02,144 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:02,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 834781796, now seen corresponding path program 10 times [2022-04-28 02:55:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732908186] [2022-04-28 02:55:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:02,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#(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(12, 2); {1305#true} is VALID [2022-04-28 02:55:02,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-28 02:55:02,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-28 02:55:02,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:02,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#(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(12, 2); {1305#true} is VALID [2022-04-28 02:55:02,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-28 02:55:02,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-28 02:55:02,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-28 02:55:02,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1310#(= main_~i~0 0)} is VALID [2022-04-28 02:55:02,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {1310#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1310#(= main_~i~0 0)} is VALID [2022-04-28 02:55:02,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1311#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:02,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1311#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:02,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1312#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:02,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:02,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1312#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1313#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:02,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1313#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:02,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1314#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:02,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1314#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1315#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1306#false} is VALID [2022-04-28 02:55:02,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {1306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1306#false} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-28 02:55:02,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-28 02:55:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:02,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732908186] [2022-04-28 02:55:02,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732908186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:02,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404285378] [2022-04-28 02:55:02,222 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:02,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:02,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:02,223 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 02:55:02,224 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 02:55:02,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:02,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:02,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:55:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:02,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:02,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2022-04-28 02:55:02,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#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(12, 2); {1305#true} is VALID [2022-04-28 02:55:02,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-28 02:55:02,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-28 02:55:02,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-28 02:55:02,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {1305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1335#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:02,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {1335#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1335#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:02,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {1335#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1311#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:02,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1311#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:02,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1312#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:02,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:02,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {1312#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1313#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:02,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1313#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:02,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1314#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:02,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1314#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:02,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1315#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:02,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-28 02:55:02,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1306#false} is VALID [2022-04-28 02:55:02,367 INFO L272 TraceCheckUtils]: 18: Hoare triple {1306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1306#false} is VALID [2022-04-28 02:55:02,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-28 02:55:02,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-28 02:55:02,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-28 02:55:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:02,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:02,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-28 02:55:02,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-28 02:55:02,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-28 02:55:02,496 INFO L272 TraceCheckUtils]: 18: Hoare triple {1306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1306#false} is VALID [2022-04-28 02:55:02,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1306#false} is VALID [2022-04-28 02:55:02,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {1399#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-28 02:55:02,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {1403#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1399#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:02,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {1403#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1403#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:02,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {1410#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1403#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:02,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {1410#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1410#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:02,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {1417#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1410#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:02,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {1417#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1417#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:02,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1424#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1417#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:02,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1424#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:02,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1431#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1424#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:02,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1431#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1431#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:02,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1431#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:02,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-28 02:55:02,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-28 02:55:02,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-28 02:55:02,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#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(12, 2); {1305#true} is VALID [2022-04-28 02:55:02,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2022-04-28 02:55:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:02,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404285378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:02,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:02,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:55:02,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:02,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203030218] [2022-04-28 02:55:02,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203030218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:02,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:02,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:55:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364536798] [2022-04-28 02:55:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:55:02,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:02,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:55:02,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:55:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:55:02,517 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:02,645 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:55:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:55:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:55:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:55:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 02:55:02,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 02:55:02,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:02,670 INFO L225 Difference]: With dead ends: 32 [2022-04-28 02:55:02,670 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:55:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:55:02,671 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:55:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 02:55:02,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:02,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,685 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,685 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:02,686 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:55:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:55:02,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:02,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:02,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 02:55:02,686 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 02:55:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:02,687 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:55:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:55:02,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:02,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:02,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:02,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 02:55:02,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-28 02:55:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:02,688 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 02:55:02,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:02,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 02:55:02,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:55:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:55:02,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:02,706 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:02,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 02:55:02,922 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 02:55:02,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1807665786, now seen corresponding path program 11 times [2022-04-28 02:55:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:02,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798105101] [2022-04-28 02:55:02,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:02,933 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:02,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1807665786, now seen corresponding path program 12 times [2022-04-28 02:55:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:02,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194773589] [2022-04-28 02:55:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:02,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {1645#(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(12, 2); {1633#true} is VALID [2022-04-28 02:55:02,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-28 02:55:02,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-28 02:55:02,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:02,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1645#(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(12, 2); {1633#true} is VALID [2022-04-28 02:55:02,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-28 02:55:02,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-28 02:55:02,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-28 02:55:03,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1638#(= main_~i~0 0)} is VALID [2022-04-28 02:55:03,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1638#(= main_~i~0 0)} is VALID [2022-04-28 02:55:03,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {1638#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1639#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {1639#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1639#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {1639#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1640#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {1640#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1640#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1640#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1641#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {1641#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1641#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {1641#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1642#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {1642#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1642#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {1642#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1643#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {1643#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1643#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {1643#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1644#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:03,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-28 02:55:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194773589] [2022-04-28 02:55:03,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194773589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365464405] [2022-04-28 02:55:03,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:03,005 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 02:55:03,006 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 02:55:03,062 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 02:55:03,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:03,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:55:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:03,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:03,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2022-04-28 02:55:03,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1633#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(12, 2); {1633#true} is VALID [2022-04-28 02:55:03,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-28 02:55:03,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-28 02:55:03,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-28 02:55:03,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {1633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1664#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:03,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {1664#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1664#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:03,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1664#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1639#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1639#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1639#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {1639#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1640#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {1640#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1640#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1640#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1641#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {1641#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1641#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1641#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1642#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {1642#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1642#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {1642#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1643#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {1643#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1643#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {1643#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1644#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:03,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-28 02:55:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:03,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:03,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-28 02:55:03,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-28 02:55:03,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-28 02:55:03,362 INFO L272 TraceCheckUtils]: 20: Hoare triple {1634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1634#false} is VALID [2022-04-28 02:55:03,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1634#false} is VALID [2022-04-28 02:55:03,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {1734#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-28 02:55:03,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {1738#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1734#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:03,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1738#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1738#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:03,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {1745#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1738#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:03,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {1745#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1745#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:03,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {1752#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1745#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:03,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {1752#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1752#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:03,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {1759#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1752#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:03,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1759#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1759#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:03,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1766#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1759#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:03,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1766#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1766#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:03,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1773#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1766#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:03,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {1773#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1773#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:03,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {1633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1773#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:03,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-28 02:55:03,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-28 02:55:03,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-28 02:55:03,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1633#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(12, 2); {1633#true} is VALID [2022-04-28 02:55:03,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2022-04-28 02:55:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365464405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:03,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:03,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 02:55:03,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:03,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798105101] [2022-04-28 02:55:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798105101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:03,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:03,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:55:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191226136] [2022-04-28 02:55:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:55:03,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:03,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:55:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:55:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:55:03,386 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:03,514 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:55:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:55:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:55:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 02:55:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 02:55:03,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-28 02:55:03,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:03,539 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:55:03,539 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 02:55:03,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:55:03,540 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:03,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 02:55:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 02:55:03,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:03,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,553 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,553 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:03,554 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:55:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:55:03,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:03,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:03,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:55:03,555 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:55:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:03,555 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:55:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:55:03,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:03,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:03,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:03,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 02:55:03,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-28 02:55:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:03,556 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 02:55:03,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:03,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 02:55:03,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 02:55:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:55:03,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:03,574 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:03,592 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 02:55:03,790 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 02:55:03,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1420847144, now seen corresponding path program 13 times [2022-04-28 02:55:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304836786] [2022-04-28 02:55:03,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:03,793 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:03,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1420847144, now seen corresponding path program 14 times [2022-04-28 02:55:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:03,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399292334] [2022-04-28 02:55:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:03,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {2002#(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(12, 2); {1989#true} is VALID [2022-04-28 02:55:03,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-28 02:55:03,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-28 02:55:03,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {2002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:03,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2002#(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(12, 2); {1989#true} is VALID [2022-04-28 02:55:03,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-28 02:55:03,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-28 02:55:03,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-28 02:55:03,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1994#(= main_~i~0 0)} is VALID [2022-04-28 02:55:03,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {1994#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1994#(= main_~i~0 0)} is VALID [2022-04-28 02:55:03,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1994#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:03,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:03,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:03,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {1997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:03,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {1998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {1999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:03,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {1999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:03,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:03,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:03,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {1990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L272 TraceCheckUtils]: 22: Hoare triple {1990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-28 02:55:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:03,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399292334] [2022-04-28 02:55:03,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399292334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:03,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903469893] [2022-04-28 02:55:03,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:03,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:03,886 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 02:55:03,887 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 02:55:03,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:03,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:03,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:55:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:03,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:04,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2022-04-28 02:55:04,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#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(12, 2); {1989#true} is VALID [2022-04-28 02:55:04,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-28 02:55:04,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-28 02:55:04,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-28 02:55:04,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {1989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2021#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:04,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {2021#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2021#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:04,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {2021#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:04,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:04,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:04,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:04,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:04,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:04,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {1997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:04,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:04,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:04,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {1999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:04,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:04,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {1990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L272 TraceCheckUtils]: 22: Hoare triple {1990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-28 02:55:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:04,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:04,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-28 02:55:04,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-28 02:55:04,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-28 02:55:04,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {1990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1990#false} is VALID [2022-04-28 02:55:04,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1990#false} is VALID [2022-04-28 02:55:04,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {2097#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-28 02:55:04,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2097#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:04,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {2101#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2101#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:04,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {2108#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2101#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:04,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {2108#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2108#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:04,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {2115#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2108#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:04,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {2115#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2115#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:04,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {2122#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2115#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:04,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {2122#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2122#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:04,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2122#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:04,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {2129#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2129#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:04,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2129#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:04,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2136#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:04,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2136#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:04,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {2143#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2143#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:04,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {1989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2143#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:04,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-28 02:55:04,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-28 02:55:04,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-28 02:55:04,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#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(12, 2); {1989#true} is VALID [2022-04-28 02:55:04,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2022-04-28 02:55:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:04,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903469893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:04,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:04,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 02:55:04,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304836786] [2022-04-28 02:55:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304836786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:04,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:04,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:55:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831202939] [2022-04-28 02:55:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:04,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:55:04,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:04,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:55:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:55:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:55:04,262 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:04,428 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:55:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:55:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 02:55:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:55:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:55:04,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-28 02:55:04,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:04,461 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:55:04,461 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:55:04,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:55:04,463 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:04,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:55:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 02:55:04,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:04,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,487 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,487 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:04,488 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:55:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:55:04,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:04,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:04,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:55:04,488 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:55:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:04,489 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:55:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:55:04,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:04,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:04,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:04,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 02:55:04,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-28 02:55:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:04,490 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 02:55:04,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:04,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 02:55:04,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 02:55:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:55:04,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:04,514 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:04,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 02:55:04,715 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 02:55:04,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1239582134, now seen corresponding path program 15 times [2022-04-28 02:55:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:04,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041399135] [2022-04-28 02:55:04,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:04,719 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:04,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1239582134, now seen corresponding path program 16 times [2022-04-28 02:55:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:04,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3117311] [2022-04-28 02:55:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:04,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {2387#(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(12, 2); {2373#true} is VALID [2022-04-28 02:55:04,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-28 02:55:04,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-28 02:55:04,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:04,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {2387#(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(12, 2); {2373#true} is VALID [2022-04-28 02:55:04,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-28 02:55:04,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-28 02:55:04,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-28 02:55:04,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2378#(= main_~i~0 0)} is VALID [2022-04-28 02:55:04,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {2378#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2378#(= main_~i~0 0)} is VALID [2022-04-28 02:55:04,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {2378#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2379#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:04,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2379#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:04,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2380#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:04,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2380#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:04,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {2380#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:04,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {2381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2381#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:04,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {2381#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2382#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:04,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2382#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:04,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {2382#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2383#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:04,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {2383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2383#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:04,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {2383#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2384#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:04,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {2384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2384#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:04,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {2384#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2385#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:04,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {2385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2385#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:04,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {2385#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2386#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:04,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {2386#(<= main_~i~0 8)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {2374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L272 TraceCheckUtils]: 24: Hoare triple {2374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-28 02:55:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:04,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3117311] [2022-04-28 02:55:04,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3117311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423672211] [2022-04-28 02:55:04,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:04,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:04,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:04,829 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 02:55:04,830 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 02:55:04,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:04,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:04,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:55:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:04,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:05,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2022-04-28 02:55:05,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {2373#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(12, 2); {2373#true} is VALID [2022-04-28 02:55:05,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-28 02:55:05,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-28 02:55:05,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-28 02:55:05,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2406#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:05,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2406#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:05,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2379#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:05,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2379#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:05,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2380#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:05,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2380#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:05,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {2380#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:05,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {2381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2381#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:05,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {2381#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2382#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:05,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2382#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:05,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {2382#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2383#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:05,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2383#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:05,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {2383#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2384#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:05,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {2384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2384#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:05,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2384#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2385#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:05,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2385#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:05,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {2385#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2386#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:05,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {2386#(<= main_~i~0 8)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {2374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L272 TraceCheckUtils]: 24: Hoare triple {2374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-28 02:55:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:05,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:05,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-28 02:55:05,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-28 02:55:05,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-28 02:55:05,307 INFO L272 TraceCheckUtils]: 24: Hoare triple {2374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2374#false} is VALID [2022-04-28 02:55:05,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {2374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2374#false} is VALID [2022-04-28 02:55:05,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {2488#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-28 02:55:05,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {2492#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2488#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:05,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {2492#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2492#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:05,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2492#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:05,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2499#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:05,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {2506#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2499#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:05,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {2506#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2506#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:05,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {2513#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2506#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:05,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {2513#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2513#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:05,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {2520#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2513#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:05,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {2520#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2520#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:05,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {2527#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2520#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:05,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {2527#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2527#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:05,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {2534#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2527#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:05,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2534#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2534#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:05,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2541#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2534#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:05,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {2541#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2541#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:05,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2541#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:05,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-28 02:55:05,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-28 02:55:05,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-28 02:55:05,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2373#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(12, 2); {2373#true} is VALID [2022-04-28 02:55:05,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2022-04-28 02:55:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423672211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 02:55:05,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041399135] [2022-04-28 02:55:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041399135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:05,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:55:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122905080] [2022-04-28 02:55:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:55:05,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:05,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:05,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:55:05,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:05,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:55:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:55:05,344 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:05,544 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:55:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:55:05,544 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:55:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-28 02:55:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-28 02:55:05,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-04-28 02:55:05,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:05,583 INFO L225 Difference]: With dead ends: 38 [2022-04-28 02:55:05,583 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 02:55:05,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=402, Invalid=528, Unknown=0, NotChecked=0, Total=930 [2022-04-28 02:55:05,584 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:05,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 34 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 02:55:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-28 02:55:05,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:05,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,604 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,606 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:05,607 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:55:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:55:05,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:05,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:05,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:55:05,607 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 02:55:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:05,608 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:55:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:55:05,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:05,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:05,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:05,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 02:55:05,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-28 02:55:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:05,609 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 02:55:05,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:05,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 02:55:05,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 02:55:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:55:05,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:05,632 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:05,653 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 02:55:05,847 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 02:55:05,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1888390124, now seen corresponding path program 17 times [2022-04-28 02:55:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:05,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043417865] [2022-04-28 02:55:05,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:05,852 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:05,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1888390124, now seen corresponding path program 18 times [2022-04-28 02:55:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:05,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191908234] [2022-04-28 02:55:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:05,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {2800#(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(12, 2); {2785#true} is VALID [2022-04-28 02:55:05,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 02:55:05,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-28 02:55:05,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:05,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#(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(12, 2); {2785#true} is VALID [2022-04-28 02:55:05,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 02:55:05,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-28 02:55:05,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-28 02:55:05,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2790#(= main_~i~0 0)} is VALID [2022-04-28 02:55:05,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {2790#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2790#(= main_~i~0 0)} is VALID [2022-04-28 02:55:05,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2790#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2791#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:05,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2791#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2791#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:05,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {2791#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2792#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:05,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {2792#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2792#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:05,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2793#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:05,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {2793#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2793#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:05,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2794#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:05,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2794#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2794#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:05,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {2794#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2795#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:05,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {2795#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2795#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:05,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {2795#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2796#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:05,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {2796#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2796#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:05,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {2796#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2797#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:05,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {2797#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2797#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:05,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {2797#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2798#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:05,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2798#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2798#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {2798#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2799#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2786#false} is VALID [2022-04-28 02:55:05,966 INFO L272 TraceCheckUtils]: 26: Hoare triple {2786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2786#false} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 02:55:05,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 02:55:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191908234] [2022-04-28 02:55:05,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191908234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717071482] [2022-04-28 02:55:05,967 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:05,968 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 02:55:05,968 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 02:55:06,050 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 02:55:06,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:06,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:55:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:06,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:06,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-28 02:55:06,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#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(12, 2); {2785#true} is VALID [2022-04-28 02:55:06,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 02:55:06,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-28 02:55:06,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-28 02:55:06,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2819#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:06,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {2819#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2819#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:06,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2819#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2791#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:06,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {2791#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2791#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:06,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2791#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2792#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:06,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {2792#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2792#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:06,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2793#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:06,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {2793#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2793#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:06,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2794#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:06,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2794#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2794#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:06,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {2794#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2795#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:06,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2795#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2795#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:06,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {2795#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2796#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:06,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {2796#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2796#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:06,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {2796#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2797#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:06,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {2797#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2797#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:06,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {2797#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2798#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:06,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {2798#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2798#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:06,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {2798#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2799#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:06,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-28 02:55:06,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2786#false} is VALID [2022-04-28 02:55:06,248 INFO L272 TraceCheckUtils]: 26: Hoare triple {2786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2786#false} is VALID [2022-04-28 02:55:06,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 02:55:06,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 02:55:06,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 02:55:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:06,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:06,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L272 TraceCheckUtils]: 26: Hoare triple {2786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {2907#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-28 02:55:06,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2907#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:06,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {2911#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2911#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:06,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {2918#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2911#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:06,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {2918#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2918#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:06,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {2925#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2918#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:06,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {2925#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2925#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:06,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {2932#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2925#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:06,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2932#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:06,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {2939#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2932#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:06,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {2939#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2939#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:06,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {2946#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2939#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:06,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {2946#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2946#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:06,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2946#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:06,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {2953#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2953#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:06,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {2960#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2953#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:06,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {2960#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2960#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:06,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {2967#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2960#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:06,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {2967#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2967#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:06,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2967#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:06,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-28 02:55:06,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-28 02:55:06,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 02:55:06,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#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(12, 2); {2785#true} is VALID [2022-04-28 02:55:06,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-28 02:55:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:06,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717071482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:06,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:06,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 02:55:06,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:06,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043417865] [2022-04-28 02:55:06,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043417865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:06,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:06,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:55:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715518496] [2022-04-28 02:55:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:55:06,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:06,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:06,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:55:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:55:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:55:06,574 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:06,777 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:55:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:55:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 02:55:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 02:55:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 02:55:06,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 02:55:06,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:06,805 INFO L225 Difference]: With dead ends: 40 [2022-04-28 02:55:06,805 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:55:06,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:55:06,806 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:06,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:55:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 02:55:06,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:06,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,837 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,837 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:06,837 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:55:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:55:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:06,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:06,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:55:06,838 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:55:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:06,838 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:55:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:55:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:06,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:06,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:06,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 02:55:06,839 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-28 02:55:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:06,839 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 02:55:06,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:06,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 02:55:06,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 02:55:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 02:55:06,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:06,869 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:06,888 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 02:55:07,086 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 02:55:07,086 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622862, now seen corresponding path program 19 times [2022-04-28 02:55:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:07,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [424899697] [2022-04-28 02:55:07,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:07,089 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:07,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622862, now seen corresponding path program 20 times [2022-04-28 02:55:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:07,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888048843] [2022-04-28 02:55:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:07,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {3241#(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(12, 2); {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {3225#true} call ULTIMATE.init(); {3241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:07,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {3241#(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(12, 2); {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-28 02:55:07,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-28 02:55:07,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {3225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3230#(= main_~i~0 0)} is VALID [2022-04-28 02:55:07,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {3230#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3230#(= main_~i~0 0)} is VALID [2022-04-28 02:55:07,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {3230#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3231#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:07,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {3231#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3231#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:07,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {3231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3232#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:07,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3232#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:07,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {3232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3233#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:07,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {3233#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3233#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:07,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {3233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3234#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:07,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {3234#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3234#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:07,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {3234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3235#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:07,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3235#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:07,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {3235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3236#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:07,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {3236#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3236#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:07,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {3236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3237#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:07,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {3237#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3237#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:07,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {3237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3238#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:07,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3238#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:07,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3239#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:07,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {3239#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3239#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:07,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {3239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3240#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:07,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#(<= main_~i~0 10)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {3226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {3226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-28 02:55:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:07,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888048843] [2022-04-28 02:55:07,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888048843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:07,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729609477] [2022-04-28 02:55:07,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:07,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:07,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:07,231 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 02:55:07,235 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 02:55:07,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:07,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:07,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:55:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:07,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:07,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {3225#true} call ULTIMATE.init(); {3225#true} is VALID [2022-04-28 02:55:07,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#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(12, 2); {3225#true} is VALID [2022-04-28 02:55:07,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-28 02:55:07,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-28 02:55:07,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-28 02:55:07,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {3225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3260#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:07,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {3260#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3260#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:07,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {3260#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3231#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:07,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {3231#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3231#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:07,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {3231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3232#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:07,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3232#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:07,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {3232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3233#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:07,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {3233#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3233#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:07,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {3233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3234#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:07,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {3234#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3234#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:07,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {3234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3235#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:07,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3235#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:07,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {3235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3236#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:07,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {3236#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3236#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:07,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {3236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3237#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:07,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {3237#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3237#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:07,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {3237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3238#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:07,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3238#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:07,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3239#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:07,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {3239#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3239#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:07,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {3239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3240#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:07,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#(<= main_~i~0 10)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-28 02:55:07,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {3226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3226#false} is VALID [2022-04-28 02:55:07,493 INFO L272 TraceCheckUtils]: 28: Hoare triple {3226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3226#false} is VALID [2022-04-28 02:55:07,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-28 02:55:07,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-28 02:55:07,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-28 02:55:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:07,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:07,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L272 TraceCheckUtils]: 28: Hoare triple {3226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {3226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {3354#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-28 02:55:07,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3358#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3354#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:07,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {3358#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3358#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:07,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {3365#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3358#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:07,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {3365#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3365#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:07,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {3372#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3365#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:07,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {3372#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3372#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:07,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {3379#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3372#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:07,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {3379#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3379#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:07,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {3386#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3379#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:07,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {3386#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3386#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:07,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {3393#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3386#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:07,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {3393#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3393#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:07,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3393#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:07,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3400#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:07,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {3407#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3400#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:07,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {3407#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3407#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:07,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {3414#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3407#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:07,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {3414#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3414#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:07,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {3421#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3414#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:07,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {3421#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3421#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:07,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {3225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3421#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:07,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-28 02:55:07,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-28 02:55:07,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-28 02:55:07,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#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(12, 2); {3225#true} is VALID [2022-04-28 02:55:07,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {3225#true} call ULTIMATE.init(); {3225#true} is VALID [2022-04-28 02:55:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729609477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:07,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 02:55:07,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:07,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [424899697] [2022-04-28 02:55:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [424899697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:07,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:55:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044698767] [2022-04-28 02:55:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:55:07,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:07,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:07,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:07,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:55:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:55:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-28 02:55:07,793 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:08,041 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:55:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:55:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:55:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-28 02:55:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-28 02:55:08,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2022-04-28 02:55:08,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:08,078 INFO L225 Difference]: With dead ends: 42 [2022-04-28 02:55:08,078 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 02:55:08,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:55:08,079 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:08,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 02:55:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 02:55:08,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:08,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,122 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,122 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:08,123 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:55:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:55:08,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:08,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:08,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 02:55:08,123 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 02:55:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:08,124 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:55:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:55:08,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:08,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:08,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:08,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 02:55:08,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-28 02:55:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:08,125 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 02:55:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:08,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 02:55:08,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 02:55:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 02:55:08,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:08,159 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:08,175 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 02:55:08,367 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 02:55:08,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1701653936, now seen corresponding path program 21 times [2022-04-28 02:55:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:08,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052150317] [2022-04-28 02:55:08,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:08,370 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:08,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1701653936, now seen corresponding path program 22 times [2022-04-28 02:55:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:08,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499796911] [2022-04-28 02:55:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:08,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:08,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {3710#(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(12, 2); {3693#true} is VALID [2022-04-28 02:55:08,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-28 02:55:08,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-28 02:55:08,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {3693#true} call ULTIMATE.init(); {3710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:08,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#(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(12, 2); {3693#true} is VALID [2022-04-28 02:55:08,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-28 02:55:08,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-28 02:55:08,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-28 02:55:08,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {3693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3698#(= main_~i~0 0)} is VALID [2022-04-28 02:55:08,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {3698#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3698#(= main_~i~0 0)} is VALID [2022-04-28 02:55:08,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {3698#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3699#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:08,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {3699#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3699#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:08,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {3699#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3700#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:08,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {3700#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3700#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:08,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {3700#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3701#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:08,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3701#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:08,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3702#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:08,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {3702#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3702#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:08,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {3702#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3703#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:08,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3703#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:08,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3704#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:08,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {3704#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3704#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:08,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {3704#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3705#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:08,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3705#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:08,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3706#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:08,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {3706#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3706#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:08,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {3706#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3707#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:08,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {3707#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3707#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:08,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {3707#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3708#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:08,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {3708#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3708#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:08,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {3708#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3709#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:08,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(<= main_~i~0 11)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {3694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L272 TraceCheckUtils]: 30: Hoare triple {3694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-28 02:55:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499796911] [2022-04-28 02:55:08,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499796911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767240707] [2022-04-28 02:55:08,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:08,527 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 02:55:08,528 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 02:55:08,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:08,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:08,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 02:55:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:08,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {3693#true} call ULTIMATE.init(); {3693#true} is VALID [2022-04-28 02:55:08,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#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(12, 2); {3693#true} is VALID [2022-04-28 02:55:08,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-28 02:55:08,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-28 02:55:08,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-28 02:55:08,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {3693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3729#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:08,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3729#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:08,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3699#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:08,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {3699#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3699#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:08,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {3699#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3700#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:08,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {3700#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3700#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:08,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {3700#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3701#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:08,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3701#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:08,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3702#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:08,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {3702#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3702#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:08,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {3702#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3703#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:08,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3703#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:08,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3704#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:08,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {3704#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3704#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:08,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {3704#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3705#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:08,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3705#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:08,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3706#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:08,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {3706#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3706#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:08,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {3706#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3707#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:08,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {3707#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3707#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:08,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {3707#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3708#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:08,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {3708#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3708#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:08,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {3708#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3709#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:08,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(<= main_~i~0 11)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {3694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L272 TraceCheckUtils]: 30: Hoare triple {3694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-28 02:55:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:08,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:09,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-28 02:55:09,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-28 02:55:09,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-28 02:55:09,069 INFO L272 TraceCheckUtils]: 30: Hoare triple {3694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3694#false} is VALID [2022-04-28 02:55:09,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {3694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3694#false} is VALID [2022-04-28 02:55:09,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {3829#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-28 02:55:09,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {3833#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3829#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:09,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {3833#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3833#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:09,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3833#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:09,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {3840#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3840#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:09,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {3847#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3840#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:09,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {3847#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3847#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:09,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {3854#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3847#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:09,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {3854#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3854#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:09,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3854#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:09,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {3861#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3861#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:09,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {3868#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:09,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {3868#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3868#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:09,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {3875#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3868#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:09,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {3875#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3875#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:09,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {3882#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3875#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:09,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {3882#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3882#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:09,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3882#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:09,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {3889#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3889#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:09,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {3896#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3889#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:09,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {3896#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3896#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:09,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {3903#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3896#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:09,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {3903#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3903#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:09,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {3693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3903#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:09,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-28 02:55:09,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-28 02:55:09,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-28 02:55:09,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#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(12, 2); {3693#true} is VALID [2022-04-28 02:55:09,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {3693#true} call ULTIMATE.init(); {3693#true} is VALID [2022-04-28 02:55:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767240707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:09,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:09,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 02:55:09,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052150317] [2022-04-28 02:55:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052150317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:09,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:09,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 02:55:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485498343] [2022-04-28 02:55:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 02:55:09,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:09,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:09,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 02:55:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 02:55:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:55:09,112 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:09,345 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:55:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 02:55:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 02:55:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-28 02:55:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-28 02:55:09,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2022-04-28 02:55:09,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:09,377 INFO L225 Difference]: With dead ends: 44 [2022-04-28 02:55:09,377 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 02:55:09,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=678, Invalid=882, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:55:09,378 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:09,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 02:55:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 02:55:09,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:09,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,409 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,409 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:09,410 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:55:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:55:09,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:09,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:09,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 02:55:09,410 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 02:55:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:09,411 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:55:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:55:09,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:09,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:09,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:09,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 02:55:09,412 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-28 02:55:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:09,412 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 02:55:09,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:09,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 02:55:09,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 02:55:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:55:09,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:09,448 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:09,464 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 02:55:09,649 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 02:55:09,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1967194670, now seen corresponding path program 23 times [2022-04-28 02:55:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436809188] [2022-04-28 02:55:09,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:09,653 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:09,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1967194670, now seen corresponding path program 24 times [2022-04-28 02:55:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:09,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276937465] [2022-04-28 02:55:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:09,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {4207#(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(12, 2); {4189#true} is VALID [2022-04-28 02:55:09,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-28 02:55:09,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-28 02:55:09,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:09,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {4207#(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(12, 2); {4189#true} is VALID [2022-04-28 02:55:09,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-28 02:55:09,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-28 02:55:09,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-28 02:55:09,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4194#(= main_~i~0 0)} is VALID [2022-04-28 02:55:09,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {4194#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4194#(= main_~i~0 0)} is VALID [2022-04-28 02:55:09,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {4194#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4195#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:09,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4195#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:09,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4196#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:09,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4196#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:09,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4197#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:09,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4197#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:09,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4198#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:09,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4198#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:09,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4199#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:09,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4199#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:09,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4200#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:09,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4200#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:09,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4201#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:09,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4201#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:09,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4202#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:09,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4202#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:09,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4203#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:09,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {4203#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4203#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:09,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {4203#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4204#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:09,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4204#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:09,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {4204#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4205#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:09,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {4205#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4205#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:09,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {4205#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4206#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:09,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~i~0 12)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {4190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L272 TraceCheckUtils]: 32: Hoare triple {4190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-28 02:55:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276937465] [2022-04-28 02:55:09,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276937465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694656518] [2022-04-28 02:55:09,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:09,782 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 02:55:09,783 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 02:55:09,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 02:55:09,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:09,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 02:55:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:09,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:10,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2022-04-28 02:55:10,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#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(12, 2); {4189#true} is VALID [2022-04-28 02:55:10,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-28 02:55:10,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-28 02:55:10,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-28 02:55:10,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4226#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:10,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {4226#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4226#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:10,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {4226#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4195#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:10,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4195#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:10,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4196#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:10,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4196#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:10,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4197#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:10,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4197#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:10,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4198#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:10,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4198#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:10,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4199#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:10,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4199#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:10,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4200#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:10,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4200#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:10,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4201#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:10,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4201#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:10,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4202#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:10,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4202#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:10,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4203#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:10,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {4203#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4203#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:10,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {4203#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4204#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:10,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4204#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:10,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {4204#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4205#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {4205#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4205#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {4205#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4206#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~i~0 12)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {4190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4190#false} is VALID [2022-04-28 02:55:10,181 INFO L272 TraceCheckUtils]: 32: Hoare triple {4190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4190#false} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-28 02:55:10,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-28 02:55:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:10,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:10,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-28 02:55:10,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-28 02:55:10,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-28 02:55:10,518 INFO L272 TraceCheckUtils]: 32: Hoare triple {4190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4190#false} is VALID [2022-04-28 02:55:10,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {4190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4190#false} is VALID [2022-04-28 02:55:10,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {4332#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-28 02:55:10,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {4336#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4332#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:10,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {4336#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4336#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:10,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {4343#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4336#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:10,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {4343#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4343#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:10,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {4350#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4343#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:10,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {4350#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4350#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:10,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4350#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:10,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4357#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:10,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {4364#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4357#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:10,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {4364#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4364#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:10,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {4371#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4364#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:10,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {4371#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4371#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:10,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {4378#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4371#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:10,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {4378#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4378#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:10,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {4385#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4378#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:10,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {4385#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4385#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:10,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {4392#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4385#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:10,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {4392#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4392#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:10,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {4399#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4392#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:10,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {4399#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4399#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:10,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {4406#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4399#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:10,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {4406#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4406#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:10,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {4413#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4406#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:10,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {4413#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4413#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:10,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4413#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:10,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-28 02:55:10,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-28 02:55:10,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-28 02:55:10,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#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(12, 2); {4189#true} is VALID [2022-04-28 02:55:10,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2022-04-28 02:55:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:10,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694656518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:10,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:10,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 02:55:10,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:10,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436809188] [2022-04-28 02:55:10,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436809188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:10,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:10,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:55:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908024465] [2022-04-28 02:55:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 02:55:10,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:10,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:10,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:55:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:55:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:55:10,554 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:10,805 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:55:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 02:55:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 02:55:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-28 02:55:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-28 02:55:10,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-28 02:55:10,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:10,850 INFO L225 Difference]: With dead ends: 46 [2022-04-28 02:55:10,850 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 02:55:10,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 02:55:10,851 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:10,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 02:55:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-28 02:55:10,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:10,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,916 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,916 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:10,917 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:55:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:55:10,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:10,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:10,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:55:10,917 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:55:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:10,918 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:55:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:55:10,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:10,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:10,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:10,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 02:55:10,919 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-28 02:55:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:10,919 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 02:55:10,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:10,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 02:55:10,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 02:55:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:55:10,949 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:10,949 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:10,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:11,154 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 02:55:11,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1562555020, now seen corresponding path program 25 times [2022-04-28 02:55:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472347787] [2022-04-28 02:55:11,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:11,157 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:11,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1562555020, now seen corresponding path program 26 times [2022-04-28 02:55:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698261852] [2022-04-28 02:55:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:11,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {4732#(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(12, 2); {4713#true} is VALID [2022-04-28 02:55:11,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-28 02:55:11,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-28 02:55:11,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:11,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#(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(12, 2); {4713#true} is VALID [2022-04-28 02:55:11,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-28 02:55:11,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-28 02:55:11,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-28 02:55:11,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4718#(= main_~i~0 0)} is VALID [2022-04-28 02:55:11,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4718#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4718#(= main_~i~0 0)} is VALID [2022-04-28 02:55:11,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {4718#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:11,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {4719#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4719#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:11,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {4719#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:11,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {4720#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4720#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:11,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {4720#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:11,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {4721#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4721#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:11,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {4721#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:11,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {4722#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4722#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:11,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {4722#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:11,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {4723#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4723#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:11,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {4723#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:11,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {4724#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4724#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:11,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:11,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {4725#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4725#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:11,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {4725#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:11,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {4726#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4726#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:11,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {4726#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:11,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {4727#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4727#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:11,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {4727#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:11,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {4728#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4728#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:11,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {4728#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:11,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {4729#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4729#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:11,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {4729#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:11,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {4730#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4730#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:11,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {4730#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4731#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:11,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {4731#(<= main_~i~0 13)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-28 02:55:11,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {4714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4714#false} is VALID [2022-04-28 02:55:11,306 INFO L272 TraceCheckUtils]: 34: Hoare triple {4714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4714#false} is VALID [2022-04-28 02:55:11,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-28 02:55:11,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-28 02:55:11,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-28 02:55:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698261852] [2022-04-28 02:55:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698261852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255554722] [2022-04-28 02:55:11,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:11,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:11,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:11,308 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 02:55:11,309 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 02:55:11,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:11,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:11,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 02:55:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:11,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4713#true} is VALID [2022-04-28 02:55:11,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#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(12, 2); {4713#true} is VALID [2022-04-28 02:55:11,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-28 02:55:11,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-28 02:55:11,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-28 02:55:11,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4751#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:11,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {4751#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4751#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:11,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {4751#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:11,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {4719#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4719#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:11,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {4719#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:11,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {4720#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4720#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:11,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {4720#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:11,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {4721#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4721#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:11,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {4721#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:11,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {4722#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4722#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:11,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {4722#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:11,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {4723#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4723#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:11,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {4723#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:11,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {4724#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4724#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:11,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:11,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {4725#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4725#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:11,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {4725#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:11,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {4726#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4726#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:11,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {4726#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:11,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {4727#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4727#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:11,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {4727#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:11,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {4728#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4728#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:11,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {4728#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:11,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {4729#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4729#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:11,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {4729#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:11,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {4730#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4730#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {4730#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4731#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {4731#(<= main_~i~0 13)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {4714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4714#false} is VALID [2022-04-28 02:55:11,608 INFO L272 TraceCheckUtils]: 34: Hoare triple {4714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4714#false} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-28 02:55:11,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-28 02:55:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:11,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:12,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-28 02:55:12,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-28 02:55:12,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-28 02:55:12,022 INFO L272 TraceCheckUtils]: 34: Hoare triple {4714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4714#false} is VALID [2022-04-28 02:55:12,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {4714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4714#false} is VALID [2022-04-28 02:55:12,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {4863#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-28 02:55:12,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {4867#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4863#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:12,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {4867#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4867#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:12,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4867#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:12,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4874#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:12,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {4881#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4874#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:12,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {4881#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4881#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:12,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {4888#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4881#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:12,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {4888#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4888#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:12,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {4895#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4888#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:12,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {4895#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4895#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:12,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {4902#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4895#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:12,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {4902#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4902#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:12,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {4909#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4902#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:12,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4909#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:12,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {4916#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4909#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:12,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {4916#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4916#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:12,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {4923#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4916#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:12,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {4923#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4923#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:12,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4923#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:12,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4930#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:12,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {4937#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4930#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:12,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {4937#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4937#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:12,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {4944#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4937#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:12,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {4944#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4944#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:12,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {4951#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4944#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:12,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {4951#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4951#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:12,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {4713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4951#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:12,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-28 02:55:12,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-28 02:55:12,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-28 02:55:12,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#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(12, 2); {4713#true} is VALID [2022-04-28 02:55:12,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4713#true} is VALID [2022-04-28 02:55:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:12,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255554722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:12,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:12,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 02:55:12,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:12,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472347787] [2022-04-28 02:55:12,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472347787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:12,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:12,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:55:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016968958] [2022-04-28 02:55:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:12,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:55:12,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:12,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:12,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:55:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:55:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:55:12,057 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:12,336 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:55:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:55:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:55:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-28 02:55:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-28 02:55:12,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-04-28 02:55:12,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:12,371 INFO L225 Difference]: With dead ends: 48 [2022-04-28 02:55:12,371 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 02:55:12,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:55:12,374 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:12,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 02:55:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 02:55:12,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:12,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,428 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,428 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:12,428 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:55:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:55:12,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:12,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:12,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:55:12,429 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 02:55:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:12,431 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:55:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:55:12,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:12,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:12,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:12,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 02:55:12,433 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-28 02:55:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:12,433 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 02:55:12,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:12,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 02:55:12,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 02:55:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 02:55:12,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:12,465 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:12,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 02:55:12,665 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 02:55:12,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:12,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash 749091990, now seen corresponding path program 27 times [2022-04-28 02:55:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:12,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119221482] [2022-04-28 02:55:12,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:12,668 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:12,668 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 749091990, now seen corresponding path program 28 times [2022-04-28 02:55:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:12,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100073816] [2022-04-28 02:55:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:12,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {5285#(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(12, 2); {5265#true} is VALID [2022-04-28 02:55:12,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-28 02:55:12,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-28 02:55:12,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} call ULTIMATE.init(); {5285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:12,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {5285#(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(12, 2); {5265#true} is VALID [2022-04-28 02:55:12,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-28 02:55:12,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-28 02:55:12,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-28 02:55:12,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5270#(= main_~i~0 0)} is VALID [2022-04-28 02:55:12,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5270#(= main_~i~0 0)} is VALID [2022-04-28 02:55:12,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5271#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:12,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {5271#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5271#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:12,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {5271#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5272#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:12,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {5272#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5272#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:12,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {5272#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5273#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:12,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {5273#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5273#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:12,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {5273#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5274#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:12,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {5274#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5274#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:12,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {5274#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5275#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:12,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {5275#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5275#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:12,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {5275#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5276#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:12,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {5276#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5276#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:12,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {5276#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5277#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:12,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {5277#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5277#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:12,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {5277#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5278#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:12,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {5278#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5278#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:12,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {5278#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5279#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:12,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {5279#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5279#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:12,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {5279#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5280#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:12,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {5280#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5280#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:12,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {5280#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5281#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:12,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {5281#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5281#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:12,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {5281#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5282#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:12,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {5282#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5282#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:12,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {5282#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5283#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:12,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {5283#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5283#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:12,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {5283#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5284#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:12,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {5284#(<= main_~i~0 14)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {5266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L272 TraceCheckUtils]: 36: Hoare triple {5266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-28 02:55:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100073816] [2022-04-28 02:55:12,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100073816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:12,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383160980] [2022-04-28 02:55:12,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:12,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:12,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:12,830 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 02:55:12,831 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 02:55:12,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:12,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 02:55:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:12,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:13,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} call ULTIMATE.init(); {5265#true} is VALID [2022-04-28 02:55:13,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#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(12, 2); {5265#true} is VALID [2022-04-28 02:55:13,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-28 02:55:13,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-28 02:55:13,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-28 02:55:13,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5304#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:13,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5304#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:13,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {5304#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5271#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:13,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {5271#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5271#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:13,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {5271#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5272#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:13,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {5272#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5272#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:13,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {5272#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5273#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:13,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {5273#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5273#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:13,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {5273#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5274#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:13,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {5274#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5274#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:13,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {5274#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5275#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:13,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {5275#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5275#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:13,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {5275#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5276#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:13,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {5276#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5276#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:13,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {5276#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5277#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:13,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {5277#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5277#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:13,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {5277#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5278#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:13,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {5278#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5278#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:13,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {5278#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5279#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:13,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {5279#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5279#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:13,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {5279#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5280#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:13,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {5280#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5280#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:13,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {5280#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5281#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:13,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {5281#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5281#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:13,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {5281#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5282#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:13,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {5282#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5282#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:13,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {5282#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5283#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:13,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {5283#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5283#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:13,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {5283#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5284#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:13,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {5284#(<= main_~i~0 14)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {5266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L272 TraceCheckUtils]: 36: Hoare triple {5266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-28 02:55:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:13,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:13,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L272 TraceCheckUtils]: 36: Hoare triple {5266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {5266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {5422#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-28 02:55:13,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {5426#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5422#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:13,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {5426#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5426#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:13,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {5433#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5426#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:13,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {5433#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5433#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:13,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {5440#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5433#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:13,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {5440#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5440#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:13,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {5447#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5440#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:13,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {5447#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5447#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:13,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {5454#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5447#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:13,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {5454#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5454#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:13,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {5461#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5454#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:13,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {5461#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5461#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:13,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {5468#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5461#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:13,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {5468#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5468#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:13,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {5475#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5468#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:13,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {5475#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5475#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:13,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5475#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:13,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {5482#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5482#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:13,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {5489#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5482#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:13,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {5489#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5489#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:13,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {5496#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5489#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:13,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {5496#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5496#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:13,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {5503#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5496#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:13,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {5503#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5503#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:13,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {5510#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5503#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:13,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {5510#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5510#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:13,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {5517#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5510#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:13,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {5517#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5517#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:13,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5517#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:13,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-28 02:55:13,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-28 02:55:13,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-28 02:55:13,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#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(12, 2); {5265#true} is VALID [2022-04-28 02:55:13,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} call ULTIMATE.init(); {5265#true} is VALID [2022-04-28 02:55:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:13,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383160980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:13,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:13,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 02:55:13,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:13,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119221482] [2022-04-28 02:55:13,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119221482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:13,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:13,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:55:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839980135] [2022-04-28 02:55:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 02:55:13,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:13,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:13,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:13,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:55:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:55:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:55:13,616 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:13,918 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:55:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:55:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 02:55:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-28 02:55:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-28 02:55:13,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 50 transitions. [2022-04-28 02:55:13,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:13,963 INFO L225 Difference]: With dead ends: 50 [2022-04-28 02:55:13,963 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 02:55:13,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 02:55:13,964 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:13,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 44 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 02:55:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 02:55:14,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:14,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:14,013 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:14,013 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:14,014 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:55:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:55:14,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:14,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:14,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:55:14,014 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:55:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:14,014 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:55:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:55:14,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:14,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:14,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:14,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 02:55:14,015 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-28 02:55:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:14,016 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 02:55:14,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:14,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 02:55:14,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 02:55:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 02:55:14,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:14,049 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:14,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 02:55:14,249 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 02:55:14,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1743776568, now seen corresponding path program 29 times [2022-04-28 02:55:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:14,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839065683] [2022-04-28 02:55:14,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:14,253 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:14,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1743776568, now seen corresponding path program 30 times [2022-04-28 02:55:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974751997] [2022-04-28 02:55:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:14,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {5866#(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(12, 2); {5845#true} is VALID [2022-04-28 02:55:14,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 02:55:14,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-28 02:55:14,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:14,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {5866#(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(12, 2); {5845#true} is VALID [2022-04-28 02:55:14,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 02:55:14,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-28 02:55:14,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-28 02:55:14,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5850#(= main_~i~0 0)} is VALID [2022-04-28 02:55:14,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5850#(= main_~i~0 0)} is VALID [2022-04-28 02:55:14,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {5850#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5851#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:14,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {5851#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:14,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {5851#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5852#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:14,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {5852#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:14,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {5852#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5853#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:14,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {5853#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:14,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {5853#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5854#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:14,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {5854#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:14,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {5854#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5855#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:14,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:14,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {5855#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5856#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:14,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {5856#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:14,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {5856#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5857#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:14,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {5857#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:14,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {5857#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5858#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:14,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {5858#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5858#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:14,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {5858#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5859#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:14,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {5859#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5859#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:14,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {5859#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5860#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:14,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {5860#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5860#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:14,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {5860#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5861#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:14,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {5861#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5861#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:14,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {5861#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5862#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:14,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {5862#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5862#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:14,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {5862#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5863#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:14,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {5863#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5863#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:14,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {5863#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5864#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:14,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {5864#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5864#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {5864#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5865#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {5865#(<= main_~i~0 15)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5846#false} is VALID [2022-04-28 02:55:14,490 INFO L272 TraceCheckUtils]: 38: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5846#false} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 02:55:14,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 02:55:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974751997] [2022-04-28 02:55:14,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974751997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812943255] [2022-04-28 02:55:14,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:14,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:14,492 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 02:55:14,492 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 02:55:14,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 02:55:14,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:14,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:55:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:14,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:14,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-28 02:55:14,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#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(12, 2); {5845#true} is VALID [2022-04-28 02:55:14,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 02:55:14,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-28 02:55:14,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-28 02:55:14,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5885#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:14,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {5885#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5885#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:14,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {5885#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5851#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:14,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {5851#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:14,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {5851#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5852#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:14,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {5852#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:14,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {5852#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5853#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:14,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {5853#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:14,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {5853#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5854#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:14,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {5854#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:14,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {5854#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5855#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:14,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:14,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {5855#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5856#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:14,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {5856#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:14,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {5856#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5857#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:14,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {5857#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:14,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {5857#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5858#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:14,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {5858#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5858#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:14,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {5858#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5859#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:14,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {5859#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5859#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:14,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {5859#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5860#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:14,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {5860#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5860#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:14,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {5860#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5861#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:14,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {5861#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5861#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:14,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {5861#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5862#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:14,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {5862#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5862#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:14,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {5862#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5863#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:14,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {5863#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5863#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:14,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {5863#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5864#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:14,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {5864#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5864#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:14,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {5864#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5865#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:14,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {5865#(<= main_~i~0 15)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L272 TraceCheckUtils]: 38: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 02:55:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:14,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:15,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-28 02:55:15,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-28 02:55:15,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-28 02:55:15,443 INFO L272 TraceCheckUtils]: 38: Hoare triple {5846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {5846#false} is VALID [2022-04-28 02:55:15,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {5846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5846#false} is VALID [2022-04-28 02:55:15,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {6009#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-28 02:55:15,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {6013#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6009#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:15,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {6013#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6013#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:15,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {6020#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6013#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:15,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {6020#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6020#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:15,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {6027#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6020#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:15,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {6027#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6027#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:15,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {6034#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6027#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:15,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {6034#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6034#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:15,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {6041#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6034#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:15,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {6041#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6041#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:15,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {6048#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6041#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:15,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {6048#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6048#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:15,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {6055#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6048#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:15,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {6055#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6055#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:15,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {6062#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6055#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:15,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {6062#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6062#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:15,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {6069#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6062#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:15,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {6069#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6069#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:15,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6076#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6069#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:15,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6076#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6076#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:15,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {6083#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6076#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:15,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {6083#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6083#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:15,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {6090#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6083#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:15,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {6090#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6090#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:15,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {6097#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6090#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:15,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {6097#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6097#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:15,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {6104#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6097#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:15,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {6104#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6104#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:15,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {6111#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6104#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:15,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {6111#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6111#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:15,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {5845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6111#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:15,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-28 02:55:15,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-28 02:55:15,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-28 02:55:15,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#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(12, 2); {5845#true} is VALID [2022-04-28 02:55:15,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-28 02:55:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812943255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:15,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:15,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 02:55:15,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839065683] [2022-04-28 02:55:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839065683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:15,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:15,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:55:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514254455] [2022-04-28 02:55:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:15,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 02:55:15,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:15,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:15,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:55:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:55:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:55:15,487 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:15,824 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:55:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 02:55:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 02:55:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 02:55:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-28 02:55:15,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-28 02:55:15,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:15,860 INFO L225 Difference]: With dead ends: 52 [2022-04-28 02:55:15,860 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 02:55:15,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:55:15,862 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:15,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 02:55:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-28 02:55:15,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:15,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,913 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,913 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:15,913 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:55:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:55:15,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:15,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:15,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:55:15,914 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 02:55:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:15,914 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:55:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:55:15,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:15,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:15,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:15,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 02:55:15,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-28 02:55:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:15,915 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 02:55:15,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:15,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 02:55:15,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 02:55:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 02:55:15,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:15,957 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:15,974 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 02:55:16,158 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 02:55:16,158 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -142050982, now seen corresponding path program 31 times [2022-04-28 02:55:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804957649] [2022-04-28 02:55:16,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:16,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:16,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash -142050982, now seen corresponding path program 32 times [2022-04-28 02:55:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:16,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155065574] [2022-04-28 02:55:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:16,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {6475#(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(12, 2); {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {6453#true} call ULTIMATE.init(); {6475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {6475#(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(12, 2); {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-28 02:55:16,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-28 02:55:16,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {6453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6458#(= main_~i~0 0)} is VALID [2022-04-28 02:55:16,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {6458#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6458#(= main_~i~0 0)} is VALID [2022-04-28 02:55:16,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {6458#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6459#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:16,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {6459#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6459#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:16,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {6459#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6460#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:16,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {6460#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6460#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:16,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {6460#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6461#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:16,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6461#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:16,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6462#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:16,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {6462#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6462#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:16,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {6462#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6463#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:16,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6463#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:16,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {6463#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6464#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:16,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {6464#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6464#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:16,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {6464#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6465#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:16,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {6465#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6465#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:16,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {6465#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6466#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:16,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {6466#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6466#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:16,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {6466#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6467#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:16,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {6467#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6467#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:16,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {6467#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6468#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:16,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {6468#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6468#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:16,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {6468#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6469#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:16,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6469#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:16,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6470#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:16,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {6470#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6470#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:16,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {6470#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6471#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:16,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {6471#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6471#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:16,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {6471#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6472#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:16,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {6472#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6472#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:16,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {6472#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6473#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:16,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {6473#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6473#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:16,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {6473#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6474#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:16,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {6474#(<= main_~i~0 16)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {6454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L272 TraceCheckUtils]: 40: Hoare triple {6454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-28 02:55:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:16,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155065574] [2022-04-28 02:55:16,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155065574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:16,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809832283] [2022-04-28 02:55:16,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:16,368 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 02:55:16,368 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 02:55:16,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:16,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 02:55:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:16,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:16,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {6453#true} call ULTIMATE.init(); {6453#true} is VALID [2022-04-28 02:55:16,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {6453#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(12, 2); {6453#true} is VALID [2022-04-28 02:55:16,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-28 02:55:16,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-28 02:55:16,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-28 02:55:16,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {6453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6494#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:16,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {6494#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6494#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:16,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {6494#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6459#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:16,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {6459#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6459#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:16,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {6459#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6460#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:16,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {6460#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6460#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:16,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {6460#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6461#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:16,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6461#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:16,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6462#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:16,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {6462#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6462#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:16,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6462#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6463#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:16,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6463#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:16,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {6463#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6464#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:16,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {6464#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6464#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:16,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {6464#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6465#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:16,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {6465#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6465#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:16,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {6465#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6466#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:16,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {6466#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6466#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:16,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {6466#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6467#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:16,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {6467#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6467#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:16,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {6467#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6468#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:16,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {6468#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6468#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:16,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {6468#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6469#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:16,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6469#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:16,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6470#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:16,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {6470#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6470#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:16,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {6470#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6471#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:16,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {6471#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6471#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:16,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {6471#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6472#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:16,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {6472#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6472#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:16,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {6472#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6473#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:16,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {6473#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6473#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {6473#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6474#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {6474#(<= main_~i~0 16)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {6454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L272 TraceCheckUtils]: 40: Hoare triple {6454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-28 02:55:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:17,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-28 02:55:17,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-28 02:55:17,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-28 02:55:17,183 INFO L272 TraceCheckUtils]: 40: Hoare triple {6454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {6454#false} is VALID [2022-04-28 02:55:17,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {6454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6454#false} is VALID [2022-04-28 02:55:17,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {6624#(< main_~i~0 2048)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-28 02:55:17,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {6628#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6624#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:17,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {6628#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6628#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:17,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {6635#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6628#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:17,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {6635#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6635#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:17,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {6642#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6635#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:17,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {6642#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6642#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:17,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {6649#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6642#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:17,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {6649#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6649#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:17,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {6656#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6649#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:17,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {6656#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6656#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:17,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {6663#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6656#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:17,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {6663#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6663#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:17,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {6670#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6663#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:17,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {6670#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6670#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:17,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {6677#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6670#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:17,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {6677#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6677#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:17,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {6684#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6677#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:17,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {6684#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6684#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:17,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {6691#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6684#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:17,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {6691#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6691#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:17,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6691#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:17,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {6698#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6698#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:17,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {6705#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6698#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:17,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {6705#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6705#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:17,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {6712#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6705#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:17,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {6712#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6712#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:17,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {6719#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6712#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:17,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {6719#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6719#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:17,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {6726#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6719#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:17,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {6726#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6726#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:17,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {6733#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6726#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:17,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {6733#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6733#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:17,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {6453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6733#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:17,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-28 02:55:17,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-28 02:55:17,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-28 02:55:17,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {6453#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(12, 2); {6453#true} is VALID [2022-04-28 02:55:17,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {6453#true} call ULTIMATE.init(); {6453#true} is VALID [2022-04-28 02:55:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:17,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809832283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:17,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:17,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 02:55:17,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:17,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804957649] [2022-04-28 02:55:17,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804957649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:17,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:17,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:55:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916544228] [2022-04-28 02:55:17,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 02:55:17,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:17,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:55:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:55:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:55:17,246 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:17,562 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:55:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:55:17,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 02:55:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-28 02:55:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-28 02:55:17,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 54 transitions. [2022-04-28 02:55:17,603 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 02:55:17,603 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:55:17,603 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 02:55:17,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 02:55:17,605 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:17,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 24 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 02:55:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-28 02:55:17,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:17,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,666 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,667 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:17,667 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:55:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:55:17,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:17,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:17,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 02:55:17,668 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 02:55:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:17,668 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:55:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:55:17,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:17,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:17,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:17,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 02:55:17,669 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-28 02:55:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:17,669 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 02:55:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:17,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 02:55:17,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 02:55:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 02:55:17,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:17,715 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:17,731 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 02:55:17,927 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 02:55:17,928 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash 53872380, now seen corresponding path program 33 times [2022-04-28 02:55:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:17,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882433785] [2022-04-28 02:55:17,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:17,932 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:17,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 53872380, now seen corresponding path program 34 times [2022-04-28 02:55:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917718871] [2022-04-28 02:55:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:18,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {7112#(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(12, 2); {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {7089#true} call ULTIMATE.init(); {7112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:18,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {7112#(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(12, 2); {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-28 02:55:18,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-28 02:55:18,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {7089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7094#(= main_~i~0 0)} is VALID [2022-04-28 02:55:18,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {7094#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7094#(= main_~i~0 0)} is VALID [2022-04-28 02:55:18,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {7094#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7095#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:18,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {7095#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7095#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:18,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {7095#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7096#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:18,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {7096#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7096#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:18,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {7096#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7097#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:18,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {7097#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7097#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:18,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {7097#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7098#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:18,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {7098#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7098#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:18,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {7098#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7099#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:18,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {7099#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7099#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:18,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {7099#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7100#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:18,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {7100#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7100#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:18,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {7100#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7101#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:18,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {7101#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7101#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:18,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {7101#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7102#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:18,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {7102#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7102#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:18,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {7102#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7103#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:18,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {7103#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7103#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:18,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {7103#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7104#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:18,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {7104#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7104#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:18,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {7104#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7105#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:18,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {7105#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7105#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:18,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {7105#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7106#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:18,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {7106#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7106#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:18,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {7106#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7107#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:18,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {7107#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7107#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:18,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {7107#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7108#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:18,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {7108#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7108#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:18,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {7108#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7109#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:18,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {7109#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7109#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:18,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {7109#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7110#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:18,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {7110#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7110#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:18,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {7110#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7111#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:18,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {7111#(<= main_~i~0 17)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-28 02:55:18,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {7090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7090#false} is VALID [2022-04-28 02:55:18,132 INFO L272 TraceCheckUtils]: 42: Hoare triple {7090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7090#false} is VALID [2022-04-28 02:55:18,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-28 02:55:18,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-28 02:55:18,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-28 02:55:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917718871] [2022-04-28 02:55:18,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917718871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542325814] [2022-04-28 02:55:18,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:18,134 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:18,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 02:55:18,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:18,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:18,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 02:55:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:18,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:18,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {7089#true} call ULTIMATE.init(); {7089#true} is VALID [2022-04-28 02:55:18,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {7089#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(12, 2); {7089#true} is VALID [2022-04-28 02:55:18,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-28 02:55:18,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-28 02:55:18,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-28 02:55:18,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {7089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7131#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:18,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {7131#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7131#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:18,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {7131#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7095#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:18,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {7095#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7095#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:18,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {7095#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7096#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:18,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {7096#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7096#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:18,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {7096#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7097#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:18,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {7097#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7097#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:18,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {7097#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7098#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:18,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {7098#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7098#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:18,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {7098#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7099#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:18,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {7099#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7099#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:18,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {7099#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7100#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:18,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {7100#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7100#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:18,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {7100#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7101#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:18,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {7101#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7101#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:18,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {7101#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7102#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:18,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {7102#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7102#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:18,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {7102#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7103#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:18,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {7103#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7103#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:18,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {7103#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7104#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:18,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {7104#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7104#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:18,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {7104#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7105#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:18,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {7105#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7105#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:18,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {7105#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7106#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:18,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {7106#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7106#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:18,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {7106#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7107#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:18,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {7107#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7107#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:18,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {7107#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7108#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:18,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {7108#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7108#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:18,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {7108#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7109#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:18,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {7109#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7109#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:18,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {7109#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7110#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:18,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {7110#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7110#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:18,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {7110#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7111#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:18,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {7111#(<= main_~i~0 17)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {7090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L272 TraceCheckUtils]: 42: Hoare triple {7090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-28 02:55:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:18,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:18,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-28 02:55:18,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-28 02:55:18,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-28 02:55:18,999 INFO L272 TraceCheckUtils]: 42: Hoare triple {7090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7090#false} is VALID [2022-04-28 02:55:18,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {7090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7090#false} is VALID [2022-04-28 02:55:19,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {7267#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-28 02:55:19,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {7271#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7267#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:19,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {7271#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7271#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:19,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {7278#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7271#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:19,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {7278#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7278#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:19,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {7285#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7278#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:19,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {7285#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7285#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:19,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {7292#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7285#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:19,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {7292#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7292#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:19,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {7299#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7292#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:19,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {7299#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7299#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:19,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {7306#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7299#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:19,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {7306#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7306#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:19,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {7313#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7306#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:19,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {7313#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7313#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:19,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {7320#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7313#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:19,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {7320#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7320#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:19,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {7327#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7320#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:19,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {7327#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7327#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:19,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {7334#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7327#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:19,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {7334#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7334#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:19,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {7341#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7334#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:19,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {7341#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7341#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:19,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {7348#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7341#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:19,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {7348#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7348#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:19,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {7355#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7348#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:19,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {7355#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7355#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:19,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {7362#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7355#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:19,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {7362#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7362#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:19,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {7369#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7362#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:19,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {7369#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7369#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:19,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {7376#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7369#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:19,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {7376#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7376#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:19,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {7383#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7376#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:19,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {7383#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7383#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:19,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {7089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7383#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:19,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-28 02:55:19,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-28 02:55:19,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-28 02:55:19,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {7089#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(12, 2); {7089#true} is VALID [2022-04-28 02:55:19,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {7089#true} call ULTIMATE.init(); {7089#true} is VALID [2022-04-28 02:55:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:19,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542325814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:19,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:19,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 02:55:19,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:19,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882433785] [2022-04-28 02:55:19,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882433785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:19,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:19,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 02:55:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058047381] [2022-04-28 02:55:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 02:55:19,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:19,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:19,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 02:55:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 02:55:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:55:19,043 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:19,406 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:55:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:55:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 02:55:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-28 02:55:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-28 02:55:19,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-28 02:55:19,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:19,446 INFO L225 Difference]: With dead ends: 56 [2022-04-28 02:55:19,446 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 02:55:19,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:55:19,448 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:19,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 02:55:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-28 02:55:19,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:19,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,514 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:19,515 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:55:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:55:19,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:19,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:19,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 02:55:19,516 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 02:55:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:19,516 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:55:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:55:19,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:19,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:19,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:19,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 02:55:19,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-28 02:55:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:19,517 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 02:55:19,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:19,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 02:55:19,555 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 02:55:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 02:55:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 02:55:19,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:19,556 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:19,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:19,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -642337762, now seen corresponding path program 35 times [2022-04-28 02:55:19,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:19,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768349195] [2022-04-28 02:55:19,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:19,759 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:19,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash -642337762, now seen corresponding path program 36 times [2022-04-28 02:55:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:19,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799763879] [2022-04-28 02:55:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:19,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {7777#(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(12, 2); {7753#true} is VALID [2022-04-28 02:55:19,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-28 02:55:19,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-28 02:55:19,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {7753#true} call ULTIMATE.init(); {7777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:19,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#(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(12, 2); {7753#true} is VALID [2022-04-28 02:55:19,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-28 02:55:19,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-28 02:55:19,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-28 02:55:19,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7758#(= main_~i~0 0)} is VALID [2022-04-28 02:55:19,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {7758#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7758#(= main_~i~0 0)} is VALID [2022-04-28 02:55:19,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {7758#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7759#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:19,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {7759#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7759#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:19,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {7759#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7760#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:19,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {7760#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7760#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:19,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {7760#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7761#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:19,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7761#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7761#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:19,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {7761#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7762#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:19,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {7762#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7762#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:19,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {7762#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7763#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:19,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {7763#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7763#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:19,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {7763#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7764#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:19,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {7764#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7764#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:19,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {7764#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7765#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:19,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {7765#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7765#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:19,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {7765#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7766#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:19,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {7766#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7766#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:19,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {7766#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7767#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:19,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {7767#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7767#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:19,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {7767#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7768#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:19,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {7768#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7768#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:19,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {7768#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7769#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:19,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {7769#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7769#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:19,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {7769#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7770#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:19,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {7770#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7770#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:19,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {7770#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7771#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:19,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {7771#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7771#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:19,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {7771#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7772#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:19,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {7772#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7772#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:19,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {7772#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7773#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:19,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {7773#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7773#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:19,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {7773#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7774#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:19,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {7774#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7774#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:19,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {7774#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7775#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:19,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {7775#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7775#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:19,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {7775#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7776#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:19,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {7776#(<= main_~i~0 18)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {7754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L272 TraceCheckUtils]: 44: Hoare triple {7754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-28 02:55:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799763879] [2022-04-28 02:55:19,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799763879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870221848] [2022-04-28 02:55:19,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:19,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:19,995 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:19,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 02:55:20,498 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 02:55:20,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:20,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 02:55:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:20,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:20,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {7753#true} call ULTIMATE.init(); {7753#true} is VALID [2022-04-28 02:55:20,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#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(12, 2); {7753#true} is VALID [2022-04-28 02:55:20,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-28 02:55:20,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-28 02:55:20,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-28 02:55:20,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7796#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:20,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {7796#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7796#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:20,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {7796#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7759#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:20,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {7759#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7759#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:20,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {7759#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7760#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:20,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {7760#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7760#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:20,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {7760#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7761#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:20,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {7761#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7761#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:20,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {7761#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7762#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:20,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {7762#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7762#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:20,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {7762#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7763#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:20,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {7763#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7763#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:20,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {7763#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7764#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:20,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {7764#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7764#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:20,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {7764#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7765#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:20,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {7765#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7765#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:20,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {7765#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7766#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:20,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {7766#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7766#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:20,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {7766#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7767#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:20,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {7767#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7767#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:20,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {7767#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7768#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:20,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {7768#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7768#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:20,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {7768#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7769#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:20,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {7769#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7769#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:20,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {7769#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7770#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:20,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {7770#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7770#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:20,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {7770#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7771#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:20,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {7771#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7771#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:20,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {7771#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7772#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:20,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {7772#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7772#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:20,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {7772#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7773#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:20,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {7773#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7773#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:20,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {7773#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7774#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:20,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {7774#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7774#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:20,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {7774#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7775#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {7775#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7775#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {7775#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7776#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {7776#(<= main_~i~0 18)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {7754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7754#false} is VALID [2022-04-28 02:55:20,740 INFO L272 TraceCheckUtils]: 44: Hoare triple {7754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7754#false} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-28 02:55:20,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-28 02:55:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:20,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:21,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-28 02:55:21,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-28 02:55:21,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-28 02:55:21,329 INFO L272 TraceCheckUtils]: 44: Hoare triple {7754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {7754#false} is VALID [2022-04-28 02:55:21,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {7754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7754#false} is VALID [2022-04-28 02:55:21,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {7938#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-28 02:55:21,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {7942#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7938#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:21,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {7942#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7942#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:21,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {7949#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7942#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:21,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {7949#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7949#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:21,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {7956#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7949#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:21,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {7956#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7956#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:21,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {7963#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7956#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:21,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {7963#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7963#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:21,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {7970#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7963#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:21,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {7970#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7970#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:21,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {7977#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7970#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:21,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {7977#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7977#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:21,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {7984#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7977#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:21,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {7984#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7984#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:21,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {7991#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7984#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:21,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {7991#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7991#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:21,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {7998#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7991#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:21,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {7998#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7998#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:21,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {8005#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7998#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:21,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {8005#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8005#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:21,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {8012#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8005#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:21,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {8012#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8012#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:21,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {8019#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8012#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:21,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {8019#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8019#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:21,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {8026#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8019#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:21,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {8026#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8026#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:21,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {8033#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8026#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:21,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {8033#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8033#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:21,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {8040#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8033#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:21,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {8040#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8040#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:21,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {8047#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8040#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:21,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {8047#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8047#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:21,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {8054#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8047#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:21,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {8054#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8054#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:21,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {8061#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8054#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:21,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {8061#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8061#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:21,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8061#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:21,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-28 02:55:21,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-28 02:55:21,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-28 02:55:21,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#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(12, 2); {7753#true} is VALID [2022-04-28 02:55:21,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {7753#true} call ULTIMATE.init(); {7753#true} is VALID [2022-04-28 02:55:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:21,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870221848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:21,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:21,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 02:55:21,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:21,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768349195] [2022-04-28 02:55:21,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768349195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:21,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:21,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 02:55:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043061371] [2022-04-28 02:55:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 02:55:21,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:21,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 02:55:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 02:55:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:55:21,373 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:21,769 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:55:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 02:55:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 02:55:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 02:55:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 02:55:21,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-28 02:55:21,818 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 02:55:21,819 INFO L225 Difference]: With dead ends: 58 [2022-04-28 02:55:21,819 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 02:55:21,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 02:55:21,821 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:21,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:55:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 02:55:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-28 02:55:21,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:21,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,899 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,899 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:21,900 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:55:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:55:21,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:21,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:21,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 02:55:21,900 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 02:55:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:21,901 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:55:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:55:21,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:21,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:21,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:21,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 02:55:21,902 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-28 02:55:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:21,902 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 02:55:21,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:21,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 02:55:22,010 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 02:55:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 02:55:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 02:55:22,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:22,010 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:22,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:22,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:22,211 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 314613952, now seen corresponding path program 37 times [2022-04-28 02:55:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:22,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367089394] [2022-04-28 02:55:22,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:22,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:22,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 314613952, now seen corresponding path program 38 times [2022-04-28 02:55:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:22,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107580582] [2022-04-28 02:55:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:22,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {8470#(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(12, 2); {8445#true} is VALID [2022-04-28 02:55:22,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-28 02:55:22,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-28 02:55:22,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:22,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {8470#(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(12, 2); {8445#true} is VALID [2022-04-28 02:55:22,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-28 02:55:22,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-28 02:55:22,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-28 02:55:22,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8450#(= main_~i~0 0)} is VALID [2022-04-28 02:55:22,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {8450#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8450#(= main_~i~0 0)} is VALID [2022-04-28 02:55:22,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {8450#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8451#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:22,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {8451#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8451#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:22,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {8451#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8452#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:22,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {8452#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8452#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:22,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {8452#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:22,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {8453#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8453#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:22,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {8453#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:22,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {8454#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8454#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:22,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:22,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8455#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:22,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {8455#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:22,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {8456#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8456#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:22,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {8456#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:22,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {8457#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8457#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:22,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {8457#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:22,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {8458#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8458#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:22,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {8458#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:22,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {8459#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8459#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:22,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {8459#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:22,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {8460#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8460#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:22,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {8460#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:22,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {8461#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8461#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:22,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {8461#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:22,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {8462#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8462#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:22,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {8462#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:22,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {8463#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8463#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:22,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {8463#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:22,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {8464#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8464#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:22,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {8464#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:22,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {8465#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8465#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:22,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {8465#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:22,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {8466#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8466#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:22,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {8466#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8467#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:22,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {8467#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8467#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:22,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {8467#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8468#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:22,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {8468#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8468#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:22,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {8468#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8469#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:22,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {8469#(<= main_~i~0 19)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {8446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L272 TraceCheckUtils]: 46: Hoare triple {8446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-28 02:55:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107580582] [2022-04-28 02:55:22,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107580582] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450767605] [2022-04-28 02:55:22,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:22,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:22,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:22,464 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:22,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 02:55:22,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:22,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:55:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:22,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:22,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8445#true} is VALID [2022-04-28 02:55:22,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#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(12, 2); {8445#true} is VALID [2022-04-28 02:55:22,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-28 02:55:22,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-28 02:55:22,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-28 02:55:22,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8489#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:22,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {8489#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8489#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:22,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {8489#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8451#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:22,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {8451#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8451#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:22,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {8451#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8452#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:22,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {8452#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8452#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:22,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {8452#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:22,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {8453#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8453#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:22,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {8453#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:22,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {8454#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8454#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:22,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:22,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8455#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:22,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {8455#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:22,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {8456#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8456#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:22,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {8456#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:22,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {8457#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8457#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:22,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {8457#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:22,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {8458#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8458#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:22,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {8458#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:22,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {8459#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8459#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:22,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {8459#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:22,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {8460#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8460#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:22,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {8460#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:22,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {8461#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8461#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:22,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {8461#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:22,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {8462#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8462#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:22,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {8462#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:22,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {8463#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8463#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:22,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {8463#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:22,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {8464#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8464#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:22,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {8464#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:22,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {8465#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8465#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:22,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {8465#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:22,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {8466#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8466#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:22,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {8466#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8467#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:22,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {8467#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8467#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:22,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {8467#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8468#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:22,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {8468#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8468#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {8468#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8469#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {8469#(<= main_~i~0 19)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {8446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8446#false} is VALID [2022-04-28 02:55:22,823 INFO L272 TraceCheckUtils]: 46: Hoare triple {8446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8446#false} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-28 02:55:22,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-28 02:55:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:22,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:23,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-28 02:55:23,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-28 02:55:23,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-28 02:55:23,424 INFO L272 TraceCheckUtils]: 46: Hoare triple {8446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {8446#false} is VALID [2022-04-28 02:55:23,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {8446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8446#false} is VALID [2022-04-28 02:55:23,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {8637#(< main_~i~0 2048)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-28 02:55:23,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {8641#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8637#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:23,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {8641#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8641#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:23,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {8648#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8641#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:23,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {8648#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8648#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:23,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {8655#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8648#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:23,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {8655#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8655#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:23,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {8662#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8655#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:23,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {8662#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8662#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:23,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {8669#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8662#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:23,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {8669#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8669#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:23,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {8676#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8669#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:23,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8676#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:23,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {8683#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8676#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:23,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {8683#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8683#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:23,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {8690#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8683#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:23,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {8690#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8690#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:23,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {8697#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8690#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:23,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {8697#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8697#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:23,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {8704#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8697#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:23,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {8704#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8704#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:23,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {8711#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8704#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:23,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {8711#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8711#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:23,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {8718#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8711#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:23,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {8718#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8718#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:23,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {8725#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8718#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:23,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {8725#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8725#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:23,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {8732#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8725#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:23,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {8732#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8732#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:23,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {8739#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8732#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:23,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {8739#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8739#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:23,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8739#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:23,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {8746#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8746#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:23,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {8753#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8746#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:23,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {8753#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8753#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:23,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {8760#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8753#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:23,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {8760#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8760#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:23,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {8767#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8760#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:23,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {8767#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8767#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:23,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8767#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:23,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-28 02:55:23,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-28 02:55:23,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-28 02:55:23,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#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(12, 2); {8445#true} is VALID [2022-04-28 02:55:23,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8445#true} is VALID [2022-04-28 02:55:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:23,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450767605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:23,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:23,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 02:55:23,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:23,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367089394] [2022-04-28 02:55:23,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367089394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:23,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:23,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 02:55:23,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474427691] [2022-04-28 02:55:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 02:55:23,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:23,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:23,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 02:55:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 02:55:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 02:55:23,469 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:23,881 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:55:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:55:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 02:55:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 02:55:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 02:55:23,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-28 02:55:23,926 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 02:55:23,926 INFO L225 Difference]: With dead ends: 60 [2022-04-28 02:55:23,926 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 02:55:23,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:55:23,928 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:23,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 02:55:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 02:55:24,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:24,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:24,007 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:24,007 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:24,008 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:55:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 02:55:24,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:24,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:24,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 02:55:24,009 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 02:55:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:24,010 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:55:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 02:55:24,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:24,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:24,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:24,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 02:55:24,010 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-28 02:55:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:24,011 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 02:55:24,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:24,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 02:55:24,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 02:55:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 02:55:24,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:24,075 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:24,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 02:55:24,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:24,279 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash 822209762, now seen corresponding path program 39 times [2022-04-28 02:55:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:24,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [489311240] [2022-04-28 02:55:24,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:24,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:24,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash 822209762, now seen corresponding path program 40 times [2022-04-28 02:55:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:24,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083081599] [2022-04-28 02:55:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:24,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {9191#(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(12, 2); {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:24,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#(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(12, 2); {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-28 02:55:24,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-28 02:55:24,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {9165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9170#(= main_~i~0 0)} is VALID [2022-04-28 02:55:24,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {9170#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9170#(= main_~i~0 0)} is VALID [2022-04-28 02:55:24,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {9170#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9171#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:24,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {9171#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9171#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:24,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {9171#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9172#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:24,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {9172#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9172#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:24,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {9172#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9173#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:24,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {9173#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9173#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:24,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {9173#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9174#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:24,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {9174#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9174#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:24,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {9174#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9175#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:24,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {9175#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9175#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:24,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {9175#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9176#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:24,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {9176#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9176#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:24,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {9176#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9177#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:24,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {9177#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9177#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:24,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {9177#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9178#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:24,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {9178#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9178#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:24,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {9178#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9179#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:24,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {9179#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9179#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:24,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {9179#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9180#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:24,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {9180#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9180#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:24,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {9180#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9181#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:24,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {9181#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9181#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:24,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {9181#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9182#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:24,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {9182#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9182#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:24,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {9182#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9183#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:24,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9183#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:24,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {9183#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9184#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:24,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {9184#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9184#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:24,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {9184#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9185#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:24,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {9185#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9185#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:24,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {9185#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9186#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:24,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {9186#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9186#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:24,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {9186#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9187#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:24,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {9187#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9187#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:24,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {9187#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9188#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:24,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {9188#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9188#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:24,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {9188#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9189#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:24,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {9189#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9189#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:24,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {9189#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9190#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:24,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {9190#(<= main_~i~0 20)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {9166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L272 TraceCheckUtils]: 48: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-28 02:55:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:24,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083081599] [2022-04-28 02:55:24,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083081599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:24,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585146458] [2022-04-28 02:55:24,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:24,511 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:24,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 02:55:24,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:24,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:24,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 02:55:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:24,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:24,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2022-04-28 02:55:24,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {9165#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(12, 2); {9165#true} is VALID [2022-04-28 02:55:24,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-28 02:55:24,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-28 02:55:24,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-28 02:55:24,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {9165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9210#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:24,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {9210#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9210#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:24,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {9210#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9171#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:24,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {9171#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9171#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:24,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {9171#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9172#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:24,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {9172#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9172#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:24,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {9172#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9173#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:24,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {9173#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9173#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:24,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {9173#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9174#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:24,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {9174#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9174#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:24,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {9174#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9175#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:24,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {9175#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9175#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:24,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {9175#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9176#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:24,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {9176#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9176#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:24,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {9176#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9177#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:24,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {9177#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9177#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:24,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {9177#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9178#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:24,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {9178#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9178#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:24,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {9178#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9179#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:24,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {9179#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9179#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:24,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {9179#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9180#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:24,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {9180#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9180#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:24,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {9180#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9181#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:24,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {9181#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9181#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:24,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {9181#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9182#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:24,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {9182#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9182#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:24,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {9182#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9183#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:24,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9183#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:24,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {9183#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9184#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:24,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {9184#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9184#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:24,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {9184#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9185#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:24,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {9185#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9185#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:24,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {9185#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9186#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:24,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {9186#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9186#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:24,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {9186#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9187#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:24,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {9187#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9187#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:24,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {9187#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9188#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:24,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {9188#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9188#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:24,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {9188#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9189#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:24,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {9189#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9189#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {9189#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9190#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {9190#(<= main_~i~0 20)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {9166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9166#false} is VALID [2022-04-28 02:55:24,912 INFO L272 TraceCheckUtils]: 48: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9166#false} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-28 02:55:24,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-28 02:55:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:24,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:25,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-28 02:55:25,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-28 02:55:25,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-28 02:55:25,578 INFO L272 TraceCheckUtils]: 48: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9166#false} is VALID [2022-04-28 02:55:25,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {9166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9166#false} is VALID [2022-04-28 02:55:25,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {9364#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-28 02:55:25,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {9368#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9364#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:25,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {9368#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9368#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:25,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {9375#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9368#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:25,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {9375#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9375#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:25,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {9382#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9375#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:25,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {9382#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9382#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:25,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {9389#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9382#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:25,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {9389#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9389#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:25,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {9396#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9389#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:25,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {9396#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9396#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:25,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {9403#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9396#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:25,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {9403#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9403#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:25,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {9410#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9403#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:25,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {9410#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9410#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:25,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {9417#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9410#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:25,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {9417#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9417#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:25,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {9424#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9417#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:25,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {9424#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9424#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:25,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {9431#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9424#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:25,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {9431#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9431#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:25,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {9438#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9431#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:25,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {9438#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9438#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:25,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {9445#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9438#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:25,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {9445#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9445#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:25,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9452#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9445#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:25,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {9452#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9452#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:25,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {9459#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9452#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:25,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {9459#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9459#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:25,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {9466#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9459#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:25,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {9466#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9466#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:25,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {9473#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9466#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:25,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {9473#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9473#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:25,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {9480#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:25,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {9480#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9480#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:25,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {9487#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:25,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {9487#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9487#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:25,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {9494#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9487#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:25,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {9494#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9494#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:25,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {9501#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9494#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:25,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {9501#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9501#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:25,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {9165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9501#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:25,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-28 02:55:25,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-28 02:55:25,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-28 02:55:25,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {9165#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(12, 2); {9165#true} is VALID [2022-04-28 02:55:25,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2022-04-28 02:55:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:25,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585146458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:25,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 02:55:25,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [489311240] [2022-04-28 02:55:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [489311240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:25,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 02:55:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346060091] [2022-04-28 02:55:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 02:55:25,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:25,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:25,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:25,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 02:55:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 02:55:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:55:25,636 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:26,123 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:55:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 02:55:26,123 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 02:55:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 02:55:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 02:55:26,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions. [2022-04-28 02:55:26,172 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 02:55:26,173 INFO L225 Difference]: With dead ends: 62 [2022-04-28 02:55:26,173 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 02:55:26,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 02:55:26,175 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:26,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 24 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 02:55:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-28 02:55:26,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:26,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,277 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,277 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:26,277 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:55:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 02:55:26,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:26,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:26,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 02:55:26,278 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 02:55:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:26,278 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:55:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 02:55:26,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:26,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:26,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:26,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 02:55:26,279 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-28 02:55:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:26,280 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 02:55:26,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:26,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 02:55:26,334 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 02:55:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 02:55:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 02:55:26,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:26,335 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:26,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:26,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 02:55:26,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1004488572, now seen corresponding path program 41 times [2022-04-28 02:55:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:26,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654685843] [2022-04-28 02:55:26,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:26,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:26,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1004488572, now seen corresponding path program 42 times [2022-04-28 02:55:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495110191] [2022-04-28 02:55:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:26,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {9940#(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(12, 2); {9913#true} is VALID [2022-04-28 02:55:26,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {9913#true} call ULTIMATE.init(); {9940#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:26,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {9940#(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(12, 2); {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-28 02:55:26,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {9913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9918#(= main_~i~0 0)} is VALID [2022-04-28 02:55:26,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {9918#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9918#(= main_~i~0 0)} is VALID [2022-04-28 02:55:26,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {9918#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9919#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:26,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {9919#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9919#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:26,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {9919#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9920#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:26,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {9920#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9920#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:26,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {9920#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9921#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:26,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {9921#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9921#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:26,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {9921#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9922#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:26,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {9922#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9922#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:26,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {9922#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9923#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:26,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {9923#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9923#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:26,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {9923#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9924#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:26,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {9924#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9924#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:26,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {9924#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9925#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:26,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {9925#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9925#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:26,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {9925#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9926#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:26,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {9926#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9926#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:26,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {9926#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9927#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:26,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {9927#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9927#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:26,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {9927#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9928#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:26,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {9928#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9928#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:26,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {9928#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9929#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:26,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {9929#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9929#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:26,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {9929#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9930#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:26,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {9930#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9930#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:26,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {9930#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9931#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:26,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {9931#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9931#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:26,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {9931#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9932#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:26,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {9932#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9932#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:26,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {9932#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9933#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:26,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {9933#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9933#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:26,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {9933#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9934#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:26,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {9934#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9934#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:26,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {9934#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9935#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:26,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {9935#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9935#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:26,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {9935#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9936#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:26,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {9936#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9936#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:26,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {9936#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9937#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:26,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {9937#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9937#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:26,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {9937#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9938#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:26,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {9938#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9938#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:26,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {9938#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9939#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:26,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {9939#(<= main_~i~0 21)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {9914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L272 TraceCheckUtils]: 50: Hoare triple {9914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-28 02:55:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:26,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495110191] [2022-04-28 02:55:26,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495110191] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465586796] [2022-04-28 02:55:26,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:26,782 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:26,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 02:55:27,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 02:55:27,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:27,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:55:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:27,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {9913#true} call ULTIMATE.init(); {9913#true} is VALID [2022-04-28 02:55:27,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#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(12, 2); {9913#true} is VALID [2022-04-28 02:55:27,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-28 02:55:27,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-28 02:55:27,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-28 02:55:27,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {9913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9959#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:27,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {9959#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9959#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:27,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {9959#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9919#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:27,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {9919#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9919#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:27,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {9919#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9920#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:27,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {9920#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9920#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:27,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {9920#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9921#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:27,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {9921#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9921#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:27,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {9921#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9922#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:27,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {9922#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9922#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:27,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {9922#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9923#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:27,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {9923#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9923#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:27,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {9923#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9924#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:27,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {9924#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9924#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:27,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {9924#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9925#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:27,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {9925#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9925#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:27,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {9925#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9926#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:27,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {9926#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9926#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:27,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {9926#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9927#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:27,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {9927#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9927#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:27,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {9927#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9928#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:27,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {9928#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9928#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:27,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {9928#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9929#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:27,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {9929#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9929#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:27,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {9929#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9930#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:27,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {9930#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9930#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:27,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {9930#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9931#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:27,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {9931#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9931#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:27,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {9931#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9932#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:27,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {9932#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9932#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:27,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {9932#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9933#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:27,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {9933#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9933#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:27,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {9933#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9934#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:27,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {9934#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9934#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:27,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {9934#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9935#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:27,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {9935#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9935#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:27,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {9935#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9936#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:27,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {9936#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9936#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:27,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {9936#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9937#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:27,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {9937#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9937#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:27,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {9937#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9938#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:27,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {9938#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9938#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {9938#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9939#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {9939#(<= main_~i~0 21)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {9914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L272 TraceCheckUtils]: 50: Hoare triple {9914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-28 02:55:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:27,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:28,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-28 02:55:28,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-28 02:55:28,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-28 02:55:28,349 INFO L272 TraceCheckUtils]: 50: Hoare triple {9914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {9914#false} is VALID [2022-04-28 02:55:28,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {9914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9914#false} is VALID [2022-04-28 02:55:28,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-28 02:55:28,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {10123#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10119#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:28,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {10123#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10123#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:28,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {10130#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10123#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:28,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {10130#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10130#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:28,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {10137#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10130#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:28,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {10137#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10137#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:28,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {10144#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10137#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:28,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {10144#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10144#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:28,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {10151#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10144#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:28,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {10151#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10151#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:28,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {10158#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10151#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:28,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {10158#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10158#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:28,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {10165#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10158#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:28,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {10165#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10165#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:28,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {10172#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10165#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:28,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {10172#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10172#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:28,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {10179#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10172#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:28,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {10179#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10179#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:28,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {10186#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10179#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:28,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {10186#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10186#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:28,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {10193#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10186#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:28,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {10193#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10193#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:28,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {10200#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10193#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:28,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {10200#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10200#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:28,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {10207#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10200#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:28,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {10207#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10207#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:28,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {10214#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10207#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:28,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {10214#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10214#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:28,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {10221#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10214#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:28,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {10221#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10221#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:28,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {10228#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10221#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:28,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {10228#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10228#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:28,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {10235#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10228#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:28,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {10235#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10235#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:28,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {10242#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10235#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:28,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {10242#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10242#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:28,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {10249#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10242#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:28,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {10249#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10249#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:28,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {10256#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10249#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:28,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {10256#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10256#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:28,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {10263#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10256#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:28,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {10263#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10263#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:28,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {9913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10263#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:28,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-28 02:55:28,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-28 02:55:28,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-28 02:55:28,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#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(12, 2); {9913#true} is VALID [2022-04-28 02:55:28,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {9913#true} call ULTIMATE.init(); {9913#true} is VALID [2022-04-28 02:55:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:28,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465586796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:28,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:28,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 02:55:28,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:28,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654685843] [2022-04-28 02:55:28,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654685843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:28,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:28,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 02:55:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443321609] [2022-04-28 02:55:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 02:55:28,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:28,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:28,396 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 02:55:28,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 02:55:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 02:55:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:55:28,398 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:28,886 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:55:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 02:55:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 02:55:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-28 02:55:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-28 02:55:28,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2022-04-28 02:55:28,933 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 02:55:28,934 INFO L225 Difference]: With dead ends: 64 [2022-04-28 02:55:28,934 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 02:55:28,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:55:28,935 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:28,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 34 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 02:55:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-28 02:55:29,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:29,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:29,057 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:29,057 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:29,057 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:55:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 02:55:29,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:29,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:29,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:55:29,058 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:55:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:29,058 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 02:55:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 02:55:29,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:29,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:29,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:29,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 02:55:29,059 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-28 02:55:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:29,060 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 02:55:29,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:29,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 02:55:29,109 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 02:55:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 02:55:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 02:55:29,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:29,110 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:29,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:29,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 02:55:29,310 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash 180036518, now seen corresponding path program 43 times [2022-04-28 02:55:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:29,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1182574165] [2022-04-28 02:55:29,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:29,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:29,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 180036518, now seen corresponding path program 44 times [2022-04-28 02:55:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:29,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840700908] [2022-04-28 02:55:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:29,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {10717#(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(12, 2); {10689#true} is VALID [2022-04-28 02:55:29,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-28 02:55:29,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-28 02:55:29,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {10689#true} call ULTIMATE.init(); {10717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:29,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {10717#(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(12, 2); {10689#true} is VALID [2022-04-28 02:55:29,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-28 02:55:29,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-28 02:55:29,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-28 02:55:29,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {10689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10694#(= main_~i~0 0)} is VALID [2022-04-28 02:55:29,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {10694#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10694#(= main_~i~0 0)} is VALID [2022-04-28 02:55:29,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {10694#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10695#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:29,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {10695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:29,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {10695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10696#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:29,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {10696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:29,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {10696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10697#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:29,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {10697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:29,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {10697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10698#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:29,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {10698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:29,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {10698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10699#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:29,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {10699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:29,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {10699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10700#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:29,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {10700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:29,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {10700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10701#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:29,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {10701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10701#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:29,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {10701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10702#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:29,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {10702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10702#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:29,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {10702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10703#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:29,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {10703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10703#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:29,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {10703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:29,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {10704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10704#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:29,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {10704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10705#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:29,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {10705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10705#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:29,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {10705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10706#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:29,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {10706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10706#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:29,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {10706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10707#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:29,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {10707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10707#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:29,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {10707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10708#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:29,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {10708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10708#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:29,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {10708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10709#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:29,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {10709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10709#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:29,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {10709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10710#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:29,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {10710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10710#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:29,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {10710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:29,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {10711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10711#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:29,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {10711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10712#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:29,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {10712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10712#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:29,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {10712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10713#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:29,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {10713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10713#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:29,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {10713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10714#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:29,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {10714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10714#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:29,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {10714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10715#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:29,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {10715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10715#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:29,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {10715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10716#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:29,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {10716#(<= main_~i~0 22)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {10690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L272 TraceCheckUtils]: 52: Hoare triple {10690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-28 02:55:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:29,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840700908] [2022-04-28 02:55:29,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840700908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:29,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562275067] [2022-04-28 02:55:29,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:29,627 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:29,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 02:55:29,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:29,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:29,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 02:55:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:29,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:30,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {10689#true} call ULTIMATE.init(); {10689#true} is VALID [2022-04-28 02:55:30,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {10689#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(12, 2); {10689#true} is VALID [2022-04-28 02:55:30,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-28 02:55:30,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-28 02:55:30,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-28 02:55:30,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {10689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10736#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:30,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10736#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:30,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10695#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:30,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {10695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:30,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {10695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10696#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:30,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {10696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:30,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {10696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10697#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:30,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {10697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:30,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {10697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10698#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:30,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {10698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:30,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {10698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10699#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:30,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {10699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:30,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {10699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10700#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:30,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {10700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:30,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {10700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10701#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:30,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {10701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10701#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:30,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {10701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10702#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:30,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {10702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10702#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:30,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {10702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10703#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:30,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {10703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10703#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:30,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {10703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:30,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {10704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10704#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:30,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {10704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10705#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:30,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {10705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10705#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:30,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {10705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10706#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:30,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {10706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10706#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:30,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {10706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10707#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:30,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {10707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10707#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:30,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {10707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10708#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:30,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {10708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10708#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:30,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {10708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10709#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:30,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {10709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10709#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:30,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {10709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10710#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:30,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {10710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10710#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:30,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {10710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:30,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {10711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10711#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:30,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {10711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10712#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:30,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {10712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10712#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:30,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {10712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10713#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:30,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {10713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10713#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:30,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {10713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10714#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:30,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {10714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10714#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:30,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {10714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10715#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:30,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {10715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10715#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {10715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10716#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {10716#(<= main_~i~0 22)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {10690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10690#false} is VALID [2022-04-28 02:55:30,039 INFO L272 TraceCheckUtils]: 52: Hoare triple {10690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10690#false} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-28 02:55:30,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-28 02:55:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:30,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:30,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-28 02:55:30,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-28 02:55:30,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-28 02:55:30,788 INFO L272 TraceCheckUtils]: 52: Hoare triple {10690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {10690#false} is VALID [2022-04-28 02:55:30,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {10690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10690#false} is VALID [2022-04-28 02:55:30,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {10902#(< main_~i~0 2048)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-28 02:55:30,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {10906#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10902#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:30,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {10906#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10906#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:30,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {10913#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10906#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:30,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {10913#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10913#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:30,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {10920#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10913#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:30,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {10920#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10920#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:30,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {10927#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10920#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:30,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {10927#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10927#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:30,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {10934#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10927#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:30,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {10934#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10934#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:30,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {10941#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10934#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:30,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {10941#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10941#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:30,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {10948#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10941#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:30,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {10948#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10948#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:30,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {10955#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10948#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:30,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {10955#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10955#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:30,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {10962#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10955#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:30,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {10962#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10962#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:30,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {10969#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10962#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:30,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {10969#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10969#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:30,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {10976#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10969#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:30,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {10976#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10976#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:30,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {10983#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10976#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:30,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {10983#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10983#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:30,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {10990#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10983#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:30,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {10990#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10990#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:30,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {10997#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10990#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:30,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {10997#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10997#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:30,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {11004#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10997#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:30,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {11004#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11004#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:30,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {11011#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11004#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:30,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {11011#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11011#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:30,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {11018#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11011#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:30,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {11018#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11018#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:30,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {11025#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11018#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:30,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {11025#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11025#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:30,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {11032#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11025#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:30,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {11032#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11032#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:30,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {11039#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11032#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:30,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {11039#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11039#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:30,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {11046#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11039#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:30,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {11046#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11046#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:30,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {11053#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11046#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:30,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {11053#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11053#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:30,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {10689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11053#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:30,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-28 02:55:30,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-28 02:55:30,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-28 02:55:30,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {10689#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(12, 2); {10689#true} is VALID [2022-04-28 02:55:30,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {10689#true} call ULTIMATE.init(); {10689#true} is VALID [2022-04-28 02:55:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:30,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562275067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:30,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:30,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 02:55:30,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1182574165] [2022-04-28 02:55:30,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1182574165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:30,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:30,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 02:55:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085070169] [2022-04-28 02:55:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 02:55:30,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:30,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:30,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 02:55:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 02:55:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 02:55:30,840 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:31,357 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:55:31,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 02:55:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 02:55:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 02:55:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 02:55:31,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-28 02:55:31,410 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 02:55:31,411 INFO L225 Difference]: With dead ends: 66 [2022-04-28 02:55:31,411 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 02:55:31,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 02:55:31,413 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:31,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 24 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 02:55:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 02:55:31,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:31,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,516 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,516 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:31,516 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:55:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 02:55:31,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:31,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:31,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 02:55:31,517 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 02:55:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:31,517 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 02:55:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 02:55:31,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:31,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:31,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:31,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 02:55:31,518 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-28 02:55:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:31,519 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 02:55:31,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:31,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 02:55:31,588 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 02:55:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 02:55:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 02:55:31,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:31,588 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:31,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:31,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:31,805 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash 342314568, now seen corresponding path program 45 times [2022-04-28 02:55:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:31,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050912764] [2022-04-28 02:55:31,807 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:31,807 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:31,807 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 342314568, now seen corresponding path program 46 times [2022-04-28 02:55:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:31,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751977525] [2022-04-28 02:55:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:32,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {11522#(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(12, 2); {11493#true} is VALID [2022-04-28 02:55:32,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {11493#true} call ULTIMATE.init(); {11522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:32,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {11522#(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(12, 2); {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-28 02:55:32,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {11493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11498#(= main_~i~0 0)} is VALID [2022-04-28 02:55:32,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {11498#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11498#(= main_~i~0 0)} is VALID [2022-04-28 02:55:32,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {11498#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11499#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:32,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {11499#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11499#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:32,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {11499#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11500#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:32,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {11500#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11500#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:32,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {11500#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11501#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:32,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {11501#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11501#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:32,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {11501#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11502#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:32,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {11502#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11502#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:32,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {11502#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11503#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:32,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {11503#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11503#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:32,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {11503#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11504#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:32,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {11504#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11504#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:32,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {11504#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11505#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:32,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {11505#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11505#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:32,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {11505#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11506#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:32,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {11506#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11506#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:32,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {11506#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11507#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:32,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {11507#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11507#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:32,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {11507#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11508#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:32,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {11508#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11508#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:32,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {11508#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11509#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:32,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {11509#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11509#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:32,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {11509#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11510#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:32,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {11510#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11510#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:32,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {11510#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11511#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:32,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {11511#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11511#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:32,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {11511#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11512#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:32,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {11512#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11512#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:32,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {11512#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11513#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:32,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {11513#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11513#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:32,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {11513#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11514#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:32,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {11514#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11514#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:32,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {11514#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11515#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:32,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {11515#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11515#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:32,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {11515#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11516#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:32,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {11516#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11516#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:32,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {11516#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11517#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:32,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11517#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:32,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11518#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:32,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {11518#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11518#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:32,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {11518#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11519#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:32,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {11519#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11519#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:32,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {11519#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11520#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:32,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {11520#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11520#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:32,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {11520#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11521#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:32,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {11521#(<= main_~i~0 23)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-28 02:55:32,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {11494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11494#false} is VALID [2022-04-28 02:55:32,094 INFO L272 TraceCheckUtils]: 54: Hoare triple {11494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {11494#false} is VALID [2022-04-28 02:55:32,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-28 02:55:32,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-28 02:55:32,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-28 02:55:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751977525] [2022-04-28 02:55:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751977525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790270957] [2022-04-28 02:55:32,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:32,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:32,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:32,096 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:32,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 02:55:32,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:32,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:32,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:55:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:32,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:32,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {11493#true} call ULTIMATE.init(); {11493#true} is VALID [2022-04-28 02:55:32,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {11493#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(12, 2); {11493#true} is VALID [2022-04-28 02:55:32,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-28 02:55:32,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-28 02:55:32,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-28 02:55:32,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {11493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11541#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:32,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {11541#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11541#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:32,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {11541#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11499#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:32,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {11499#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11499#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:32,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {11499#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11500#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:32,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {11500#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11500#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:32,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {11500#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11501#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:32,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {11501#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11501#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:32,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {11501#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11502#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:32,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {11502#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11502#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:32,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {11502#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11503#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:32,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {11503#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11503#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:32,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {11503#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11504#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:32,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {11504#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11504#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:32,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {11504#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11505#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:32,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {11505#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11505#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:32,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {11505#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11506#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:32,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {11506#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11506#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:32,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {11506#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11507#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:32,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {11507#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11507#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:32,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {11507#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11508#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:32,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {11508#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11508#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:32,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {11508#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11509#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:32,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {11509#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11509#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:32,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {11509#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11510#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:32,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {11510#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11510#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:32,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {11510#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11511#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:32,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {11511#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11511#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:32,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {11511#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11512#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:32,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {11512#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11512#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:32,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {11512#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11513#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:32,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {11513#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11513#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:32,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {11513#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11514#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:32,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {11514#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11514#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:32,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {11514#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11515#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:32,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {11515#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11515#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:32,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {11515#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11516#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:32,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {11516#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11516#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:32,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {11516#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11517#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:32,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11517#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:32,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11518#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:32,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {11518#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11518#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:32,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {11518#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11519#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:32,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {11519#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11519#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:32,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {11519#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11520#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:32,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {11520#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11520#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:32,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {11520#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11521#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:32,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {11521#(<= main_~i~0 23)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {11494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L272 TraceCheckUtils]: 54: Hoare triple {11494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-28 02:55:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:32,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:33,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L272 TraceCheckUtils]: 54: Hoare triple {11494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {11494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {11713#(< main_~i~0 2048)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-28 02:55:33,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {11717#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11713#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:33,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {11717#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11717#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:33,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {11724#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11717#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:33,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {11724#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11724#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:33,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {11731#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11724#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:33,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {11731#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11731#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:33,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {11738#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11731#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:33,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {11738#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11738#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:33,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {11745#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11738#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:33,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {11745#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11745#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:33,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {11752#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11745#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:33,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {11752#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11752#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:33,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {11759#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11752#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:33,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {11759#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11759#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:33,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {11766#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11759#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:33,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {11766#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11766#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:33,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {11773#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11766#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:33,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {11773#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11773#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:33,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {11780#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11773#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:33,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {11780#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11780#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:33,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {11787#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11780#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:33,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {11787#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11787#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:33,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {11794#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11787#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:33,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {11794#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11794#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:33,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {11801#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11794#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:33,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {11801#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11801#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:33,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {11808#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11801#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:33,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {11808#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11808#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:33,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {11815#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11808#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:33,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {11815#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11815#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:33,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {11822#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11815#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:33,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {11822#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11822#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:33,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {11829#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11822#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:33,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {11829#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11829#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:33,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {11836#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11829#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:33,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {11836#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11836#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:33,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {11843#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11836#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:33,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {11843#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11843#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:33,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {11850#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11843#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:33,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {11850#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11850#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:33,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {11857#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11850#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:33,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {11857#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11857#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:33,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {11864#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11857#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:33,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {11864#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11864#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:33,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {11871#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11864#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:33,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {11871#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11871#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:33,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {11493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11871#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:33,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-28 02:55:33,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-28 02:55:33,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-28 02:55:33,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {11493#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(12, 2); {11493#true} is VALID [2022-04-28 02:55:33,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {11493#true} call ULTIMATE.init(); {11493#true} is VALID [2022-04-28 02:55:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790270957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:33,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:33,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 02:55:33,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:33,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050912764] [2022-04-28 02:55:33,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050912764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:33,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:33,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 02:55:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308827696] [2022-04-28 02:55:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 02:55:33,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:33,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:33,353 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 02:55:33,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 02:55:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 02:55:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:55:33,354 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:33,896 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:55:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 02:55:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 02:55:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 02:55:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 02:55:33,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-28 02:55:33,957 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 02:55:33,958 INFO L225 Difference]: With dead ends: 68 [2022-04-28 02:55:33,958 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 02:55:33,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:55:33,960 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:33,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 39 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 02:55:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-28 02:55:34,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:34,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:34,071 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:34,071 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:34,072 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:55:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 02:55:34,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:34,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:34,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 02:55:34,072 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 02:55:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:34,073 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 02:55:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 02:55:34,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:34,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:34,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:34,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 02:55:34,074 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-28 02:55:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:34,074 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 02:55:34,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:34,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 02:55:34,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 02:55:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 02:55:34,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:34,132 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:34,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:34,333 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1672697962, now seen corresponding path program 47 times [2022-04-28 02:55:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:34,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414202511] [2022-04-28 02:55:34,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:34,336 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:34,336 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1672697962, now seen corresponding path program 48 times [2022-04-28 02:55:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:34,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750106573] [2022-04-28 02:55:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:34,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:34,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {12355#(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(12, 2); {12325#true} is VALID [2022-04-28 02:55:34,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-28 02:55:34,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-28 02:55:34,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {12325#true} call ULTIMATE.init(); {12355#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:34,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {12355#(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(12, 2); {12325#true} is VALID [2022-04-28 02:55:34,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-28 02:55:34,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-28 02:55:34,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-28 02:55:34,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {12325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12330#(= main_~i~0 0)} is VALID [2022-04-28 02:55:34,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {12330#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12330#(= main_~i~0 0)} is VALID [2022-04-28 02:55:34,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {12330#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12331#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:34,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {12331#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:34,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {12331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12332#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:34,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {12332#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:34,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {12332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12333#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:34,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {12333#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:34,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {12333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12334#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:34,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {12334#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:34,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {12334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12335#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:34,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {12335#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:34,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {12335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12336#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:34,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {12336#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12336#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:34,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {12336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12337#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:34,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {12337#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12337#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:34,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {12337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12338#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:34,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {12338#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12338#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:34,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {12338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12339#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:34,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {12339#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12339#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:34,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {12339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12340#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:34,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {12340#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12340#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:34,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {12340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12341#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:34,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {12341#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12341#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:34,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {12341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12342#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:34,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {12342#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12342#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:34,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {12342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12343#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:34,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {12343#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12343#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:34,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {12343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12344#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:34,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {12344#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12344#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:34,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {12344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12345#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:34,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {12345#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12345#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:34,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {12345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12346#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:34,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {12346#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12346#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:34,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {12346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12347#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:34,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {12347#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12347#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:34,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {12347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12348#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:34,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {12348#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12348#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:34,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {12348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12349#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:34,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {12349#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12349#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:34,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {12349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12350#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:34,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {12350#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12350#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:34,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {12350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12351#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:34,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {12351#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12351#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:34,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {12351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12352#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:34,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {12352#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12352#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:34,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {12352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12353#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:34,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {12353#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12353#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:34,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {12353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12354#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:34,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#(<= main_~i~0 24)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {12326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L272 TraceCheckUtils]: 56: Hoare triple {12326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-28 02:55:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750106573] [2022-04-28 02:55:34,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750106573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359649517] [2022-04-28 02:55:34,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:34,655 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:34,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 02:55:35,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 02:55:35,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:35,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 02:55:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:35,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:35,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {12325#true} call ULTIMATE.init(); {12325#true} is VALID [2022-04-28 02:55:35,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {12325#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(12, 2); {12325#true} is VALID [2022-04-28 02:55:35,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-28 02:55:35,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-28 02:55:35,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-28 02:55:35,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {12325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12374#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:35,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {12374#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12374#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:35,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {12374#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12331#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:35,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {12331#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:35,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {12331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12332#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:35,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {12332#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:35,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {12332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12333#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:35,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {12333#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:35,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {12333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12334#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:35,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {12334#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:35,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {12334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12335#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:35,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {12335#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:35,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {12335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12336#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:35,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {12336#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12336#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:35,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {12336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12337#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:35,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {12337#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12337#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:35,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {12337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12338#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:35,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {12338#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12338#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:35,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {12338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12339#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:35,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {12339#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12339#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:35,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {12339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12340#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:35,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {12340#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12340#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:35,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {12340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12341#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:35,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {12341#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12341#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:35,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {12341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12342#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:35,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {12342#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12342#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:35,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {12342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12343#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:35,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {12343#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12343#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:35,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {12343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12344#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:35,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {12344#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12344#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:35,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {12344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12345#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:35,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {12345#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12345#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:35,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {12345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12346#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:35,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {12346#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12346#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:35,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {12346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12347#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:35,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {12347#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12347#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:35,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {12347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12348#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:35,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {12348#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12348#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:35,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {12348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12349#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:35,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {12349#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12349#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:35,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {12349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12350#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:35,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {12350#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12350#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:35,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {12350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12351#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:35,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {12351#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12351#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:35,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {12351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12352#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:35,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {12352#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12352#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:35,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {12352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12353#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:35,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {12353#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12353#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:35,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {12353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12354#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:35,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#(<= main_~i~0 24)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {12326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L272 TraceCheckUtils]: 56: Hoare triple {12326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-28 02:55:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:35,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:36,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-28 02:55:36,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-28 02:55:36,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-28 02:55:36,772 INFO L272 TraceCheckUtils]: 56: Hoare triple {12326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {12326#false} is VALID [2022-04-28 02:55:36,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {12326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12326#false} is VALID [2022-04-28 02:55:36,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {12552#(< main_~i~0 2048)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-28 02:55:36,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {12556#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12552#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:36,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {12556#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12556#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:36,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {12563#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12556#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:36,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {12563#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12563#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:36,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {12570#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12563#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:36,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {12570#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12570#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:36,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {12577#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12570#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:36,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {12577#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12577#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:36,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {12584#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12577#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:36,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {12584#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12584#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:36,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {12591#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12584#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:36,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {12591#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12591#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:36,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {12598#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12591#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:36,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {12598#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12598#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:36,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {12605#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12598#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:36,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {12605#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12605#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:36,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {12612#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12605#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:36,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {12612#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12612#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:36,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {12619#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12612#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:36,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {12619#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12619#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:36,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {12626#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12619#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:36,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {12626#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12626#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:36,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {12633#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12626#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:36,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {12633#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12633#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:36,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {12640#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12633#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:36,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {12640#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12640#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:36,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {12647#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12640#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:36,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {12647#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12647#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:36,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {12654#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12647#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:36,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {12654#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12654#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:36,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {12661#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12654#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:36,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {12661#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12661#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:36,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {12668#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12661#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:36,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {12668#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12668#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:36,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {12675#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12668#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:36,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {12675#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12675#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:36,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {12682#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12675#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:36,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {12682#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12682#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:36,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {12689#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12682#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:36,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {12689#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12689#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:36,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {12696#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12689#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:36,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {12696#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12696#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:36,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {12703#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12696#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:36,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {12703#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12703#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:36,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {12710#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12703#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:36,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {12710#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12710#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:36,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {12717#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12710#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:36,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {12717#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12717#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:36,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {12325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12717#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:36,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-28 02:55:36,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-28 02:55:36,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-28 02:55:36,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {12325#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(12, 2); {12325#true} is VALID [2022-04-28 02:55:36,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {12325#true} call ULTIMATE.init(); {12325#true} is VALID [2022-04-28 02:55:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359649517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:36,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 02:55:36,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:36,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414202511] [2022-04-28 02:55:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414202511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:36,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 02:55:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136027811] [2022-04-28 02:55:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 02:55:36,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:36,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:36,835 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 02:55:36,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 02:55:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:36,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 02:55:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:55:36,836 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:37,430 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:55:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:55:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 02:55:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 02:55:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 02:55:37,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-28 02:55:37,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:37,498 INFO L225 Difference]: With dead ends: 70 [2022-04-28 02:55:37,498 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 02:55:37,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 02:55:37,499 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:37,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 44 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 02:55:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 02:55:37,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:37,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,620 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,620 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:37,621 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:55:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 02:55:37,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:37,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:37,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 02:55:37,622 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 02:55:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:37,622 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 02:55:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 02:55:37,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:37,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:37,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:37,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 02:55:37,623 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-28 02:55:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:37,624 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 02:55:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:37,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 02:55:37,688 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 02:55:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 02:55:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 02:55:37,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:37,689 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:37,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:37,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 02:55:37,890 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 270885388, now seen corresponding path program 49 times [2022-04-28 02:55:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463392027] [2022-04-28 02:55:37,893 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:37,893 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:37,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash 270885388, now seen corresponding path program 50 times [2022-04-28 02:55:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:37,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679043434] [2022-04-28 02:55:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:38,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {13216#(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(12, 2); {13185#true} is VALID [2022-04-28 02:55:38,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {13185#true} call ULTIMATE.init(); {13216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:38,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {13216#(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(12, 2); {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-28 02:55:38,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {13185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13190#(= main_~i~0 0)} is VALID [2022-04-28 02:55:38,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {13190#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13190#(= main_~i~0 0)} is VALID [2022-04-28 02:55:38,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {13190#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13191#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:38,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {13191#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13191#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:38,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {13191#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13192#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:38,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {13192#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13192#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:38,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {13192#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13193#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:38,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {13193#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13193#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:38,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {13193#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13194#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:38,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {13194#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13194#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:38,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {13194#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13195#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:38,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {13195#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13195#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:38,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {13195#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13196#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:38,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {13196#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13196#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:38,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {13196#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13197#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:38,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {13197#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13197#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:38,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {13197#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13198#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:38,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {13198#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13198#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:38,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {13198#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13199#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:38,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {13199#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13199#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:38,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {13199#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13200#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:38,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {13200#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13200#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:38,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {13200#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13201#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:38,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {13201#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13201#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:38,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {13201#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13202#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:38,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {13202#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13202#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:38,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {13202#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13203#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:38,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {13203#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13203#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:38,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {13203#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13204#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:38,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {13204#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13204#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:38,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {13204#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13205#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:38,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {13205#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13205#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:38,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {13205#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13206#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:38,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {13206#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13206#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:38,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {13206#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13207#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:38,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {13207#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13207#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:38,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {13207#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13208#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:38,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {13208#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13208#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:38,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {13208#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13209#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:38,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {13209#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13209#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:38,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {13209#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13210#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:38,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {13210#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13210#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:38,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {13210#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13211#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:38,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {13211#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13211#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:38,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {13211#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13212#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:38,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {13212#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13212#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:38,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {13212#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13213#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:38,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {13213#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13213#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:38,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {13213#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13214#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:38,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {13214#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13214#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:38,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {13214#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13215#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:38,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {13215#(<= main_~i~0 25)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {13186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L272 TraceCheckUtils]: 58: Hoare triple {13186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-28 02:55:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:38,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679043434] [2022-04-28 02:55:38,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679043434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:38,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074651023] [2022-04-28 02:55:38,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:38,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:38,235 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:38,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 02:55:38,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:38,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:38,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 02:55:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:38,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:38,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {13185#true} call ULTIMATE.init(); {13185#true} is VALID [2022-04-28 02:55:38,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {13185#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(12, 2); {13185#true} is VALID [2022-04-28 02:55:38,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-28 02:55:38,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-28 02:55:38,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-28 02:55:38,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {13185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13235#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:38,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {13235#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:38,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {13235#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13191#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:38,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {13191#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13191#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:38,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {13191#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13192#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:38,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {13192#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13192#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:38,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {13192#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13193#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:38,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {13193#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13193#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:38,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {13193#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13194#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:38,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {13194#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13194#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:38,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {13194#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13195#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:38,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {13195#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13195#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:38,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {13195#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13196#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:38,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {13196#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13196#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:38,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {13196#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13197#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:38,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {13197#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13197#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:38,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {13197#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13198#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:38,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {13198#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13198#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:38,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {13198#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13199#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:38,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {13199#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13199#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:38,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {13199#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13200#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:38,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {13200#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13200#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:38,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {13200#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13201#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:38,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {13201#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13201#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:38,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {13201#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13202#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:38,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {13202#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13202#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:38,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {13202#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13203#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:38,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {13203#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13203#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:38,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {13203#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13204#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:38,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {13204#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13204#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:38,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {13204#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13205#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:38,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {13205#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13205#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:38,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {13205#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13206#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:38,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {13206#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13206#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:38,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {13206#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13207#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:38,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {13207#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13207#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:38,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {13207#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13208#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:38,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {13208#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13208#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:38,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {13208#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13209#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:38,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {13209#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13209#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:38,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {13209#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13210#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:38,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {13210#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13210#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:38,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {13210#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13211#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:38,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {13211#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13211#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:38,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {13211#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13212#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:38,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {13212#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13212#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:38,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {13212#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13213#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:38,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {13213#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13213#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:38,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {13213#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13214#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:38,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {13214#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13214#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:38,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {13214#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13215#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:38,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {13215#(<= main_~i~0 25)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {13186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L272 TraceCheckUtils]: 58: Hoare triple {13186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-28 02:55:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:38,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:39,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-28 02:55:39,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-28 02:55:39,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-28 02:55:39,622 INFO L272 TraceCheckUtils]: 58: Hoare triple {13186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {13186#false} is VALID [2022-04-28 02:55:39,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {13186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13186#false} is VALID [2022-04-28 02:55:39,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {13419#(< main_~i~0 2048)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-28 02:55:39,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {13423#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13419#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:39,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {13423#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13423#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:39,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {13430#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13423#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:39,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13430#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:39,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {13437#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13430#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:39,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {13437#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13437#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:39,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {13444#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13437#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:39,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {13444#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13444#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:39,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {13451#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13444#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:39,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {13451#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13451#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:39,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {13458#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13451#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:39,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {13458#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13458#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:39,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {13465#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13458#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:39,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {13465#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13465#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:39,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {13472#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13465#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:39,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {13472#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13472#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:39,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {13479#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13472#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:39,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {13479#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13479#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:39,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {13486#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13479#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:39,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {13486#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13486#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:39,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {13493#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13486#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:39,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {13493#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13493#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:39,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {13500#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13493#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:39,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {13500#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13500#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:39,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {13507#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13500#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:39,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {13507#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13507#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:39,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {13514#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13507#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:39,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {13514#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13514#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:39,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13514#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:39,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13521#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:39,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {13528#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13521#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:39,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {13528#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13528#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:39,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {13535#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13528#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:39,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {13535#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13535#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:39,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {13542#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13535#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:39,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {13542#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13542#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:39,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {13549#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13542#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:39,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {13549#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13549#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:39,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {13556#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13549#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:39,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {13556#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13556#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:39,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {13563#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13556#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:39,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {13563#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13563#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:39,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {13570#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13563#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:39,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {13570#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13570#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:39,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {13577#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13570#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:39,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {13577#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13577#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:39,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {13584#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13577#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:39,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {13584#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13584#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:39,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {13591#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13584#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:39,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {13591#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13591#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:39,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {13185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13591#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:39,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-28 02:55:39,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-28 02:55:39,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-28 02:55:39,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {13185#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(12, 2); {13185#true} is VALID [2022-04-28 02:55:39,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {13185#true} call ULTIMATE.init(); {13185#true} is VALID [2022-04-28 02:55:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:39,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074651023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:39,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:39,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 02:55:39,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:39,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463392027] [2022-04-28 02:55:39,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463392027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:39,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:39,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 02:55:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085347734] [2022-04-28 02:55:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 02:55:39,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:39,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:39,683 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 02:55:39,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 02:55:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 02:55:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 02:55:39,684 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:40,302 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:55:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 02:55:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 02:55:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 02:55:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 02:55:40,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 72 transitions. [2022-04-28 02:55:40,359 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 02:55:40,360 INFO L225 Difference]: With dead ends: 72 [2022-04-28 02:55:40,360 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 02:55:40,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:55:40,361 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:40,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 02:55:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-28 02:55:40,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:40,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,497 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,497 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:40,497 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:55:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 02:55:40,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:40,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:40,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 02:55:40,498 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 02:55:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:40,498 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 02:55:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 02:55:40,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:40,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:40,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:40,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 02:55:40,499 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-28 02:55:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:40,499 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 02:55:40,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:40,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 02:55:40,565 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 02:55:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 02:55:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 02:55:40,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:40,566 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:40,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 02:55:40,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 02:55:40,777 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1748732718, now seen corresponding path program 51 times [2022-04-28 02:55:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:40,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227263154] [2022-04-28 02:55:40,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:40,779 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:40,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1748732718, now seen corresponding path program 52 times [2022-04-28 02:55:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:40,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904742941] [2022-04-28 02:55:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:41,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {14105#(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(12, 2); {14073#true} is VALID [2022-04-28 02:55:41,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-28 02:55:41,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-28 02:55:41,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {14073#true} call ULTIMATE.init(); {14105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:41,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {14105#(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(12, 2); {14073#true} is VALID [2022-04-28 02:55:41,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-28 02:55:41,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-28 02:55:41,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-28 02:55:41,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {14073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14078#(= main_~i~0 0)} is VALID [2022-04-28 02:55:41,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {14078#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14078#(= main_~i~0 0)} is VALID [2022-04-28 02:55:41,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {14078#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14079#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:41,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {14079#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:41,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {14079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14080#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:41,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {14080#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:41,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {14080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14081#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:41,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {14081#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:41,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {14081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14082#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:41,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {14082#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:41,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {14082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14083#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:41,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {14083#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:41,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {14083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14084#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:41,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {14084#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14084#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:41,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {14084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14085#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:41,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {14085#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14085#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:41,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {14085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14086#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:41,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {14086#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14086#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:41,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {14086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14087#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:41,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {14087#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:41,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {14087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14088#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:41,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {14088#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:41,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {14088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14089#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:41,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {14089#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14089#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:41,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {14089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14090#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:41,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {14090#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14090#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:41,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {14090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14091#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:41,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {14091#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14091#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:41,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {14091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:41,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {14092#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14092#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:41,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {14092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:41,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {14093#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14093#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:41,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {14093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:41,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {14094#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14094#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:41,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {14094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:41,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {14095#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14095#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:41,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {14095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:41,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {14096#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14096#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:41,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {14096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:41,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {14097#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14097#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:41,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {14097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:41,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {14098#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14098#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:41,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {14098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:41,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {14099#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14099#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:41,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {14099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:41,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {14100#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14100#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:41,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {14100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:41,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {14101#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14101#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:41,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {14101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:41,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {14102#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14102#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:41,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {14102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {14103#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14103#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {14103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {14104#(<= main_~i~0 26)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {14074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14074#false} is VALID [2022-04-28 02:55:41,134 INFO L272 TraceCheckUtils]: 60: Hoare triple {14074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14074#false} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-28 02:55:41,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-28 02:55:41,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-28 02:55:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:41,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904742941] [2022-04-28 02:55:41,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904742941] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:41,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705579234] [2022-04-28 02:55:41,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:41,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:41,136 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:41,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 02:55:41,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:41,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:41,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 02:55:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:41,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:41,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {14073#true} call ULTIMATE.init(); {14073#true} is VALID [2022-04-28 02:55:41,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {14073#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(12, 2); {14073#true} is VALID [2022-04-28 02:55:41,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-28 02:55:41,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-28 02:55:41,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-28 02:55:41,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {14073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14124#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:41,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {14124#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14124#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:41,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {14124#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14079#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:41,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {14079#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:41,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {14079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14080#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:41,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {14080#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:41,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {14080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14081#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:41,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {14081#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:41,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {14081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14082#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:41,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {14082#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:41,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {14082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14083#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:41,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {14083#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:41,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {14083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14084#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:41,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {14084#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14084#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:41,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {14084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14085#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:41,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {14085#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14085#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:41,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {14085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14086#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:41,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {14086#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14086#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:41,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {14086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14087#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:41,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {14087#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14087#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:41,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {14087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14088#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:41,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {14088#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:41,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {14088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14089#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:41,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {14089#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14089#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:41,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {14089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14090#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:41,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {14090#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14090#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:41,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {14090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14091#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:41,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {14091#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14091#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:41,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {14091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:41,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {14092#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14092#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:41,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {14092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:41,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {14093#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14093#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:41,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {14093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:41,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {14094#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14094#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:41,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {14094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:41,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {14095#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14095#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:41,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {14095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:41,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {14096#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14096#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:41,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {14096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:41,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {14097#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14097#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:41,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {14097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:41,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {14098#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14098#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:41,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {14098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:41,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {14099#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14099#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:41,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {14099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:41,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {14100#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14100#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:41,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {14100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:41,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {14101#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14101#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:41,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {14101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:41,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {14102#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14102#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:41,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {14102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:41,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {14103#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14103#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {14103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {14104#(<= main_~i~0 26)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {14074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14074#false} is VALID [2022-04-28 02:55:41,648 INFO L272 TraceCheckUtils]: 60: Hoare triple {14074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14074#false} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-28 02:55:41,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-28 02:55:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:41,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:42,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-28 02:55:42,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-28 02:55:42,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-28 02:55:42,583 INFO L272 TraceCheckUtils]: 60: Hoare triple {14074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14074#false} is VALID [2022-04-28 02:55:42,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {14074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14074#false} is VALID [2022-04-28 02:55:42,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {14314#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-28 02:55:42,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {14318#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14314#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:42,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {14318#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14318#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:42,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {14325#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14318#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:42,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {14325#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14325#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:42,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {14332#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14325#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:42,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {14332#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14332#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:42,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {14339#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14332#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:42,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {14339#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14339#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:42,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {14346#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14339#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:42,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {14346#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14346#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:42,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {14353#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14346#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:42,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {14353#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14353#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:42,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {14360#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14353#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:42,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {14360#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14360#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:42,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {14367#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14360#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:42,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {14367#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14367#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:42,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {14374#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14367#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:42,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {14374#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14374#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:42,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {14381#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14374#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:42,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {14381#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14381#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:42,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {14388#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14381#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:42,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {14388#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14388#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:42,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {14395#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14388#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:42,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {14395#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14395#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:42,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {14402#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14395#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:42,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {14402#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14402#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:42,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {14409#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14402#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:42,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {14409#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14409#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:42,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {14416#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14409#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:42,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {14416#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14416#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:42,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {14423#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14416#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:42,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {14423#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14423#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:42,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {14430#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14423#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:42,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {14430#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14430#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:42,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {14437#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14430#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:42,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {14437#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14437#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:42,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {14444#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14437#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:42,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {14444#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14444#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:42,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {14451#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14444#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:42,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {14451#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14451#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:42,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {14458#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14451#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:42,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {14458#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14458#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:42,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {14465#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14458#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:42,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {14465#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14465#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:42,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {14472#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14465#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:42,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {14472#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14472#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:42,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {14479#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14472#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:42,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {14479#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14479#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:42,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {14486#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14479#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:42,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {14486#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14486#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:42,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {14493#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14486#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:42,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {14493#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14493#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:42,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {14073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14493#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:42,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-28 02:55:42,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-28 02:55:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-28 02:55:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {14073#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(12, 2); {14073#true} is VALID [2022-04-28 02:55:42,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {14073#true} call ULTIMATE.init(); {14073#true} is VALID [2022-04-28 02:55:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705579234] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:42,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 02:55:42,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227263154] [2022-04-28 02:55:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227263154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:42,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 02:55:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232232225] [2022-04-28 02:55:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:42,601 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 02:55:42,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:42,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:42,643 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 02:55:42,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 02:55:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 02:55:42,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:55:42,645 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:43,310 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:55:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 02:55:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 02:55:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-28 02:55:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-28 02:55:43,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 74 transitions. [2022-04-28 02:55:43,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:43,361 INFO L225 Difference]: With dead ends: 74 [2022-04-28 02:55:43,361 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 02:55:43,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 02:55:43,362 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:43,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 02:55:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-28 02:55:43,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:43,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,505 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,505 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:43,506 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:55:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 02:55:43,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:43,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:43,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:55:43,506 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 02:55:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:43,507 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 02:55:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 02:55:43,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:43,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:43,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:43,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 02:55:43,508 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-28 02:55:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:43,508 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 02:55:43,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:43,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 02:55:43,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 02:55:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 02:55:43,583 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:43,584 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:43,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 02:55:43,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 325841872, now seen corresponding path program 53 times [2022-04-28 02:55:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:43,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2064971221] [2022-04-28 02:55:43,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:43,793 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:43,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 325841872, now seen corresponding path program 54 times [2022-04-28 02:55:43,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:43,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531970256] [2022-04-28 02:55:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:44,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {15022#(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(12, 2); {14989#true} is VALID [2022-04-28 02:55:44,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-28 02:55:44,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-28 02:55:44,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {14989#true} call ULTIMATE.init(); {15022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:44,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {15022#(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(12, 2); {14989#true} is VALID [2022-04-28 02:55:44,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-28 02:55:44,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-28 02:55:44,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-28 02:55:44,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {14989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14994#(= main_~i~0 0)} is VALID [2022-04-28 02:55:44,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {14994#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14994#(= main_~i~0 0)} is VALID [2022-04-28 02:55:44,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {14994#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:44,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {14995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:44,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {14995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:44,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {14996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:44,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {14996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:44,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {14997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:44,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {14997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:44,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {14998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:44,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {14998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:44,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {14999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:44,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {14999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:44,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {15000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:44,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {15000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:44,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {15001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:44,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {15001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15002#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:44,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {15002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15002#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:44,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {15002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15003#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:44,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {15003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15003#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:44,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {15003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15004#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:44,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {15004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15004#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:44,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {15004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15005#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:44,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {15005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15005#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:44,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {15005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15006#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:44,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {15006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15006#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:44,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {15006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15007#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:44,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {15007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15007#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:44,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {15007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15008#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:44,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {15008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15008#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:44,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {15008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15009#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:44,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {15009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15009#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:44,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {15009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15010#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:44,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {15010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15010#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:44,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {15010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15011#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:44,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {15011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15011#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:44,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {15011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15012#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:44,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {15012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15012#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:44,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {15012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15013#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:44,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {15013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15013#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:44,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {15013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15014#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:44,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {15014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15014#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:44,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {15014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15015#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:44,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {15015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15015#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:44,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {15015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15016#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:44,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {15016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15016#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:44,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {15016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15017#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:44,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {15017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15017#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:44,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {15017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15018#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:44,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {15018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15018#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:44,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {15018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15019#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:44,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {15019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15019#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:44,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {15019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15020#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:44,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {15020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15020#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {15020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15021#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {15021#(<= main_~i~0 27)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {14990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14990#false} is VALID [2022-04-28 02:55:44,195 INFO L272 TraceCheckUtils]: 62: Hoare triple {14990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14990#false} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-28 02:55:44,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-28 02:55:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:44,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531970256] [2022-04-28 02:55:44,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531970256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:44,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824998959] [2022-04-28 02:55:44,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:44,198 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 02:55:46,413 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 02:55:46,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:46,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 02:55:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:46,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:46,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {14989#true} call ULTIMATE.init(); {14989#true} is VALID [2022-04-28 02:55:46,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {14989#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(12, 2); {14989#true} is VALID [2022-04-28 02:55:46,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-28 02:55:46,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-28 02:55:46,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-28 02:55:46,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {14989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15041#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:46,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {15041#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15041#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:46,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {15041#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:46,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {14995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14995#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:46,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {14995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:46,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {14996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14996#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:46,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {14996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:46,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {14997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14997#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:46,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {14997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:46,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {14998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14998#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:46,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {14998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:46,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {14999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14999#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:46,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {14999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:46,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {15000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15000#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:46,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {15000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:46,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {15001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15001#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:46,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {15001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15002#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:46,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {15002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15002#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:46,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {15002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15003#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:46,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {15003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15003#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:46,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {15003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15004#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:46,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {15004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15004#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:46,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {15004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15005#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:46,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {15005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15005#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:46,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {15005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15006#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:46,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {15006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15006#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:46,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {15006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15007#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:46,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {15007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15007#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:46,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {15007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15008#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:46,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {15008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15008#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:46,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {15008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15009#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:46,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {15009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15009#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:46,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {15009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15010#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:46,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {15010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15010#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:46,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {15010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15011#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:46,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {15011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15011#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:46,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {15011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15012#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:46,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {15012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15012#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:46,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {15012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15013#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:46,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {15013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15013#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:46,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {15013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15014#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:46,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {15014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15014#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:46,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {15014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15015#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:46,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {15015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15015#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:46,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {15015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15016#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:46,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {15016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15016#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:46,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {15016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15017#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:46,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {15017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15017#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:46,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {15017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15018#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:46,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {15018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15018#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:46,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {15018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15019#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:46,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {15019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15019#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:46,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {15019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15020#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:46,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {15020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15020#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:46,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {15020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15021#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:46,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {15021#(<= main_~i~0 27)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {14990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L272 TraceCheckUtils]: 62: Hoare triple {14990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-28 02:55:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:46,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:47,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-28 02:55:47,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-28 02:55:47,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-28 02:55:47,846 INFO L272 TraceCheckUtils]: 62: Hoare triple {14990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {14990#false} is VALID [2022-04-28 02:55:47,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {14990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14990#false} is VALID [2022-04-28 02:55:47,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {15237#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-28 02:55:47,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {15241#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15237#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:47,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {15241#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15241#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:47,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {15248#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15241#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:47,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {15248#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15248#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:47,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {15255#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15248#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:47,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {15255#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15255#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:47,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {15262#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15255#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:47,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {15262#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15262#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:47,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {15269#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15262#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:47,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {15269#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15269#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:47,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {15276#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15269#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:47,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {15276#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15276#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:47,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {15283#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15276#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:47,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {15283#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15283#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:47,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {15290#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15283#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:47,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {15290#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15290#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:47,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {15297#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15290#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:47,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {15297#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15297#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:47,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {15304#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15297#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:47,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {15304#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15304#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:47,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {15311#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15304#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:47,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {15311#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15311#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:47,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {15318#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15311#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:47,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {15318#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15318#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:47,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {15325#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15318#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:47,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {15325#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15325#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:47,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {15332#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15325#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:47,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {15332#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15332#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:47,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {15339#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15332#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:47,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {15339#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15339#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:47,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {15346#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15339#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:47,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {15346#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15346#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:47,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {15353#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15346#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:47,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {15353#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15353#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:47,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {15360#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15353#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:47,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {15360#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15360#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:47,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {15367#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15360#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:47,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {15367#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15367#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:47,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15367#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:47,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15374#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:47,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {15381#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15374#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:47,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {15381#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15381#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:47,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {15388#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15381#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:47,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {15388#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15388#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:47,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {15395#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15388#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:47,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {15395#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15395#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:47,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {15402#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:47,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {15402#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15402#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:47,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {15409#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:47,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {15409#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15409#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:47,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {15416#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15409#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:47,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {15416#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15416#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:47,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {15423#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15416#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:47,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {15423#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15423#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:47,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {14989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15423#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:47,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-28 02:55:47,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-28 02:55:47,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-28 02:55:47,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {14989#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(12, 2); {14989#true} is VALID [2022-04-28 02:55:47,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {14989#true} call ULTIMATE.init(); {14989#true} is VALID [2022-04-28 02:55:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:47,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824998959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:47,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 02:55:47,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2064971221] [2022-04-28 02:55:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2064971221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:47,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 02:55:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287025921] [2022-04-28 02:55:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 02:55:47,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:47,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:47,920 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 02:55:47,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 02:55:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 02:55:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 02:55:47,923 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:48,637 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:55:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 02:55:48,637 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 02:55:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-28 02:55:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-28 02:55:48,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2022-04-28 02:55:48,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:48,706 INFO L225 Difference]: With dead ends: 76 [2022-04-28 02:55:48,706 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 02:55:48,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:55:48,711 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:48,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 44 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 02:55:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 02:55:48,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:48,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,880 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,880 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:48,881 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:55:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 02:55:48,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:48,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:48,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 02:55:48,881 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 02:55:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:48,882 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 02:55:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 02:55:48,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:48,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:48,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:48,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 02:55:48,883 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-28 02:55:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:48,883 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 02:55:48,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:48,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 02:55:48,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 02:55:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 02:55:48,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:48,953 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:48,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:49,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 02:55:49,158 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1272661006, now seen corresponding path program 55 times [2022-04-28 02:55:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:49,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724429471] [2022-04-28 02:55:49,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:49,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:49,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1272661006, now seen corresponding path program 56 times [2022-04-28 02:55:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822455073] [2022-04-28 02:55:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:49,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {15967#(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(12, 2); {15933#true} is VALID [2022-04-28 02:55:49,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-28 02:55:49,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-28 02:55:49,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {15933#true} call ULTIMATE.init(); {15967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:49,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {15967#(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(12, 2); {15933#true} is VALID [2022-04-28 02:55:49,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-28 02:55:49,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-28 02:55:49,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-28 02:55:49,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {15933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15938#(= main_~i~0 0)} is VALID [2022-04-28 02:55:49,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {15938#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15938#(= main_~i~0 0)} is VALID [2022-04-28 02:55:49,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {15938#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15939#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {15939#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:49,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {15939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15940#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:49,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {15940#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:49,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15941#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:49,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {15941#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:49,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {15941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15942#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:49,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {15942#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:49,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {15942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15943#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:49,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {15943#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:49,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {15943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15944#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:49,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {15944#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:49,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {15944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15945#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:49,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {15945#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:49,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {15945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15946#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:49,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {15946#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:49,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {15946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15947#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:49,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {15947#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:49,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {15947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15948#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:49,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {15948#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:49,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {15948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15949#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:49,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:49,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15950#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:49,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:49,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15951#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:49,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {15951#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:49,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {15951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15952#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:49,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {15952#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:49,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {15952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15953#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:49,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {15953#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:49,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {15953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15954#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:49,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {15954#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:49,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {15954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15955#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:49,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {15955#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:49,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {15955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15956#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:49,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {15956#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:49,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {15956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15957#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:49,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {15957#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:49,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {15957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15958#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:49,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {15958#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:49,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {15958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15959#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:49,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {15959#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:49,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {15959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15960#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:49,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {15960#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:49,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {15960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15961#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:49,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {15961#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:49,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {15961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15962#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:49,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {15962#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:49,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {15962#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15963#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:49,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {15963#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:49,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {15963#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15964#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:49,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {15964#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15964#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:49,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {15964#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15965#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:49,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {15965#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15965#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:49,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {15965#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:49,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {15966#(<= main_~i~0 28)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {15934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L272 TraceCheckUtils]: 64: Hoare triple {15934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-28 02:55:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822455073] [2022-04-28 02:55:49,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822455073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:49,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340235255] [2022-04-28 02:55:49,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:55:49,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:49,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:49,559 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:49,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 02:55:49,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:55:49,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:49,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 02:55:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:49,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:50,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {15933#true} call ULTIMATE.init(); {15933#true} is VALID [2022-04-28 02:55:50,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {15933#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(12, 2); {15933#true} is VALID [2022-04-28 02:55:50,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-28 02:55:50,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-28 02:55:50,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-28 02:55:50,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {15933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15986#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:50,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {15986#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15986#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:50,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {15986#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15939#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:50,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {15939#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:50,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {15939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15940#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:50,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {15940#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:50,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15941#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:50,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {15941#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:50,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {15941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15942#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:50,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {15942#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:50,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {15942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15943#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:50,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {15943#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:50,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {15943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15944#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:50,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {15944#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:50,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {15944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15945#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:50,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {15945#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:50,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {15945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15946#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:50,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {15946#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:50,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {15946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15947#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:50,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {15947#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:50,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {15947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15948#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:50,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {15948#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:50,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {15948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15949#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:50,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:50,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15950#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:50,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:50,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15951#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:50,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {15951#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:50,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {15951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15952#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:50,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {15952#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:50,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {15952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15953#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:50,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {15953#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:50,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {15953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15954#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:50,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {15954#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:50,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {15954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15955#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:50,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {15955#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:50,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {15955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15956#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:50,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {15956#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:50,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {15956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15957#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:50,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {15957#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:50,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {15957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15958#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:50,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {15958#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:50,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {15958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15959#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:50,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {15959#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:50,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {15959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15960#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:50,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {15960#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:50,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {15960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15961#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:50,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {15961#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:50,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {15961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15962#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:50,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {15962#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:50,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {15962#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15963#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:50,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {15963#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:50,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {15963#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15964#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:50,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {15964#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15964#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:50,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {15964#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15965#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:50,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {15965#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15965#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:50,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {15965#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15966#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:50,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {15966#(<= main_~i~0 28)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {15934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L272 TraceCheckUtils]: 64: Hoare triple {15934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-28 02:55:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:50,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:51,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-28 02:55:51,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-28 02:55:51,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-28 02:55:51,180 INFO L272 TraceCheckUtils]: 64: Hoare triple {15934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {15934#false} is VALID [2022-04-28 02:55:51,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {15934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15934#false} is VALID [2022-04-28 02:55:51,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {16188#(< main_~i~0 2048)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-28 02:55:51,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {16192#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16188#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:51,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16192#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:51,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {16199#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16192#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:51,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {16199#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16199#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:51,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {16206#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16199#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:51,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {16206#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16206#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:51,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {16213#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16206#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:51,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {16213#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16213#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:51,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {16220#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16213#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:51,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {16220#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16220#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:51,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {16227#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16220#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:51,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {16227#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16227#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:51,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {16234#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:51,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {16234#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16234#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:51,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {16241#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16234#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:51,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {16241#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16241#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:51,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {16248#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16241#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:51,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {16248#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16248#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:51,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {16255#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16248#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:51,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {16255#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16255#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:51,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {16262#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16255#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:51,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {16262#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16262#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:51,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {16269#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16262#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:51,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {16269#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16269#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:51,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {16276#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16269#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:51,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {16276#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16276#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:51,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {16283#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16276#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:51,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {16283#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16283#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:51,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {16290#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16283#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:51,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {16290#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16290#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:51,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {16297#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16290#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:51,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {16297#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16297#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:51,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {16304#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16297#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:51,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {16304#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16304#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:51,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {16311#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16304#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:51,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {16311#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16311#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:51,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {16318#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16311#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:51,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {16318#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16318#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:51,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {16325#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16318#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:51,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {16325#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16325#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:51,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {16332#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16325#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:51,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {16332#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16332#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:51,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {16339#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16332#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:51,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {16339#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16339#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:51,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {16346#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16339#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:51,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {16346#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16346#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:51,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {16353#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16346#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:51,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {16353#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16353#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:51,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {16360#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16353#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:51,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {16360#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16360#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:51,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {16367#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16360#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:51,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {16367#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16367#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:51,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {16374#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16367#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:51,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {16374#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16374#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:51,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {16381#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16374#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:51,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {16381#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16381#(< main_~i~0 2020)} is VALID [2022-04-28 02:55:51,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {15933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16381#(< main_~i~0 2020)} is VALID [2022-04-28 02:55:51,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-28 02:55:51,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-28 02:55:51,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-28 02:55:51,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {15933#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(12, 2); {15933#true} is VALID [2022-04-28 02:55:51,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {15933#true} call ULTIMATE.init(); {15933#true} is VALID [2022-04-28 02:55:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:51,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340235255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:51,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:51,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 02:55:51,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:51,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724429471] [2022-04-28 02:55:51,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724429471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:51,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:51,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 02:55:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925780309] [2022-04-28 02:55:51,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:51,199 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 02:55:51,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:51,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:51,247 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 02:55:51,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 02:55:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:51,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 02:55:51,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 02:55:51,249 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:51,973 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:55:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 02:55:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 02:55:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-28 02:55:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-28 02:55:51,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 78 transitions. [2022-04-28 02:55:52,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:52,030 INFO L225 Difference]: With dead ends: 78 [2022-04-28 02:55:52,030 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 02:55:52,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 02:55:52,031 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:52,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 34 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 02:55:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-28 02:55:52,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:52,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:52,205 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:52,206 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:52,206 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:55:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 02:55:52,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:52,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:52,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:55:52,207 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:55:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:52,207 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 02:55:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 02:55:52,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:52,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:52,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:52,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 02:55:52,208 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-28 02:55:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:52,209 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 02:55:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 31 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:52,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 02:55:52,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 02:55:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 02:55:52,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:52,286 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:52,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 02:55:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:52,499 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash 164365204, now seen corresponding path program 57 times [2022-04-28 02:55:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:52,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601442688] [2022-04-28 02:55:52,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:52,503 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:52,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 164365204, now seen corresponding path program 58 times [2022-04-28 02:55:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314157710] [2022-04-28 02:55:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:52,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {16940#(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(12, 2); {16905#true} is VALID [2022-04-28 02:55:52,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-28 02:55:52,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-28 02:55:52,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {16905#true} call ULTIMATE.init(); {16940#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:52,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {16940#(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(12, 2); {16905#true} is VALID [2022-04-28 02:55:52,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-28 02:55:52,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-28 02:55:52,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-28 02:55:52,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {16905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16910#(= main_~i~0 0)} is VALID [2022-04-28 02:55:52,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {16910#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16910#(= main_~i~0 0)} is VALID [2022-04-28 02:55:52,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {16910#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:52,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {16911#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:52,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {16911#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:52,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:52,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:52,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {16913#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:52,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {16913#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:52,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:52,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {16914#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:52,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {16915#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:52,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {16915#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:52,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {16916#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:52,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {16916#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:52,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:52,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:52,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {16918#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:52,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {16918#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:52,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {16919#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:52,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {16919#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:52,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {16920#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:52,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {16920#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:52,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {16921#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:52,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {16921#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:52,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {16922#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:52,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {16922#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:52,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {16923#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:52,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {16923#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:52,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {16924#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:52,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {16924#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:52,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {16925#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:52,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {16925#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:52,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:52,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:52,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {16927#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:52,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {16927#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:52,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {16928#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:52,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {16928#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:52,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {16929#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:52,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {16929#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:52,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {16930#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:52,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {16930#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:52,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {16931#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:52,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {16931#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:52,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {16932#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:52,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {16932#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:52,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {16933#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:52,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {16933#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:52,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {16934#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:52,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {16934#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:52,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {16935#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:52,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {16935#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:52,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {16936#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:52,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {16936#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:52,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {16937#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:52,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {16937#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:52,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {16938#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:52,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {16938#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:52,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {16939#(<= main_~i~0 29)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {16906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L272 TraceCheckUtils]: 66: Hoare triple {16906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-28 02:55:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314157710] [2022-04-28 02:55:52,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314157710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502347457] [2022-04-28 02:55:52,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:55:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:52,901 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:52,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 02:55:53,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:55:53,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:53,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 02:55:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:53,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:53,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {16905#true} call ULTIMATE.init(); {16905#true} is VALID [2022-04-28 02:55:53,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {16905#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(12, 2); {16905#true} is VALID [2022-04-28 02:55:53,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-28 02:55:53,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-28 02:55:53,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-28 02:55:53,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {16905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16959#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:53,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {16959#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16959#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:53,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {16959#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:53,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {16911#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:53,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {16911#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:53,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:53,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:53,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {16913#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:53,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {16913#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:53,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:53,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {16914#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:53,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {16915#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:53,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {16915#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:53,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {16916#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:53,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {16916#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:53,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:53,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:53,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {16918#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:53,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {16918#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:53,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {16919#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:53,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {16919#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:53,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {16920#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:53,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {16920#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:53,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {16921#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:53,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {16921#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:53,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {16922#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:53,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {16922#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:53,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {16923#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:53,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {16923#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:53,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {16924#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:53,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {16924#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:53,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {16925#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:53,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {16925#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:53,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:53,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:53,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {16927#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:53,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {16927#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:53,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {16928#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:53,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {16928#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:53,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {16929#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:53,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {16929#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:53,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {16930#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:53,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {16930#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:53,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {16931#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:53,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {16931#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:53,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {16932#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:53,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {16932#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:53,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {16933#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:53,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {16933#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:53,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {16934#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:53,468 INFO L290 TraceCheckUtils]: 55: Hoare triple {16934#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:53,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {16935#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:53,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {16935#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:53,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {16936#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:53,469 INFO L290 TraceCheckUtils]: 59: Hoare triple {16936#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:53,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {16937#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:53,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {16937#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:53,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {16938#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 63: Hoare triple {16938#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {16939#(<= main_~i~0 29)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {16906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16906#false} is VALID [2022-04-28 02:55:53,470 INFO L272 TraceCheckUtils]: 66: Hoare triple {16906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {16906#false} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-28 02:55:53,470 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-28 02:55:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:53,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:55:54,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-28 02:55:54,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-28 02:55:54,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-28 02:55:54,576 INFO L272 TraceCheckUtils]: 66: Hoare triple {16906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {16906#false} is VALID [2022-04-28 02:55:54,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {16906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16906#false} is VALID [2022-04-28 02:55:54,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {17167#(< main_~i~0 2048)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-28 02:55:54,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {17171#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17167#(< main_~i~0 2048)} is VALID [2022-04-28 02:55:54,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {17171#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17171#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:54,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {17178#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17171#(< main_~i~0 2047)} is VALID [2022-04-28 02:55:54,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {17178#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17178#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:54,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {17185#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17178#(< main_~i~0 2046)} is VALID [2022-04-28 02:55:54,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {17185#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17185#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:54,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {17192#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17185#(< main_~i~0 2045)} is VALID [2022-04-28 02:55:54,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {17192#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17192#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:54,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {17199#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17192#(< main_~i~0 2044)} is VALID [2022-04-28 02:55:54,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {17199#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17199#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:54,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {17206#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17199#(< main_~i~0 2043)} is VALID [2022-04-28 02:55:54,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {17206#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17206#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:54,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {17213#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17206#(< main_~i~0 2042)} is VALID [2022-04-28 02:55:54,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {17213#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17213#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:54,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {17220#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17213#(< main_~i~0 2041)} is VALID [2022-04-28 02:55:54,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {17220#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17220#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:54,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {17227#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17220#(< main_~i~0 2040)} is VALID [2022-04-28 02:55:54,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {17227#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17227#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:54,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {17234#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17227#(< main_~i~0 2039)} is VALID [2022-04-28 02:55:54,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {17234#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17234#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:54,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {17241#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17234#(< main_~i~0 2038)} is VALID [2022-04-28 02:55:54,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {17241#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17241#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:54,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {17248#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17241#(< main_~i~0 2037)} is VALID [2022-04-28 02:55:54,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {17248#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17248#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:54,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {17255#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17248#(< main_~i~0 2036)} is VALID [2022-04-28 02:55:54,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {17255#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17255#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:54,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {17262#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17255#(< main_~i~0 2035)} is VALID [2022-04-28 02:55:54,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {17262#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17262#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:54,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {17269#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17262#(< main_~i~0 2034)} is VALID [2022-04-28 02:55:54,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {17269#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17269#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:54,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {17276#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17269#(< main_~i~0 2033)} is VALID [2022-04-28 02:55:54,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {17276#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17276#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:54,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {17283#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17276#(< main_~i~0 2032)} is VALID [2022-04-28 02:55:54,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {17283#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17283#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:54,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {17290#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17283#(< main_~i~0 2031)} is VALID [2022-04-28 02:55:54,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {17290#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17290#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:54,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {17297#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17290#(< main_~i~0 2030)} is VALID [2022-04-28 02:55:54,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {17297#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17297#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:54,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {17304#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17297#(< main_~i~0 2029)} is VALID [2022-04-28 02:55:54,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {17304#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17304#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:54,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {17311#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17304#(< main_~i~0 2028)} is VALID [2022-04-28 02:55:54,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {17311#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17311#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:54,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {17318#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17311#(< main_~i~0 2027)} is VALID [2022-04-28 02:55:54,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {17318#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17318#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:54,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {17325#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17318#(< main_~i~0 2026)} is VALID [2022-04-28 02:55:54,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {17325#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17325#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:54,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {17332#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17325#(< main_~i~0 2025)} is VALID [2022-04-28 02:55:54,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {17332#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17332#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:54,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {17339#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17332#(< main_~i~0 2024)} is VALID [2022-04-28 02:55:54,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {17339#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17339#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:54,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {17346#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17339#(< main_~i~0 2023)} is VALID [2022-04-28 02:55:54,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {17346#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17346#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:54,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {17353#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17346#(< main_~i~0 2022)} is VALID [2022-04-28 02:55:54,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {17353#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17353#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:54,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {17360#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17353#(< main_~i~0 2021)} is VALID [2022-04-28 02:55:54,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {17360#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17360#(< main_~i~0 2020)} is VALID [2022-04-28 02:55:54,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {17367#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17360#(< main_~i~0 2020)} is VALID [2022-04-28 02:55:54,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {17367#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17367#(< main_~i~0 2019)} is VALID [2022-04-28 02:55:54,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {16905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17367#(< main_~i~0 2019)} is VALID [2022-04-28 02:55:54,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-28 02:55:54,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-28 02:55:54,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-28 02:55:54,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {16905#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(12, 2); {16905#true} is VALID [2022-04-28 02:55:54,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {16905#true} call ULTIMATE.init(); {16905#true} is VALID [2022-04-28 02:55:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:54,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502347457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:55:54,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:55:54,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 02:55:54,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:55:54,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601442688] [2022-04-28 02:55:54,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601442688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:55:54,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:55:54,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 02:55:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189018269] [2022-04-28 02:55:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:55:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 02:55:54,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:55:54,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:54,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:54,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 02:55:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 02:55:54,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:55:54,640 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:55,418 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:55:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 02:55:55,418 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 02:55:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:55:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 02:55:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-28 02:55:55,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-28 02:55:55,477 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 02:55:55,477 INFO L225 Difference]: With dead ends: 80 [2022-04-28 02:55:55,478 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 02:55:55,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 02:55:55,479 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:55:55,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 24 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:55:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 02:55:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-28 02:55:55,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:55:55,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,657 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,657 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:55,658 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:55:55,658 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 02:55:55,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:55,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:55,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 02:55:55,658 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 02:55:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:55:55,659 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 02:55:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 02:55:55,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:55:55,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:55:55,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:55:55,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:55:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-28 02:55:55,660 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-28 02:55:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:55:55,660 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-28 02:55:55,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:55:55,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-28 02:55:55,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:55:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 02:55:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 02:55:55,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:55:55,736 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:55:55,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 02:55:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:55,937 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:55:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:55:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1832916298, now seen corresponding path program 59 times [2022-04-28 02:55:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:55:55,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933262971] [2022-04-28 02:55:55,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:55:55,939 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:55:55,940 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:55:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1832916298, now seen corresponding path program 60 times [2022-04-28 02:55:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:55:55,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194349608] [2022-04-28 02:55:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:55:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:55:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:56,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:55:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:56,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {17941#(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(12, 2); {17905#true} is VALID [2022-04-28 02:55:56,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-28 02:55:56,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-28 02:55:56,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {17905#true} call ULTIMATE.init(); {17941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:55:56,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {17941#(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(12, 2); {17905#true} is VALID [2022-04-28 02:55:56,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-28 02:55:56,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-28 02:55:56,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-28 02:55:56,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {17905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17910#(= main_~i~0 0)} is VALID [2022-04-28 02:55:56,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {17910#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17910#(= main_~i~0 0)} is VALID [2022-04-28 02:55:56,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {17910#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:56,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {17911#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:56,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {17911#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:56,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {17912#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:56,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {17912#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:56,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {17913#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:56,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {17913#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:56,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:56,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {17914#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:56,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {17915#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:56,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {17915#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:56,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {17916#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:56,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {17916#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:56,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {17917#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:56,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {17917#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:56,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {17918#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:56,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {17918#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:56,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {17919#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:56,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {17919#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:56,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {17920#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:56,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {17920#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:56,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {17921#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:56,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {17921#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:56,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {17922#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:56,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {17922#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:56,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {17923#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:56,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {17923#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:56,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {17924#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:56,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {17924#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:56,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {17925#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:56,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {17925#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:56,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {17926#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:56,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {17926#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:56,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {17927#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:56,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {17927#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:56,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {17928#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:56,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {17928#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:56,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {17929#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:56,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {17929#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:56,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {17930#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:56,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {17930#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:56,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {17931#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:56,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {17931#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:56,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {17932#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:56,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {17932#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:56,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {17933#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:56,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {17933#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:56,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {17934#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:56,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {17934#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:56,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {17935#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:56,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {17935#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:56,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {17936#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:56,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {17936#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:56,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {17937#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:56,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {17937#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:56,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {17938#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:56,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {17938#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:56,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {17939#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:56,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {17939#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17940#(<= main_~i~0 30)} is VALID [2022-04-28 02:55:56,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {17940#(<= main_~i~0 30)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-28 02:55:56,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {17906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17906#false} is VALID [2022-04-28 02:55:56,361 INFO L272 TraceCheckUtils]: 68: Hoare triple {17906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {17906#false} is VALID [2022-04-28 02:55:56,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-28 02:55:56,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-28 02:55:56,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-28 02:55:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:55:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194349608] [2022-04-28 02:55:56,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194349608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:55:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219972570] [2022-04-28 02:55:56,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:55:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:55:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:55:56,363 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:55:56,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 02:55:59,489 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 02:55:59,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:55:59,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 02:55:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:55:59,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:55:59,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {17905#true} call ULTIMATE.init(); {17905#true} is VALID [2022-04-28 02:55:59,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {17905#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(12, 2); {17905#true} is VALID [2022-04-28 02:55:59,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-28 02:55:59,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-28 02:55:59,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-28 02:55:59,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {17905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17960#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:59,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {17960#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17960#(<= main_~i~0 0)} is VALID [2022-04-28 02:55:59,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {17960#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:59,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {17911#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17911#(<= main_~i~0 1)} is VALID [2022-04-28 02:55:59,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {17911#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:59,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {17912#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17912#(<= main_~i~0 2)} is VALID [2022-04-28 02:55:59,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {17912#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:59,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {17913#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17913#(<= main_~i~0 3)} is VALID [2022-04-28 02:55:59,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {17913#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:59,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17914#(<= main_~i~0 4)} is VALID [2022-04-28 02:55:59,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {17914#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:59,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {17915#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17915#(<= main_~i~0 5)} is VALID [2022-04-28 02:55:59,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {17915#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:59,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {17916#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17916#(<= main_~i~0 6)} is VALID [2022-04-28 02:55:59,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {17916#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:59,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {17917#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17917#(<= main_~i~0 7)} is VALID [2022-04-28 02:55:59,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {17917#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:59,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {17918#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17918#(<= main_~i~0 8)} is VALID [2022-04-28 02:55:59,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {17918#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:59,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {17919#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17919#(<= main_~i~0 9)} is VALID [2022-04-28 02:55:59,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {17919#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:59,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {17920#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17920#(<= main_~i~0 10)} is VALID [2022-04-28 02:55:59,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {17920#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:59,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {17921#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17921#(<= main_~i~0 11)} is VALID [2022-04-28 02:55:59,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {17921#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:59,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {17922#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17922#(<= main_~i~0 12)} is VALID [2022-04-28 02:55:59,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {17922#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:59,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {17923#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17923#(<= main_~i~0 13)} is VALID [2022-04-28 02:55:59,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {17923#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:59,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {17924#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17924#(<= main_~i~0 14)} is VALID [2022-04-28 02:55:59,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {17924#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:59,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {17925#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17925#(<= main_~i~0 15)} is VALID [2022-04-28 02:55:59,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {17925#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:59,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {17926#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17926#(<= main_~i~0 16)} is VALID [2022-04-28 02:55:59,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {17926#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:59,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {17927#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17927#(<= main_~i~0 17)} is VALID [2022-04-28 02:55:59,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {17927#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:59,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {17928#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17928#(<= main_~i~0 18)} is VALID [2022-04-28 02:55:59,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {17928#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:59,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {17929#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17929#(<= main_~i~0 19)} is VALID [2022-04-28 02:55:59,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {17929#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:59,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {17930#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17930#(<= main_~i~0 20)} is VALID [2022-04-28 02:55:59,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {17930#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:59,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {17931#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17931#(<= main_~i~0 21)} is VALID [2022-04-28 02:55:59,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {17931#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:59,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {17932#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17932#(<= main_~i~0 22)} is VALID [2022-04-28 02:55:59,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {17932#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:59,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {17933#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17933#(<= main_~i~0 23)} is VALID [2022-04-28 02:55:59,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {17933#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:59,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {17934#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17934#(<= main_~i~0 24)} is VALID [2022-04-28 02:55:59,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {17934#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:59,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {17935#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17935#(<= main_~i~0 25)} is VALID [2022-04-28 02:55:59,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {17935#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:59,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {17936#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17936#(<= main_~i~0 26)} is VALID [2022-04-28 02:55:59,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {17936#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:59,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {17937#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17937#(<= main_~i~0 27)} is VALID [2022-04-28 02:55:59,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {17937#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:59,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {17938#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17938#(<= main_~i~0 28)} is VALID [2022-04-28 02:55:59,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {17938#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:59,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {17939#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17939#(<= main_~i~0 29)} is VALID [2022-04-28 02:55:59,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {17939#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17940#(<= main_~i~0 30)} is VALID [2022-04-28 02:55:59,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {17940#(<= main_~i~0 30)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {17906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L272 TraceCheckUtils]: 68: Hoare triple {17906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-28 02:55:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:55:59,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:01,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-28 02:56:01,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-28 02:56:01,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-28 02:56:01,152 INFO L272 TraceCheckUtils]: 68: Hoare triple {17906#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {17906#false} is VALID [2022-04-28 02:56:01,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {17906#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17906#false} is VALID [2022-04-28 02:56:01,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {18174#(< main_~i~0 2048)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-28 02:56:01,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {18178#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18174#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:01,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {18178#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18178#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:01,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {18185#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18178#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:01,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {18185#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18185#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:01,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {18192#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18185#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:01,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {18192#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18192#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:01,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {18199#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18192#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:01,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {18199#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18199#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:01,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {18206#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18199#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:01,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {18206#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18206#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:01,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {18213#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18206#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:01,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {18213#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18213#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:01,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {18220#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18213#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:01,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {18220#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18220#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:01,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {18227#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18220#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:01,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {18227#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18227#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:01,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {18234#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18227#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:01,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {18234#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18234#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:01,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {18241#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18234#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:01,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {18241#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18241#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:01,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {18248#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18241#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:01,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {18248#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18248#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:01,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {18255#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18248#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:01,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {18255#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18255#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:01,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {18262#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18255#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:01,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {18262#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18262#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:01,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {18269#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18262#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:01,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {18269#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18269#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:01,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {18276#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18269#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:01,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {18276#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18276#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:01,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {18283#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18276#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:01,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {18283#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18283#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:01,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {18290#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18283#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:01,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {18290#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18290#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:01,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {18297#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18290#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:01,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {18297#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18297#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:01,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {18304#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18297#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:01,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {18304#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18304#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:01,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {18311#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18304#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:01,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {18311#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18311#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:01,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {18318#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18311#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:01,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {18318#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18318#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:01,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {18325#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18318#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:01,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {18325#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18325#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:01,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {18332#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18325#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:01,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {18332#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18332#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:01,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {18339#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18332#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:01,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {18339#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18339#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:01,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {18346#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18339#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:01,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {18346#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18346#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:01,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {18353#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18346#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:01,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {18353#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18353#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:01,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {18360#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18353#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:01,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {18360#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18360#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:01,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {18367#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18360#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:01,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {18367#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18367#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:01,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {18374#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18367#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:01,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {18374#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18374#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:01,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {18381#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18374#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:01,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {18381#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18381#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:01,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {17905#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18381#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:01,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-28 02:56:01,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-28 02:56:01,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-28 02:56:01,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {17905#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(12, 2); {17905#true} is VALID [2022-04-28 02:56:01,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {17905#true} call ULTIMATE.init(); {17905#true} is VALID [2022-04-28 02:56:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:01,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219972570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:01,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:01,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 02:56:01,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:01,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933262971] [2022-04-28 02:56:01,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933262971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:01,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:01,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 02:56:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941372977] [2022-04-28 02:56:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 02:56:01,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:01,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:01,227 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 02:56:01,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 02:56:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 02:56:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:56:01,228 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:02,092 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:56:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 02:56:02,093 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 02:56:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 02:56:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 02:56:02,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 82 transitions. [2022-04-28 02:56:02,155 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 02:56:02,156 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:56:02,156 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 02:56:02,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 02:56:02,158 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:02,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 44 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 02:56:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-04-28 02:56:02,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:02,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,346 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,347 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:02,347 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:56:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 02:56:02,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:02,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:02,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:56:02,348 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 02:56:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:02,348 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 02:56:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 02:56:02,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:02,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:02,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:02,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-28 02:56:02,349 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-28 02:56:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:02,349 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-28 02:56:02,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 33 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:02,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-28 02:56:02,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 02:56:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 02:56:02,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:02,420 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:02,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 02:56:02,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 02:56:02,621 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1370058408, now seen corresponding path program 61 times [2022-04-28 02:56:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:02,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662044803] [2022-04-28 02:56:02,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:02,623 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:02,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1370058408, now seen corresponding path program 62 times [2022-04-28 02:56:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:02,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107081441] [2022-04-28 02:56:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:03,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {18970#(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(12, 2); {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {18933#true} call ULTIMATE.init(); {18970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:03,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {18970#(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(12, 2); {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-28 02:56:03,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-28 02:56:03,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {18933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18938#(= main_~i~0 0)} is VALID [2022-04-28 02:56:03,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {18938#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18938#(= main_~i~0 0)} is VALID [2022-04-28 02:56:03,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {18938#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18939#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:03,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {18939#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18939#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:03,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {18939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18940#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:03,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {18940#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18940#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:03,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {18940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18941#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:03,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {18941#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18941#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:03,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {18941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18942#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:03,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {18942#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18942#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:03,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {18942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18943#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:03,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {18943#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18943#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:03,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {18943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18944#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:03,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {18944#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18944#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:03,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {18944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18945#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:03,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {18945#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18945#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:03,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {18945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18946#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:03,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {18946#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18946#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:03,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {18946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18947#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:03,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {18947#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18947#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:03,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {18947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18948#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:03,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {18948#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18948#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:03,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {18948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18949#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:03,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {18949#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18949#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:03,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {18949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18950#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:03,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {18950#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18950#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:03,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {18950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18951#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:03,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {18951#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18951#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:03,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {18951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18952#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:03,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {18952#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18952#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:03,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {18952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18953#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:03,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {18953#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18953#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:03,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {18953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18954#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:03,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {18954#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18954#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:03,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {18954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18955#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:03,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18955#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:03,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {18955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18956#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:03,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {18956#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18956#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:03,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {18956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18957#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:03,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {18957#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18957#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:03,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {18957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18958#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:03,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {18958#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18958#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:03,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {18958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18959#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:03,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {18959#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18959#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:03,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {18959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18960#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:03,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {18960#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18960#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:03,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {18960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18961#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:03,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {18961#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18961#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:03,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {18961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18962#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:03,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {18962#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18962#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:03,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {18962#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18963#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:03,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {18963#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18963#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:03,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {18963#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18964#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:03,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {18964#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18964#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:03,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {18964#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18965#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:03,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {18965#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18965#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:03,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {18965#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18966#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:03,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {18966#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18966#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:03,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {18966#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18967#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:03,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {18967#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18967#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:03,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {18967#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18968#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {18968#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18968#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {18968#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18969#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 31)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {18934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18934#false} is VALID [2022-04-28 02:56:03,061 INFO L272 TraceCheckUtils]: 70: Hoare triple {18934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18934#false} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-28 02:56:03,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-28 02:56:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107081441] [2022-04-28 02:56:03,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107081441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384626315] [2022-04-28 02:56:03,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:03,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:03,063 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:03,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 02:56:03,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:03,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 02:56:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:03,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:03,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {18933#true} call ULTIMATE.init(); {18933#true} is VALID [2022-04-28 02:56:03,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {18933#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(12, 2); {18933#true} is VALID [2022-04-28 02:56:03,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-28 02:56:03,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-28 02:56:03,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-28 02:56:03,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {18933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18989#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:03,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {18989#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18989#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:03,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {18989#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18939#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:03,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {18939#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18939#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:03,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {18939#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18940#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:03,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {18940#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18940#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:03,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {18940#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18941#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:03,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {18941#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18941#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:03,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {18941#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18942#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:03,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {18942#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18942#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:03,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {18942#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18943#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:03,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {18943#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18943#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:03,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {18943#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18944#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:03,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {18944#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18944#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:03,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {18944#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18945#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:03,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {18945#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18945#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:03,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {18945#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18946#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:03,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {18946#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18946#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:03,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {18946#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18947#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:03,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {18947#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18947#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:03,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {18947#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18948#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:03,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {18948#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18948#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:03,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {18948#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18949#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:03,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {18949#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18949#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:03,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {18949#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18950#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:03,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {18950#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18950#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:03,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {18950#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18951#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:03,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {18951#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18951#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:03,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {18951#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18952#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:03,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {18952#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18952#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:03,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {18952#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18953#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:03,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {18953#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18953#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:03,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {18953#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18954#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:03,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {18954#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18954#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:03,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {18954#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18955#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:03,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18955#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:03,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {18955#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18956#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:03,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {18956#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18956#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:03,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {18956#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18957#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:03,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {18957#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18957#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:03,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {18957#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18958#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:03,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {18958#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18958#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:03,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {18958#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18959#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:03,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {18959#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18959#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:03,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {18959#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18960#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:03,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {18960#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18960#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:03,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {18960#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18961#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:03,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {18961#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18961#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:03,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {18961#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18962#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:03,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {18962#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18962#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:03,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {18962#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18963#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:03,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {18963#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18963#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:03,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {18963#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18964#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:03,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {18964#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18964#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:03,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {18964#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18965#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:03,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {18965#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18965#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:03,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {18965#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18966#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:03,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {18966#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18966#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:03,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {18966#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18967#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:03,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {18967#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18967#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:03,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {18967#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18968#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:03,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {18968#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18968#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:03,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {18968#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18969#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:03,646 INFO L290 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 31)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {18934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L272 TraceCheckUtils]: 70: Hoare triple {18934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-28 02:56:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:03,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:04,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-28 02:56:04,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-28 02:56:04,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-28 02:56:04,892 INFO L272 TraceCheckUtils]: 70: Hoare triple {18934#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {18934#false} is VALID [2022-04-28 02:56:04,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {18934#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18934#false} is VALID [2022-04-28 02:56:04,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {19209#(< main_~i~0 2048)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-28 02:56:04,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {19213#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19209#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:04,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {19213#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19213#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:04,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {19220#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19213#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:04,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {19220#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19220#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:04,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {19227#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19220#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:04,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {19227#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19227#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:04,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {19234#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19227#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:04,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {19234#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19234#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:04,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {19241#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19234#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:04,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {19241#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19241#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:04,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {19248#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19241#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:04,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {19248#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19248#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:04,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {19255#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19248#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:04,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {19255#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19255#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:04,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {19262#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19255#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:04,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {19262#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19262#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:04,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {19269#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19262#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:04,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {19269#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19269#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:04,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {19276#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19269#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:04,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {19276#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19276#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:04,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {19283#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19276#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:04,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {19283#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19283#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:04,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {19290#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19283#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:04,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {19290#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19290#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:04,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {19297#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19290#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:04,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {19297#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19297#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:04,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {19304#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19297#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:04,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {19304#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19304#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:04,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {19311#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19304#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:04,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {19311#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19311#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:04,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {19318#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19311#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:04,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {19318#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19318#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:04,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {19325#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19318#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:04,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {19325#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19325#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:04,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {19332#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19325#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:04,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {19332#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19332#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:04,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {19339#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19332#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:04,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {19339#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19339#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:04,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {19346#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19339#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:04,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {19346#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19346#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:04,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {19353#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19346#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:04,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {19353#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19353#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:04,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {19360#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19353#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:04,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {19360#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19360#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:04,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {19367#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19360#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:04,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {19367#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19367#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:04,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {19374#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19367#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:04,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {19374#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19374#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:04,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {19381#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19374#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:04,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {19381#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19381#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:04,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {19388#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19381#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:04,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {19388#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19388#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:04,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {19395#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19388#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:04,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {19395#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19395#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:04,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {19402#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19395#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:04,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {19402#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19402#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:04,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {19409#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19402#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:04,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {19409#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19409#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:04,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {19416#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19409#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:04,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {19416#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19416#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:04,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {19423#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19416#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:04,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {19423#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19423#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:04,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {18933#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19423#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:04,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-28 02:56:04,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-28 02:56:04,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-28 02:56:04,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {18933#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(12, 2); {18933#true} is VALID [2022-04-28 02:56:04,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {18933#true} call ULTIMATE.init(); {18933#true} is VALID [2022-04-28 02:56:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:04,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384626315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:04,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:04,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 02:56:04,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:04,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662044803] [2022-04-28 02:56:04,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662044803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:04,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:04,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 02:56:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171315552] [2022-04-28 02:56:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 02:56:04,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:04,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:04,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:04,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 02:56:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 02:56:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 02:56:04,958 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:05,827 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:56:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 02:56:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 02:56:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-28 02:56:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-28 02:56:05,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 84 transitions. [2022-04-28 02:56:05,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:05,885 INFO L225 Difference]: With dead ends: 84 [2022-04-28 02:56:05,885 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 02:56:05,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:56:05,886 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:05,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 44 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 02:56:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-28 02:56:06,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:06,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:06,103 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:06,103 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:06,103 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:56:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 02:56:06,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:06,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:06,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 02:56:06,104 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 02:56:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:06,104 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 02:56:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 02:56:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:06,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:06,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-28 02:56:06,105 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2022-04-28 02:56:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:06,106 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-28 02:56:06,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:06,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-28 02:56:06,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 02:56:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 02:56:06,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:06,177 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:06,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 02:56:06,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:06,378 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:06,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1054742394, now seen corresponding path program 63 times [2022-04-28 02:56:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:06,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486696306] [2022-04-28 02:56:06,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:06,381 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:06,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1054742394, now seen corresponding path program 64 times [2022-04-28 02:56:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:06,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156509469] [2022-04-28 02:56:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:06,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {20027#(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(12, 2); {19989#true} is VALID [2022-04-28 02:56:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-28 02:56:06,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-28 02:56:06,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {19989#true} call ULTIMATE.init(); {20027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:06,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {20027#(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(12, 2); {19989#true} is VALID [2022-04-28 02:56:06,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-28 02:56:06,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-28 02:56:06,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-28 02:56:06,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {19989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19994#(= main_~i~0 0)} is VALID [2022-04-28 02:56:06,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {19994#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19994#(= main_~i~0 0)} is VALID [2022-04-28 02:56:06,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {19994#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19995#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:06,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {19995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19995#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:06,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {19995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19996#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:06,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {19996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19996#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:06,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {19996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19997#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:06,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {19997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19997#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:06,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {19997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19998#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:06,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {19998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19998#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:06,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {19998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19999#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:06,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {19999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19999#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:06,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {19999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20000#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:06,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {20000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20000#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:06,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {20000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20001#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:06,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {20001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20001#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:06,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {20001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20002#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:06,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {20002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20002#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:06,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {20002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20003#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:06,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {20003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20003#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:06,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {20003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20004#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:06,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {20004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20004#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:06,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {20004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20005#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:06,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {20005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20005#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:06,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {20005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20006#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:06,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {20006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20006#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:06,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {20006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20007#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:06,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {20007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20007#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:06,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {20007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20008#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:06,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {20008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20008#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:06,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {20008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20009#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:06,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {20009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20009#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:06,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {20009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20010#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:06,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {20010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20010#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:06,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {20010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20011#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:06,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {20011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20011#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:06,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {20011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20012#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:06,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {20012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20012#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:06,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20013#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:06,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {20013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20013#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:06,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {20013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20014#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:06,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {20014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20014#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:06,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {20014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20015#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:06,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {20015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20015#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:06,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {20015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20016#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:06,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {20016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20016#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:06,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {20016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20017#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:06,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {20017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20017#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:06,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {20017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20018#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:06,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {20018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:06,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {20018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20019#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:06,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {20019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:06,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {20019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20020#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:06,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {20020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:06,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {20020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20021#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:06,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {20021#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:06,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {20021#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20022#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:06,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {20022#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:06,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {20022#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20023#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:06,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {20023#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:06,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {20023#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20024#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:06,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {20024#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:06,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {20024#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20025#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:06,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {20025#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {20025#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20026#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {20026#(<= main_~i~0 32)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {19990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19990#false} is VALID [2022-04-28 02:56:06,884 INFO L272 TraceCheckUtils]: 72: Hoare triple {19990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {19990#false} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-28 02:56:06,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-28 02:56:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156509469] [2022-04-28 02:56:06,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156509469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081033217] [2022-04-28 02:56:06,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:06,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:06,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:06,886 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:06,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 02:56:07,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:07,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:07,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 02:56:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:07,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {19989#true} call ULTIMATE.init(); {19989#true} is VALID [2022-04-28 02:56:07,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {19989#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(12, 2); {19989#true} is VALID [2022-04-28 02:56:07,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-28 02:56:07,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-28 02:56:07,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-28 02:56:07,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {19989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {20046#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {20046#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20046#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {20046#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19995#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:07,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {19995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19995#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:07,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {19995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19996#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:07,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {19996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19996#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:07,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {19996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19997#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:07,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {19997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19997#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:07,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {19997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19998#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:07,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {19998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19998#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:07,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {19998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19999#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:07,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {19999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19999#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:07,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {19999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20000#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:07,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {20000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20000#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:07,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {20000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20001#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:07,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {20001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20001#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:07,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {20001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20002#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:07,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {20002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20002#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:07,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {20002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20003#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:07,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {20003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20003#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:07,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {20003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20004#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:07,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {20004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20004#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:07,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {20004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20005#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:07,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {20005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20005#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:07,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {20005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20006#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:07,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {20006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20006#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:07,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {20006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20007#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:07,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {20007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20007#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:07,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {20007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20008#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:07,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {20008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20008#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:07,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {20008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20009#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:07,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {20009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20009#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:07,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {20009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20010#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:07,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {20010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20010#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:07,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {20010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20011#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:07,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {20011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20011#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:07,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {20011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20012#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:07,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {20012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20012#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:07,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20013#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:07,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {20013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20013#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:07,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {20013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20014#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:07,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {20014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20014#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:07,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {20014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20015#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:07,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {20015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20015#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:07,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {20015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20016#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:07,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {20016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20016#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:07,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {20016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20017#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:07,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {20017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20017#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:07,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {20017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20018#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:07,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {20018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:07,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {20018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20019#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:07,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {20019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:07,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {20019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20020#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:07,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {20020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:07,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {20020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20021#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:07,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {20021#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:07,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {20021#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20022#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:07,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {20022#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:07,487 INFO L290 TraceCheckUtils]: 63: Hoare triple {20022#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20023#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:07,487 INFO L290 TraceCheckUtils]: 64: Hoare triple {20023#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:07,488 INFO L290 TraceCheckUtils]: 65: Hoare triple {20023#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20024#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:07,488 INFO L290 TraceCheckUtils]: 66: Hoare triple {20024#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:07,488 INFO L290 TraceCheckUtils]: 67: Hoare triple {20024#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20025#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {20025#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {20025#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20026#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {20026#(<= main_~i~0 32)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 71: Hoare triple {19990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19990#false} is VALID [2022-04-28 02:56:07,489 INFO L272 TraceCheckUtils]: 72: Hoare triple {19990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {19990#false} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-28 02:56:07,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-28 02:56:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:07,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:08,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-28 02:56:08,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-28 02:56:08,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-28 02:56:08,851 INFO L272 TraceCheckUtils]: 72: Hoare triple {19990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {19990#false} is VALID [2022-04-28 02:56:08,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {19990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19990#false} is VALID [2022-04-28 02:56:08,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {20272#(< main_~i~0 2048)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-28 02:56:08,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {20276#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20272#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:08,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {20276#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20276#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:08,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {20283#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20276#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:08,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {20283#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20283#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:08,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {20290#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20283#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:08,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {20290#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20290#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:08,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {20297#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20290#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:08,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {20297#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20297#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:08,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {20304#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20297#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:08,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {20304#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20304#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:08,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {20311#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20304#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:08,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {20311#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20311#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:08,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {20318#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20311#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:08,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {20318#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20318#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:08,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {20325#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20318#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:08,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {20325#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20325#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:08,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {20332#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20325#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:08,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {20332#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20332#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:08,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {20339#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20332#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:08,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {20339#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20339#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:08,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {20346#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20339#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:08,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {20346#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20346#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:08,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {20353#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20346#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:08,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {20353#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20353#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:08,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {20360#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20353#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:08,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {20360#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20360#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:08,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {20367#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20360#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:08,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {20367#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20367#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:08,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {20374#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20367#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:08,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {20374#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20374#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:08,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {20381#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20374#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:08,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {20381#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20381#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:08,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {20388#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20381#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:08,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {20388#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20388#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:08,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {20395#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20388#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:08,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {20395#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20395#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:08,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {20402#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20395#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:08,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {20402#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20402#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:08,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {20409#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20402#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:08,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {20409#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20409#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:08,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {20416#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20409#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:08,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {20416#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20416#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:08,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {20423#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20416#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:08,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {20423#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20423#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:08,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {20430#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20423#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:08,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {20430#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20430#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:08,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {20437#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20430#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:08,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {20437#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20437#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:08,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {20444#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20437#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:08,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {20444#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20444#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:08,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {20451#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20444#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:08,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {20451#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20451#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:08,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {20458#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20451#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:08,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {20458#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20458#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:08,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {20465#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20458#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:08,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {20465#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20465#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:08,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {20472#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20465#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:08,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {20472#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20472#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:08,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {20479#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20472#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:08,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {20479#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20479#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:08,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {20486#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20479#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:08,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {20486#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20486#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:08,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {20493#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20486#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:08,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {20493#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20493#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:08,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {19989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {20493#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:08,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-28 02:56:08,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-28 02:56:08,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-28 02:56:08,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {19989#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(12, 2); {19989#true} is VALID [2022-04-28 02:56:08,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {19989#true} call ULTIMATE.init(); {19989#true} is VALID [2022-04-28 02:56:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:08,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081033217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:08,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:08,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 02:56:08,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:08,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486696306] [2022-04-28 02:56:08,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486696306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:08,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:08,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 02:56:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803648193] [2022-04-28 02:56:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 02:56:08,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:08,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 02:56:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 02:56:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:56:08,921 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:09,784 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:56:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 02:56:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 02:56:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-28 02:56:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-28 02:56:09,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 86 transitions. [2022-04-28 02:56:09,856 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 02:56:09,857 INFO L225 Difference]: With dead ends: 86 [2022-04-28 02:56:09,857 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 02:56:09,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4626, Invalid=5880, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 02:56:09,860 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:09,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 02:56:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-28 02:56:10,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:10,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,095 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,095 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:10,095 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:56:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 02:56:10,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:10,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:10,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 02:56:10,096 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 02:56:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:10,097 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 02:56:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 02:56:10,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:10,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:10,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:10,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-28 02:56:10,098 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2022-04-28 02:56:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:10,098 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-28 02:56:10,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-28 02:56:10,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 02:56:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 02:56:10,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:10,174 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 02:56:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:10,375 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash -878928612, now seen corresponding path program 65 times [2022-04-28 02:56:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:10,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162917404] [2022-04-28 02:56:10,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:10,378 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:10,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash -878928612, now seen corresponding path program 66 times [2022-04-28 02:56:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:10,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612682186] [2022-04-28 02:56:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {21112#(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(12, 2); {21073#true} is VALID [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-28 02:56:10,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-28 02:56:10,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {21073#true} call ULTIMATE.init(); {21112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {21112#(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(12, 2); {21073#true} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-28 02:56:10,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-28 02:56:10,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {21073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21078#(= main_~i~0 0)} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {21078#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21078#(= main_~i~0 0)} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {21078#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21079#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {21079#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21079#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {21079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21080#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {21080#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21080#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {21080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21081#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {21081#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21081#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {21081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21082#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {21082#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21082#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {21082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21083#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {21083#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21083#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {21083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21084#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {21084#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21084#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:10,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {21084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21085#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:10,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {21085#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21085#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:10,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {21085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21086#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:10,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {21086#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21086#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:10,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {21086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21087#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:10,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {21087#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21087#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:10,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {21087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21088#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:10,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {21088#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21088#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:10,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {21088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21089#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:10,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {21089#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21089#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:10,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {21089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21090#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:10,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {21090#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21090#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:10,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {21090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21091#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:10,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {21091#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21091#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:10,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {21091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21092#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:10,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {21092#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21092#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:10,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {21092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21093#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:10,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {21093#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21093#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:10,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {21093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21094#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:10,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {21094#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21094#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:10,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {21094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21095#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:10,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {21095#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21095#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:10,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {21095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21096#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:10,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {21096#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21096#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:10,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {21096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21097#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:10,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {21097#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21097#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:10,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {21097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21098#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:10,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {21098#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21098#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:10,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {21098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21099#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:10,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {21099#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21099#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:10,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {21099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21100#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:10,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {21100#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21100#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:10,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {21100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21101#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:10,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {21101#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:10,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {21101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21102#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:10,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {21102#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:10,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {21102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21103#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:10,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {21103#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:10,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {21103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21104#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:10,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {21104#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:10,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {21104#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21105#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:10,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {21105#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:10,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {21105#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21106#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:10,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {21106#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:10,855 INFO L290 TraceCheckUtils]: 63: Hoare triple {21106#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21107#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:10,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {21107#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:10,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {21107#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21108#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:10,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {21108#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:10,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {21108#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21109#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:10,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {21109#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:10,857 INFO L290 TraceCheckUtils]: 69: Hoare triple {21109#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21110#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:10,857 INFO L290 TraceCheckUtils]: 70: Hoare triple {21110#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 71: Hoare triple {21110#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21111#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {21111#(<= main_~i~0 33)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {21074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21074#false} is VALID [2022-04-28 02:56:10,858 INFO L272 TraceCheckUtils]: 74: Hoare triple {21074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {21074#false} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-28 02:56:10,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-28 02:56:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612682186] [2022-04-28 02:56:10,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612682186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401051235] [2022-04-28 02:56:10,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:10,860 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:10,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 02:56:16,765 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 02:56:16,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:16,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 02:56:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:16,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:17,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {21073#true} call ULTIMATE.init(); {21073#true} is VALID [2022-04-28 02:56:17,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {21073#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(12, 2); {21073#true} is VALID [2022-04-28 02:56:17,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-28 02:56:17,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-28 02:56:17,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-28 02:56:17,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {21073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21131#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:17,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {21131#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21131#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:17,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {21131#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21079#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {21079#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21079#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {21079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21080#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {21080#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21080#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {21080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21081#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {21081#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21081#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {21081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21082#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {21082#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21082#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {21082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21083#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {21083#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21083#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {21083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21084#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {21084#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21084#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {21084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21085#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {21085#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21085#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {21085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21086#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {21086#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21086#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {21086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21087#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:17,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {21087#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21087#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:17,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {21087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21088#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:17,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {21088#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21088#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:17,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {21088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21089#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:17,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {21089#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21089#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:17,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {21089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21090#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:17,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {21090#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21090#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:17,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {21090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21091#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:17,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {21091#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21091#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:17,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {21091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21092#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:17,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {21092#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21092#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:17,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {21092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21093#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:17,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {21093#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21093#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:17,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {21093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21094#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:17,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {21094#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21094#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:17,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {21094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21095#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:17,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {21095#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21095#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:17,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {21095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21096#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:17,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {21096#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21096#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:17,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {21096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21097#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:17,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {21097#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21097#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:17,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {21097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21098#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:17,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {21098#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21098#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:17,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {21098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21099#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:17,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {21099#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21099#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:17,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {21099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21100#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:17,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {21100#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21100#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:17,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {21100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21101#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:17,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {21101#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:17,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {21101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21102#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:17,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {21102#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:17,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {21102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21103#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:17,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {21103#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:17,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {21103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21104#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:17,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {21104#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:17,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {21104#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21105#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:17,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {21105#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:17,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {21105#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21106#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:17,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {21106#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:17,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {21106#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21107#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:17,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {21107#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:17,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {21107#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21108#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:17,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {21108#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:17,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {21108#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21109#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:17,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {21109#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:17,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {21109#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21110#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:17,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {21110#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {21110#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21111#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {21111#(<= main_~i~0 33)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {21074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21074#false} is VALID [2022-04-28 02:56:17,240 INFO L272 TraceCheckUtils]: 74: Hoare triple {21074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {21074#false} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-28 02:56:17,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-28 02:56:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:17,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:18,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-28 02:56:18,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-28 02:56:18,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-28 02:56:18,625 INFO L272 TraceCheckUtils]: 74: Hoare triple {21074#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {21074#false} is VALID [2022-04-28 02:56:18,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {21074#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21074#false} is VALID [2022-04-28 02:56:18,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {21363#(< main_~i~0 2048)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-28 02:56:18,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {21367#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21363#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:18,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {21367#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21367#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:18,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {21374#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21367#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:18,626 INFO L290 TraceCheckUtils]: 68: Hoare triple {21374#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21374#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:18,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {21381#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21374#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:18,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {21381#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21381#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:18,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {21388#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21381#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:18,627 INFO L290 TraceCheckUtils]: 64: Hoare triple {21388#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21388#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:18,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {21395#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21388#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:18,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {21395#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21395#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:18,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {21402#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21395#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:18,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {21402#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21402#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:18,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {21409#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21402#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:18,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {21409#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21409#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:18,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {21416#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21409#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:18,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {21416#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21416#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:18,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {21423#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21416#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:18,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {21423#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21423#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:18,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {21430#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21423#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:18,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {21430#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21430#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:18,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {21437#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21430#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:18,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {21437#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21437#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:18,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {21444#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21437#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:18,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {21444#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21444#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:18,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {21451#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21444#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:18,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {21451#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21451#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:18,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {21458#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21451#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:18,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {21458#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21458#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:18,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {21465#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21458#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:18,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {21465#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21465#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:18,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {21472#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21465#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:18,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {21472#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21472#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:18,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {21479#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21472#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:18,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {21479#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21479#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:18,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {21486#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21479#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:18,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {21486#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21486#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:18,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {21493#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21486#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:18,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {21493#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21493#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:18,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {21500#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21493#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:18,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {21500#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21500#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:18,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {21507#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21500#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:18,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {21507#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21507#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:18,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {21514#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21507#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:18,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {21514#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21514#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:18,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {21521#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21514#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:18,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {21521#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21521#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:18,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {21528#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21521#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:18,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {21528#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21528#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:18,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {21535#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21528#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:18,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {21535#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21535#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:18,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {21542#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21535#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:18,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {21542#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21542#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:18,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {21549#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21542#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:18,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {21549#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21549#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:18,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {21556#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21549#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:18,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {21556#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21556#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:18,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {21563#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21556#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:18,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {21563#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21563#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:18,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {21570#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21563#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:18,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {21570#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21570#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:18,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {21577#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:18,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {21577#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21577#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:18,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {21584#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:18,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {21584#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21584#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:18,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {21591#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:18,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {21591#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21591#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:18,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {21073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21591#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:18,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-28 02:56:18,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-28 02:56:18,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-28 02:56:18,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {21073#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(12, 2); {21073#true} is VALID [2022-04-28 02:56:18,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {21073#true} call ULTIMATE.init(); {21073#true} is VALID [2022-04-28 02:56:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401051235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:18,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:18,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-28 02:56:18,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:18,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162917404] [2022-04-28 02:56:18,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162917404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:18,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:18,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 02:56:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316977694] [2022-04-28 02:56:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 02:56:18,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:18,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 02:56:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 02:56:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 02:56:18,694 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:19,650 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:56:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 02:56:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 02:56:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-28 02:56:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-28 02:56:19,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 88 transitions. [2022-04-28 02:56:19,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:19,719 INFO L225 Difference]: With dead ends: 88 [2022-04-28 02:56:19,719 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 02:56:19,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:56:19,721 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:19,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 39 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 02:56:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-28 02:56:19,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:19,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,963 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,963 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:19,964 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:56:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-28 02:56:19,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:19,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:19,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 02:56:19,965 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 02:56:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:19,965 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 02:56:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-28 02:56:19,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:19,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:19,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:19,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-04-28 02:56:19,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2022-04-28 02:56:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:19,966 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-04-28 02:56:19,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:19,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 81 transitions. [2022-04-28 02:56:20,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 02:56:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 02:56:20,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:20,044 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:20,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 02:56:20,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 02:56:20,247 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 584073790, now seen corresponding path program 67 times [2022-04-28 02:56:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053611278] [2022-04-28 02:56:20,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:20,250 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:20,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 584073790, now seen corresponding path program 68 times [2022-04-28 02:56:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:20,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978001006] [2022-04-28 02:56:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {22225#(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(12, 2); {22185#true} is VALID [2022-04-28 02:56:20,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-28 02:56:20,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-28 02:56:20,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {22185#true} call ULTIMATE.init(); {22225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:20,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {22225#(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(12, 2); {22185#true} is VALID [2022-04-28 02:56:20,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-28 02:56:20,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-28 02:56:20,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-28 02:56:20,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {22185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22190#(= main_~i~0 0)} is VALID [2022-04-28 02:56:20,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {22190#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22190#(= main_~i~0 0)} is VALID [2022-04-28 02:56:20,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {22190#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22191#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:20,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {22191#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:20,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {22191#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22192#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:20,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {22192#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:20,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {22192#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22193#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:20,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {22193#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:20,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {22193#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22194#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:20,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {22194#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:20,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {22194#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22195#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:20,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {22195#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:20,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {22195#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22196#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:20,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {22196#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:20,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {22196#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22197#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:20,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {22197#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:20,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {22197#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22198#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:20,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {22198#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:20,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {22198#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22199#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:20,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {22199#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:20,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {22199#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22200#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:20,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {22200#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:20,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {22200#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22201#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:20,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {22201#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:20,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {22201#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22202#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:20,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {22202#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:20,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {22202#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22203#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:20,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {22203#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:20,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {22203#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22204#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:20,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {22204#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:20,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {22204#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22205#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:20,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {22205#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:20,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {22205#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22206#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:20,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {22206#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22206#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:20,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {22206#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22207#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:20,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {22207#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22207#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:20,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {22207#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22208#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:20,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {22208#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22208#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:20,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {22208#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22209#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:20,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {22209#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22209#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:20,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {22209#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22210#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:20,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {22210#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22210#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:20,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {22210#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22211#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:20,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {22211#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22211#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:20,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {22211#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22212#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:20,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {22212#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22212#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:20,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {22212#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22213#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:20,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {22213#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22213#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:20,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {22213#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22214#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:20,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {22214#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22214#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:20,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {22214#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22215#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:20,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {22215#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22215#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:20,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {22215#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22216#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:20,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {22216#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22216#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:20,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {22216#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22217#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:20,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {22217#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22217#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:20,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {22217#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22218#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:20,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {22218#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22218#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:20,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {22218#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22219#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:20,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {22219#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22219#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:20,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {22219#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22220#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:20,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {22220#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22220#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:20,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {22220#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22221#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:20,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {22221#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22221#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:20,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {22221#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22222#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:20,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {22222#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22222#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:20,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {22222#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22223#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:20,745 INFO L290 TraceCheckUtils]: 72: Hoare triple {22223#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22223#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:20,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {22223#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22224#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:20,746 INFO L290 TraceCheckUtils]: 74: Hoare triple {22224#(<= main_~i~0 34)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L290 TraceCheckUtils]: 75: Hoare triple {22186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L272 TraceCheckUtils]: 76: Hoare triple {22186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-28 02:56:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978001006] [2022-04-28 02:56:20,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978001006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034988042] [2022-04-28 02:56:20,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:20,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:20,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:20,747 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:20,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 02:56:20,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:20,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:20,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 02:56:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:20,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:21,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {22185#true} call ULTIMATE.init(); {22185#true} is VALID [2022-04-28 02:56:21,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {22185#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(12, 2); {22185#true} is VALID [2022-04-28 02:56:21,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-28 02:56:21,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-28 02:56:21,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-28 02:56:21,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {22185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22244#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {22244#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22244#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {22244#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22191#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {22191#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {22191#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22192#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {22192#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {22192#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22193#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:21,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {22193#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:21,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {22193#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22194#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:21,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {22194#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:21,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {22194#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22195#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:21,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {22195#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:21,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {22195#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22196#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:21,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {22196#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:21,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {22196#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22197#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:21,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {22197#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:21,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {22197#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22198#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:21,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {22198#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:21,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {22198#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22199#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:21,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {22199#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:21,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {22199#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22200#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:21,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {22200#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:21,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {22200#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22201#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:21,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {22201#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:21,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {22201#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22202#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:21,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {22202#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:21,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {22202#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22203#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:21,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {22203#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:21,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {22203#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22204#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:21,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {22204#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:21,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {22204#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22205#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:21,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {22205#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:21,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {22205#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22206#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:21,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {22206#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22206#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:21,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {22206#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22207#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:21,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {22207#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22207#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:21,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {22207#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22208#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:21,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {22208#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22208#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:21,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {22208#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22209#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:21,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {22209#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22209#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:21,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {22209#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22210#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:21,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {22210#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22210#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:21,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {22210#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22211#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:21,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {22211#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22211#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:21,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {22211#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22212#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:21,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {22212#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22212#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:21,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {22212#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22213#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:21,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {22213#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22213#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:21,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {22213#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22214#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:21,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {22214#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22214#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:21,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {22214#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22215#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:21,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {22215#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22215#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:21,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {22215#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22216#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:21,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {22216#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22216#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:21,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {22216#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22217#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:21,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {22217#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22217#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:21,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {22217#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22218#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:21,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {22218#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22218#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:21,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {22218#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22219#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:21,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {22219#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22219#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:21,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {22219#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22220#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:21,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {22220#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22220#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:21,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {22220#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22221#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:21,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {22221#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22221#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:21,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {22221#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22222#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:21,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {22222#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22222#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:21,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {22222#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22223#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:21,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {22223#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22223#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:21,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {22223#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22224#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:21,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {22224#(<= main_~i~0 34)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {22186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L272 TraceCheckUtils]: 76: Hoare triple {22186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-28 02:56:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:21,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:22,842 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-28 02:56:22,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-28 02:56:22,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-28 02:56:22,842 INFO L272 TraceCheckUtils]: 76: Hoare triple {22186#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {22186#false} is VALID [2022-04-28 02:56:22,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {22186#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22186#false} is VALID [2022-04-28 02:56:22,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {22482#(< main_~i~0 2048)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-28 02:56:22,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {22486#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22482#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:22,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {22486#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22486#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:22,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {22493#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22486#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:22,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {22493#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22493#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:22,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {22500#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22493#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:22,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {22500#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22500#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:22,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {22507#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22500#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:22,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {22507#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22507#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:22,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {22514#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22507#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:22,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {22514#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22514#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:22,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {22521#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22514#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:22,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {22521#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22521#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:22,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {22528#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22521#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:22,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {22528#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22528#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:22,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {22535#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22528#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:22,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {22535#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22535#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:22,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {22542#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22535#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:22,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {22542#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22542#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:22,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {22549#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22542#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:22,849 INFO L290 TraceCheckUtils]: 54: Hoare triple {22549#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22549#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:22,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {22556#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22549#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:22,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {22556#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22556#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:22,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {22563#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22556#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:22,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {22563#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22563#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:22,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {22570#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22563#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:22,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {22570#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22570#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:22,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {22577#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22570#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:22,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {22577#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22577#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:22,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {22584#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:22,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {22584#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22584#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:22,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {22591#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22584#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:22,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {22591#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22591#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:22,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {22598#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22591#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:22,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {22598#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22598#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:22,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {22605#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22598#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:22,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {22605#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22605#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:22,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {22612#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22605#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:22,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {22612#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22612#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:22,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {22619#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22612#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:22,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {22619#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22619#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:22,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {22626#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22619#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:22,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {22626#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22626#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:22,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {22633#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22626#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:22,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {22633#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22633#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:22,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {22640#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22633#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:22,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {22640#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22640#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:22,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {22647#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22640#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:22,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {22647#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22647#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:22,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {22654#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22647#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:22,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {22654#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22654#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:22,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {22661#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22654#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:22,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {22661#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22661#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:22,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {22668#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22661#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:22,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {22668#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22668#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:22,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {22675#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22668#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:22,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {22675#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22675#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:22,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {22682#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22675#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:22,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {22682#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22682#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:22,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {22689#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22682#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:22,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {22689#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22689#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:22,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {22696#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22689#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:22,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {22696#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22696#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:22,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {22703#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22696#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:22,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {22703#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22703#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:22,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {22710#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22703#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:22,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {22710#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22710#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:22,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {22717#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:22,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {22717#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22717#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:22,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {22185#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22717#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:22,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-28 02:56:22,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-28 02:56:22,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-28 02:56:22,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {22185#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(12, 2); {22185#true} is VALID [2022-04-28 02:56:22,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {22185#true} call ULTIMATE.init(); {22185#true} is VALID [2022-04-28 02:56:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:22,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034988042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:22,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:22,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 02:56:22,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053611278] [2022-04-28 02:56:22,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053611278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:22,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:22,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 02:56:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077862590] [2022-04-28 02:56:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:22,864 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 02:56:22,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:22,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,915 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 02:56:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 02:56:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 02:56:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 02:56:22,917 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:23,928 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:56:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 02:56:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 02:56:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-28 02:56:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-28 02:56:23,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 90 transitions. [2022-04-28 02:56:23,993 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 02:56:23,994 INFO L225 Difference]: With dead ends: 90 [2022-04-28 02:56:23,994 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 02:56:23,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 02:56:23,995 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:23,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 39 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 02:56:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-28 02:56:24,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:24,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,239 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,239 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,240 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:56:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-28 02:56:24,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 02:56:24,240 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 02:56:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,241 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 02:56:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-28 02:56:24,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:24,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2022-04-28 02:56:24,242 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2022-04-28 02:56:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:24,242 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2022-04-28 02:56:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 83 transitions. [2022-04-28 02:56:24,331 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 02:56:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-28 02:56:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 02:56:24,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:24,332 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:24,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:24,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 02:56:24,532 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2075076320, now seen corresponding path program 69 times [2022-04-28 02:56:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110167960] [2022-04-28 02:56:24,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:24,535 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:24,535 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2075076320, now seen corresponding path program 70 times [2022-04-28 02:56:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:24,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845153594] [2022-04-28 02:56:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {23366#(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(12, 2); {23325#true} is VALID [2022-04-28 02:56:25,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {23325#true} call ULTIMATE.init(); {23366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:25,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {23366#(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(12, 2); {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-28 02:56:25,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {23325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {23330#(= main_~i~0 0)} is VALID [2022-04-28 02:56:25,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {23330#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23330#(= main_~i~0 0)} is VALID [2022-04-28 02:56:25,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {23330#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23331#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {23331#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23331#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {23331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23332#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {23332#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23332#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {23332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23333#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {23333#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23333#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {23333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23334#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {23334#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23334#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {23334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23335#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {23335#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23335#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {23335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23336#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {23336#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23336#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {23336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23337#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {23337#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23337#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {23337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23338#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {23338#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23338#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {23338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23339#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {23339#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23339#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {23339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23340#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {23340#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23340#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {23340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23341#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {23341#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23341#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {23341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23342#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {23342#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23342#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {23342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23343#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {23343#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23343#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {23343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23344#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:25,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {23344#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23344#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:25,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {23344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23345#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:25,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {23345#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23345#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:25,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {23345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23346#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:25,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {23346#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23346#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:25,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {23346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23347#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:25,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {23347#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23347#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:25,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {23347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23348#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:25,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {23348#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23348#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:25,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {23348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23349#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:25,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {23349#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23349#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:25,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {23349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23350#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:25,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {23350#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23350#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:25,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {23350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23351#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:25,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {23351#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23351#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:25,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {23351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23352#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:25,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {23352#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23352#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:25,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {23352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23353#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:25,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {23353#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23353#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:25,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {23353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23354#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:25,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {23354#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23354#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:25,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {23354#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23355#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:25,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {23355#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23355#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:25,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {23355#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23356#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:25,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {23356#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23356#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:25,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {23356#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23357#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:25,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {23357#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:25,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {23357#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23358#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:25,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {23358#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:25,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {23358#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23359#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:25,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {23359#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:25,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {23359#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23360#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:25,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {23360#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:25,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {23360#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23361#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:25,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {23361#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:25,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {23361#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23362#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:25,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {23362#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:25,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {23362#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23363#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:25,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {23363#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:25,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {23363#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23364#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {23364#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {23364#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23365#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {23365#(<= main_~i~0 35)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {23326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {23326#false} is VALID [2022-04-28 02:56:25,041 INFO L272 TraceCheckUtils]: 78: Hoare triple {23326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {23326#false} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-28 02:56:25,041 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-28 02:56:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:25,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845153594] [2022-04-28 02:56:25,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845153594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:25,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577089155] [2022-04-28 02:56:25,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:25,043 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 02:56:25,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:25,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:25,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 02:56:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:25,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {23325#true} call ULTIMATE.init(); {23325#true} is VALID [2022-04-28 02:56:25,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {23325#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(12, 2); {23325#true} is VALID [2022-04-28 02:56:25,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-28 02:56:25,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-28 02:56:25,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-28 02:56:25,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {23325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {23385#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:25,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {23385#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23385#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:25,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {23385#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23331#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {23331#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23331#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {23331#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23332#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {23332#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23332#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {23332#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23333#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {23333#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23333#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {23333#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23334#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {23334#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23334#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {23334#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23335#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {23335#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23335#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {23335#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23336#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {23336#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23336#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {23336#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23337#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {23337#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23337#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {23337#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23338#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {23338#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23338#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {23338#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23339#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {23339#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23339#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {23339#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23340#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {23340#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23340#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {23340#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23341#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {23341#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23341#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {23341#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23342#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {23342#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23342#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {23342#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23343#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {23343#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23343#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {23343#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23344#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:25,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {23344#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23344#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:25,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {23344#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23345#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:25,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {23345#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23345#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:25,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {23345#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23346#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:25,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {23346#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23346#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:25,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {23346#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23347#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:25,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {23347#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23347#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:25,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {23347#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23348#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:25,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {23348#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23348#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:25,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {23348#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23349#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:25,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {23349#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23349#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:25,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {23349#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23350#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:25,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {23350#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23350#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:25,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {23350#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23351#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:25,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {23351#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23351#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {23351#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23352#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {23352#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23352#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {23352#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23353#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {23353#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23353#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {23353#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23354#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {23354#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23354#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {23354#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23355#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {23355#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23355#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {23355#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23356#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {23356#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23356#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 59: Hoare triple {23356#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23357#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {23357#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {23357#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23358#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {23358#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:25,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {23358#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23359#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:25,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {23359#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:25,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {23359#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23360#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:25,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {23360#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:25,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {23360#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23361#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:25,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {23361#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:25,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {23361#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23362#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:25,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {23362#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:25,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {23362#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23363#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:25,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {23363#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:25,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {23363#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23364#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {23364#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 75: Hoare triple {23364#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23365#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 76: Hoare triple {23365#(<= main_~i~0 35)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {23326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {23326#false} is VALID [2022-04-28 02:56:25,664 INFO L272 TraceCheckUtils]: 78: Hoare triple {23326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {23326#false} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-28 02:56:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:25,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:27,159 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-28 02:56:27,159 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-28 02:56:27,159 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-28 02:56:27,159 INFO L272 TraceCheckUtils]: 78: Hoare triple {23326#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {23326#false} is VALID [2022-04-28 02:56:27,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {23326#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {23326#false} is VALID [2022-04-28 02:56:27,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {23629#(< main_~i~0 2048)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-28 02:56:27,160 INFO L290 TraceCheckUtils]: 75: Hoare triple {23633#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23629#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:27,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {23633#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23633#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:27,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {23640#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23633#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:27,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {23640#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23640#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:27,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {23647#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23640#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:27,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {23647#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23647#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:27,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {23654#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23647#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:27,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {23654#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23654#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:27,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {23661#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23654#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:27,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {23661#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23661#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:27,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {23668#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23661#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:27,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {23668#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23668#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:27,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {23675#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23668#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:27,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {23675#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23675#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:27,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {23682#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23675#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:27,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {23682#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23682#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:27,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {23689#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23682#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:27,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {23689#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23689#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:27,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {23696#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:27,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {23696#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23696#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:27,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {23703#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23696#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:27,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {23703#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23703#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:27,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {23710#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23703#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:27,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {23710#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23710#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:27,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {23717#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23710#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:27,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {23717#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23717#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:27,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {23724#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23717#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:27,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {23724#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23724#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:27,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {23731#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23724#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:27,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {23731#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23731#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:27,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {23738#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23731#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:27,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {23738#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23738#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:27,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {23745#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23738#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:27,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {23745#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23745#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:27,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {23752#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23745#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:27,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {23752#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23752#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:27,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {23759#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23752#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:27,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {23759#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23759#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:27,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {23766#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23759#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:27,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {23766#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23766#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:27,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {23773#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23766#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:27,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {23773#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23773#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:27,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {23780#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23773#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:27,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {23780#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23780#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:27,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {23787#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23780#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:27,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {23787#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23787#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:27,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {23794#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23787#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:27,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {23794#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23794#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:27,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {23801#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23794#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:27,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {23801#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23801#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:27,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {23808#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23801#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:27,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {23808#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23808#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:27,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {23815#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23808#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:27,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {23815#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23815#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:27,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {23822#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23815#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:27,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {23822#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23822#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:27,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {23829#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23822#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:27,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {23829#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23829#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:27,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {23836#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23829#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:27,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {23836#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23836#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:27,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {23843#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23836#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:27,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {23843#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23843#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:27,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {23850#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23843#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:27,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {23850#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23850#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:27,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {23857#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23850#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:27,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {23857#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23857#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:27,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {23864#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23857#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:27,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {23864#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23864#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:27,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {23871#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23864#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:27,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {23871#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23871#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:27,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {23325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {23871#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:27,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-28 02:56:27,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-28 02:56:27,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-28 02:56:27,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {23325#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(12, 2); {23325#true} is VALID [2022-04-28 02:56:27,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {23325#true} call ULTIMATE.init(); {23325#true} is VALID [2022-04-28 02:56:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577089155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:27,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:27,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 02:56:27,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110167960] [2022-04-28 02:56:27,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110167960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:27,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:27,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 02:56:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681048045] [2022-04-28 02:56:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:27,185 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 02:56:27,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:27,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:27,235 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 02:56:27,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 02:56:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 02:56:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:56:27,236 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,228 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:56:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 02:56:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 02:56:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-28 02:56:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-28 02:56:28,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 92 transitions. [2022-04-28 02:56:28,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:28,290 INFO L225 Difference]: With dead ends: 92 [2022-04-28 02:56:28,290 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 02:56:28,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5478, Invalid=6954, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 02:56:28,292 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:28,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 29 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 02:56:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-28 02:56:28,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:28,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,543 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,543 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,544 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:56:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-28 02:56:28,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:28,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:28,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:56:28,545 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:56:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,545 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 02:56:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-28 02:56:28,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:28,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:28,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:28,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2022-04-28 02:56:28,546 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2022-04-28 02:56:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:28,546 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2022-04-28 02:56:28,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 38 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 85 transitions. [2022-04-28 02:56:28,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-28 02:56:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 02:56:28,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:28,629 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:28,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:28,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 02:56:28,829 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 409430786, now seen corresponding path program 71 times [2022-04-28 02:56:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635266724] [2022-04-28 02:56:28,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:28,832 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:28,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 409430786, now seen corresponding path program 72 times [2022-04-28 02:56:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978411086] [2022-04-28 02:56:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {24535#(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(12, 2); {24493#true} is VALID [2022-04-28 02:56:29,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-28 02:56:29,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-28 02:56:29,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {24493#true} call ULTIMATE.init(); {24535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:29,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {24535#(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(12, 2); {24493#true} is VALID [2022-04-28 02:56:29,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-28 02:56:29,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-28 02:56:29,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-28 02:56:29,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {24493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24498#(= main_~i~0 0)} is VALID [2022-04-28 02:56:29,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {24498#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24498#(= main_~i~0 0)} is VALID [2022-04-28 02:56:29,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {24498#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24499#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:29,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {24499#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24499#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:29,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {24499#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24500#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:29,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {24500#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24500#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:29,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {24500#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24501#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:29,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {24501#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24501#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:29,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {24501#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24502#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:29,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {24502#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24502#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:29,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {24502#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24503#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:29,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {24503#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24503#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:29,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {24503#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24504#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:29,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {24504#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24504#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:29,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {24504#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24505#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:29,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {24505#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24505#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:29,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {24505#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24506#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:29,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {24506#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24506#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:29,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {24506#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24507#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:29,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {24507#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24507#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:29,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {24507#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24508#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:29,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {24508#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24508#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:29,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {24508#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24509#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:29,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {24509#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24509#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:29,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {24509#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24510#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:29,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {24510#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24510#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:29,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {24510#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24511#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:29,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {24511#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24511#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:29,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {24511#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24512#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:29,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {24512#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24512#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:29,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {24512#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24513#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:29,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {24513#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24513#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:29,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {24513#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24514#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:29,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {24514#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24514#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:29,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {24514#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24515#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:29,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {24515#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24515#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:29,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {24515#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24516#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:29,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {24516#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24516#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:29,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {24516#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24517#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:29,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {24517#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24517#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:29,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {24517#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24518#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:29,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {24518#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24518#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:29,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {24518#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24519#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:29,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {24519#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24519#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:29,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {24519#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24520#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:29,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {24520#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24520#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:29,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {24520#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24521#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:29,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {24521#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24521#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:29,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {24521#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24522#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:29,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {24522#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24522#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:29,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {24522#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24523#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:29,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {24523#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24523#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:29,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {24523#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24524#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:29,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {24524#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24524#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:29,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {24524#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24525#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:29,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {24525#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24525#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:29,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {24525#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24526#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:29,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {24526#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24526#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:29,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {24526#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24527#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:29,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {24527#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24527#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:29,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {24527#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24528#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:29,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {24528#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24528#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:29,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {24528#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24529#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:29,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {24529#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24529#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:29,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {24529#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24530#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:29,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {24530#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24530#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:29,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {24530#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24531#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:29,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {24531#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24531#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:29,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {24531#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24532#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:29,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {24532#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24532#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:29,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {24532#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24533#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:29,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {24533#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24533#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {24533#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24534#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {24534#(<= main_~i~0 36)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {24494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24494#false} is VALID [2022-04-28 02:56:29,385 INFO L272 TraceCheckUtils]: 80: Hoare triple {24494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {24494#false} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-28 02:56:29,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-28 02:56:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978411086] [2022-04-28 02:56:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978411086] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123764599] [2022-04-28 02:56:29,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:29,387 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:29,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 02:56:39,778 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-28 02:56:39,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:39,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 02:56:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:40,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {24493#true} call ULTIMATE.init(); {24493#true} is VALID [2022-04-28 02:56:40,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {24493#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(12, 2); {24493#true} is VALID [2022-04-28 02:56:40,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-28 02:56:40,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-28 02:56:40,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-28 02:56:40,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {24493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24554#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:40,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {24554#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24554#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:40,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {24554#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24499#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:40,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {24499#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24499#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:40,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {24499#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24500#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:40,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {24500#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24500#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:40,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {24500#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24501#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:40,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {24501#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24501#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:40,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {24501#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24502#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:40,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {24502#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24502#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:40,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {24502#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24503#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:40,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {24503#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24503#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:40,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {24503#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24504#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:40,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {24504#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24504#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:40,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {24504#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24505#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:40,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {24505#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24505#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:40,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {24505#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24506#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:40,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {24506#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24506#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:40,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {24506#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24507#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:40,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {24507#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24507#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:40,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {24507#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24508#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:40,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {24508#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24508#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:40,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {24508#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24509#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:40,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {24509#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24509#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:40,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {24509#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24510#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:40,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {24510#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24510#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:40,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {24510#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24511#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:40,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {24511#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24511#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:40,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {24511#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24512#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:40,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {24512#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24512#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:40,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {24512#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24513#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:40,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {24513#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24513#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:40,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {24513#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24514#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:40,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {24514#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24514#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:40,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {24514#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24515#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:40,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {24515#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24515#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:40,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {24515#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24516#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:40,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {24516#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24516#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:40,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {24516#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24517#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:40,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {24517#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24517#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:40,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {24517#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24518#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:40,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {24518#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24518#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:40,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {24518#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24519#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:40,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {24519#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24519#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:40,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {24519#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24520#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:40,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {24520#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24520#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:40,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {24520#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24521#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:40,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {24521#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24521#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:40,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {24521#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24522#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:40,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {24522#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24522#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:40,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {24522#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24523#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:40,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {24523#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24523#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:40,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {24523#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24524#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:40,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {24524#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24524#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:40,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {24524#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24525#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:40,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {24525#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24525#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:40,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {24525#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24526#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:40,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {24526#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24526#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:40,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {24526#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24527#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:40,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {24527#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24527#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:40,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {24527#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24528#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:40,277 INFO L290 TraceCheckUtils]: 66: Hoare triple {24528#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24528#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:40,277 INFO L290 TraceCheckUtils]: 67: Hoare triple {24528#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24529#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:40,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {24529#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24529#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:40,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {24529#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24530#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:40,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {24530#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24530#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:40,278 INFO L290 TraceCheckUtils]: 71: Hoare triple {24530#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24531#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:40,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {24531#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24531#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:40,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {24531#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24532#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:40,279 INFO L290 TraceCheckUtils]: 74: Hoare triple {24532#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24532#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:40,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {24532#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24533#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:40,280 INFO L290 TraceCheckUtils]: 76: Hoare triple {24533#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24533#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:40,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {24533#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24534#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:40,281 INFO L290 TraceCheckUtils]: 78: Hoare triple {24534#(<= main_~i~0 36)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {24494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L272 TraceCheckUtils]: 80: Hoare triple {24494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-28 02:56:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:40,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:41,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-28 02:56:41,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-28 02:56:41,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-28 02:56:41,862 INFO L272 TraceCheckUtils]: 80: Hoare triple {24494#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {24494#false} is VALID [2022-04-28 02:56:41,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {24494#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24494#false} is VALID [2022-04-28 02:56:41,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {24804#(< main_~i~0 2048)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-28 02:56:41,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {24808#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24804#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:41,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {24808#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24808#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:41,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {24815#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24808#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:41,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {24815#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24815#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:41,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24815#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:41,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {24822#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24822#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:41,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {24829#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24822#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:41,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {24829#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24829#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:41,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {24836#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24829#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:41,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {24836#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24836#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:41,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {24843#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24836#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:41,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {24843#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24843#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:41,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {24850#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24843#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:41,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {24850#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24850#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:41,867 INFO L290 TraceCheckUtils]: 63: Hoare triple {24857#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24850#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:41,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {24857#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24857#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:41,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24857#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:41,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24864#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:41,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {24871#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24864#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:41,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {24871#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24871#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:41,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {24878#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24871#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:41,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {24878#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24878#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:41,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {24885#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24878#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:41,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {24885#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24885#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:41,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {24892#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24885#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:41,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {24892#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24892#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:41,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {24899#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24892#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:41,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {24899#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24899#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:41,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {24906#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24899#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:41,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {24906#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24906#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:41,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {24913#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24906#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:41,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {24913#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24913#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:41,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {24920#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24913#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:41,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {24920#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24920#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:41,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {24927#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24920#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:41,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {24927#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24927#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:41,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {24934#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24927#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:41,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {24934#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24934#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:41,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {24941#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24934#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:41,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {24941#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24941#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:41,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {24948#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24941#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:41,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {24948#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24948#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:41,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {24955#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24948#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:41,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {24955#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24955#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:41,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {24962#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24955#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:41,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {24962#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24962#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:41,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {24969#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24962#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:41,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {24969#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24969#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:41,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {24976#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:41,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {24976#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24976#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:41,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {24983#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24976#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:41,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {24983#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24983#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:41,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {24990#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24983#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:41,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {24990#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24990#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:41,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {24997#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24990#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:41,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {24997#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24997#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:41,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {25004#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24997#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:41,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {25004#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25004#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:41,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {25011#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25004#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:41,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {25011#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25011#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:41,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {25018#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25011#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:41,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {25018#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25018#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:41,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {25025#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25018#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:41,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {25025#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25025#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:41,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {25032#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25025#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:41,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {25032#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25032#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:41,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {25039#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25032#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:41,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {25039#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25039#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:41,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {25046#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25039#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:41,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {25046#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25046#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:41,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {25053#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25046#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:41,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {25053#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25053#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:41,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {24493#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25053#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:41,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-28 02:56:41,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-28 02:56:41,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-28 02:56:41,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {24493#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(12, 2); {24493#true} is VALID [2022-04-28 02:56:41,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {24493#true} call ULTIMATE.init(); {24493#true} is VALID [2022-04-28 02:56:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123764599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:41,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:41,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-28 02:56:41,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635266724] [2022-04-28 02:56:41,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635266724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:41,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:41,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 02:56:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288318810] [2022-04-28 02:56:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 02:56:41,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:41,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:41,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:41,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 02:56:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 02:56:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 02:56:41,935 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,968 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:56:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 02:56:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 02:56:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-28 02:56:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-28 02:56:42,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 94 transitions. [2022-04-28 02:56:43,031 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 02:56:43,032 INFO L225 Difference]: With dead ends: 94 [2022-04-28 02:56:43,032 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 02:56:43,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 02:56:43,034 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:43,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 34 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 02:56:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-28 02:56:43,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:43,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,301 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:43,302 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:56:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-28 02:56:43,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:43,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:43,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 02:56:43,302 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 02:56:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:43,303 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 02:56:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-28 02:56:43,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:43,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:43,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:43,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-04-28 02:56:43,304 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2022-04-28 02:56:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-04-28 02:56:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 87 transitions. [2022-04-28 02:56:43,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-28 02:56:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 02:56:43,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:43,408 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:43,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:43,608 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1746874020, now seen corresponding path program 73 times [2022-04-28 02:56:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:43,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239762619] [2022-04-28 02:56:43,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:43,611 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:43,611 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1746874020, now seen corresponding path program 74 times [2022-04-28 02:56:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:43,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388591635] [2022-04-28 02:56:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {25732#(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(12, 2); {25689#true} is VALID [2022-04-28 02:56:44,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-28 02:56:44,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-28 02:56:44,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {25689#true} call ULTIMATE.init(); {25732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:44,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {25732#(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(12, 2); {25689#true} is VALID [2022-04-28 02:56:44,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-28 02:56:44,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-28 02:56:44,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-28 02:56:44,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {25689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25694#(= main_~i~0 0)} is VALID [2022-04-28 02:56:44,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {25694#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25694#(= main_~i~0 0)} is VALID [2022-04-28 02:56:44,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {25694#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25695#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:44,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {25695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25695#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:44,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {25695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25696#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:44,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {25696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25696#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:44,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {25696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25697#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:44,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {25697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25697#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:44,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {25697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25698#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:44,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {25698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25698#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:44,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {25698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25699#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:44,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {25699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25699#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:44,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {25699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25700#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:44,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {25700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25700#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:44,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {25700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25701#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:44,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {25701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25701#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:44,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {25701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25702#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:44,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {25702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25702#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:44,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {25702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25703#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:44,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {25703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25703#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:44,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {25703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25704#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:44,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {25704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25704#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:44,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {25704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25705#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:44,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {25705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25705#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:44,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {25705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25706#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:44,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {25706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25706#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:44,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {25706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25707#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:44,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {25707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25707#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:44,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {25707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25708#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:44,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {25708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25708#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:44,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {25708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25709#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:44,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {25709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25709#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:44,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {25709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25710#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:44,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {25710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25710#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:44,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {25710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25711#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:44,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {25711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25711#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:44,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {25711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25712#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:44,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {25712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25712#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:44,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {25712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25713#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:44,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {25713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25713#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:44,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {25713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25714#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:44,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {25714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25714#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:44,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {25714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25715#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:44,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {25715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25715#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:44,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {25715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25716#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:44,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {25716#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25716#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:44,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {25716#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25717#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:44,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {25717#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25717#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:44,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {25717#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25718#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:44,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {25718#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25718#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:44,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {25718#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25719#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:44,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {25719#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25719#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:44,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {25719#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25720#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:44,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {25720#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25720#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:44,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {25720#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25721#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:44,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {25721#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25721#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:44,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {25721#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25722#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:44,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {25722#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25722#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:44,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {25722#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25723#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:44,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {25723#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25723#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:44,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {25723#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25724#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:44,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {25724#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25724#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:44,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {25724#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25725#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:44,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {25725#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25725#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:44,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {25725#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25726#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:44,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {25726#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25726#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:44,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {25726#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25727#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:44,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {25727#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25727#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:44,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {25727#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25728#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:44,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {25728#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25728#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:44,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {25728#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25729#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:44,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {25729#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25729#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:44,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {25729#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25730#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:44,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {25730#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25730#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {25730#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25731#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {25731#(<= main_~i~0 37)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {25690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25690#false} is VALID [2022-04-28 02:56:44,211 INFO L272 TraceCheckUtils]: 82: Hoare triple {25690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {25690#false} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-28 02:56:44,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-28 02:56:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388591635] [2022-04-28 02:56:44,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388591635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930158760] [2022-04-28 02:56:44,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:44,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:44,213 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:44,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 02:56:44,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:44,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:44,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 02:56:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:44,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:44,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {25689#true} call ULTIMATE.init(); {25689#true} is VALID [2022-04-28 02:56:44,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {25689#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(12, 2); {25689#true} is VALID [2022-04-28 02:56:44,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-28 02:56:44,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-28 02:56:44,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-28 02:56:44,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {25689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25751#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:44,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {25751#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25751#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:44,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {25751#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25695#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:44,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {25695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25695#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:44,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {25695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25696#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:44,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {25696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25696#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:44,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {25696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25697#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:44,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {25697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25697#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:44,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {25697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25698#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:44,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {25698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25698#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:44,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {25698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25699#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:44,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {25699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25699#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:44,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {25699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25700#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:44,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {25700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25700#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:44,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {25700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25701#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:44,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {25701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25701#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:44,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {25701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25702#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:44,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {25702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25702#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:44,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {25702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25703#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:44,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {25703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25703#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:44,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {25703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25704#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:44,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {25704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25704#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:44,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {25704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25705#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:44,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {25705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25705#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:44,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {25705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25706#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:44,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {25706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25706#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:44,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {25706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25707#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:44,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {25707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25707#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:44,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {25707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25708#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:44,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {25708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25708#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:44,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {25708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25709#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:44,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {25709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25709#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:44,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {25709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25710#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:44,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {25710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25710#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:44,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {25710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25711#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:44,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {25711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25711#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:44,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {25711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25712#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:44,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {25712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25712#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:44,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {25712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25713#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:44,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {25713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25713#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:44,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {25713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25714#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:44,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {25714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25714#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:44,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {25714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25715#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:44,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {25715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25715#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:44,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {25715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25716#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:44,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {25716#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25716#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:44,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {25716#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25717#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:44,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {25717#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25717#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:44,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {25717#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25718#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:44,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {25718#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25718#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:44,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {25718#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25719#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:44,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {25719#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25719#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:44,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {25719#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25720#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:44,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {25720#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25720#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:44,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {25720#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25721#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:44,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {25721#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25721#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:44,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {25721#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25722#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:44,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {25722#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25722#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:44,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {25722#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25723#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:44,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {25723#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25723#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:44,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {25723#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25724#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:44,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {25724#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25724#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:44,888 INFO L290 TraceCheckUtils]: 67: Hoare triple {25724#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25725#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:44,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {25725#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25725#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:44,889 INFO L290 TraceCheckUtils]: 69: Hoare triple {25725#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25726#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:44,889 INFO L290 TraceCheckUtils]: 70: Hoare triple {25726#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25726#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:44,889 INFO L290 TraceCheckUtils]: 71: Hoare triple {25726#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25727#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:44,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {25727#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25727#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:44,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {25727#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25728#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:44,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {25728#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25728#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:44,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {25728#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25729#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:44,891 INFO L290 TraceCheckUtils]: 76: Hoare triple {25729#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25729#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:44,891 INFO L290 TraceCheckUtils]: 77: Hoare triple {25729#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25730#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:44,891 INFO L290 TraceCheckUtils]: 78: Hoare triple {25730#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25730#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {25730#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25731#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {25731#(<= main_~i~0 37)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 81: Hoare triple {25690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25690#false} is VALID [2022-04-28 02:56:44,892 INFO L272 TraceCheckUtils]: 82: Hoare triple {25690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {25690#false} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-28 02:56:44,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-28 02:56:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:44,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:46,550 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L272 TraceCheckUtils]: 82: Hoare triple {25690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {25690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {26007#(< main_~i~0 2048)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-28 02:56:46,551 INFO L290 TraceCheckUtils]: 79: Hoare triple {26011#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26007#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:46,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {26011#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26011#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:46,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {26018#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26011#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:46,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {26018#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26018#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:46,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {26025#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26018#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:46,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {26025#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26025#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:46,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {26032#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26025#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:46,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {26032#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26032#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:46,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {26039#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:46,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {26039#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26039#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:46,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {26046#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:46,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {26046#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26046#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:46,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {26053#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:46,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {26053#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26053#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:46,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {26060#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:46,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {26060#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26060#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:46,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {26067#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26060#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:46,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {26067#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26067#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:46,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {26074#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26067#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:46,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {26074#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26074#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:46,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {26081#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26074#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:46,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {26081#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26081#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:46,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {26088#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26081#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:46,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {26088#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26088#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:46,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {26095#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26088#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:46,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {26095#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26095#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:46,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {26102#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26095#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:46,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {26102#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26102#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:46,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {26109#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26102#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:46,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {26109#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26109#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:46,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {26116#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26109#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:46,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {26116#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26116#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:46,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {26123#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26116#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:46,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {26123#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26123#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:46,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {26130#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26123#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:46,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {26130#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26130#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:46,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {26137#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:46,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {26137#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26137#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:46,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {26144#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:46,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {26144#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26144#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:46,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {26151#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:46,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {26151#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26151#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:46,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {26158#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:46,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {26158#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26158#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:46,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {26165#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26158#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:46,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {26165#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26165#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:46,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {26172#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26165#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:46,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {26172#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26172#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:46,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {26179#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26172#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:46,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {26179#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26179#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:46,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {26186#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26179#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:46,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {26186#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26186#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:46,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {26193#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26186#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:46,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {26193#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26193#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:46,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {26200#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26193#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:46,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {26200#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26200#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:46,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {26207#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26200#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:46,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {26207#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26207#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:46,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {26214#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26207#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:46,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {26214#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26214#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:46,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {26221#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26214#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:46,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {26221#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26221#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:46,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {26228#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26221#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:46,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {26228#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26228#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:46,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {26235#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26228#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:46,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {26235#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26235#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:46,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {26242#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26235#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:46,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {26242#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26242#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:46,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {26249#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:46,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {26249#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26249#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:46,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {26256#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26249#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:46,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {26256#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26256#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:46,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {26263#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26256#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:46,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {26263#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26263#(< main_~i~0 2011)} is VALID [2022-04-28 02:56:46,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {25689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26263#(< main_~i~0 2011)} is VALID [2022-04-28 02:56:46,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-28 02:56:46,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-28 02:56:46,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-28 02:56:46,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {25689#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(12, 2); {25689#true} is VALID [2022-04-28 02:56:46,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {25689#true} call ULTIMATE.init(); {25689#true} is VALID [2022-04-28 02:56:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:46,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930158760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:46,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:46,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-28 02:56:46,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239762619] [2022-04-28 02:56:46,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239762619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 02:56:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40145335] [2022-04-28 02:56:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 02:56:46,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:46,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,626 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 02:56:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 02:56:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 02:56:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 02:56:46,627 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:47,726 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:56:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 02:56:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 02:56:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-28 02:56:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-28 02:56:47,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 96 transitions. [2022-04-28 02:56:47,791 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 02:56:47,792 INFO L225 Difference]: With dead ends: 96 [2022-04-28 02:56:47,792 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 02:56:47,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 02:56:47,794 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:47,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 34 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 02:56:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 02:56:48,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:48,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,073 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,073 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:48,074 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:56:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-28 02:56:48,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:48,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:48,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:56:48,074 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 02:56:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:48,075 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 02:56:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-28 02:56:48,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:48,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:48,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:48,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-04-28 02:56:48,076 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2022-04-28 02:56:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:48,076 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-04-28 02:56:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 89 transitions. [2022-04-28 02:56:48,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-28 02:56:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 02:56:48,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:48,187 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:48,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:48,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 02:56:48,388 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1460366906, now seen corresponding path program 75 times [2022-04-28 02:56:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:48,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908138695] [2022-04-28 02:56:48,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:48,390 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:48,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1460366906, now seen corresponding path program 76 times [2022-04-28 02:56:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:48,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77928292] [2022-04-28 02:56:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:48,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {26957#(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(12, 2); {26913#true} is VALID [2022-04-28 02:56:48,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-28 02:56:48,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-28 02:56:48,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:48,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {26957#(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(12, 2); {26913#true} is VALID [2022-04-28 02:56:48,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-28 02:56:48,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-28 02:56:48,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-28 02:56:48,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {26913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26918#(= main_~i~0 0)} is VALID [2022-04-28 02:56:48,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {26918#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26918#(= main_~i~0 0)} is VALID [2022-04-28 02:56:48,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {26918#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26919#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:48,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {26919#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26919#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:48,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {26919#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26920#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:48,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {26920#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26920#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:48,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {26920#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26921#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:48,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {26921#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26921#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:48,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {26921#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26922#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:48,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {26922#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26922#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:48,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {26922#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26923#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:48,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {26923#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26923#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:48,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {26923#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26924#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:48,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {26924#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26924#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:48,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {26924#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26925#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:48,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {26925#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26925#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:48,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {26925#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26926#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:48,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {26926#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26926#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:48,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {26926#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26927#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:48,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {26927#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26927#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:48,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {26927#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26928#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:48,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {26928#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26928#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:48,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {26928#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26929#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:48,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {26929#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26929#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:48,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {26929#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26930#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:48,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {26930#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26930#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:48,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {26930#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26931#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:48,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {26931#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26931#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:48,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {26931#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26932#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:48,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {26932#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26932#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:48,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {26932#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26933#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:48,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {26933#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26933#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:48,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {26933#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26934#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:48,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {26934#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26934#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:48,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {26934#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26935#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:48,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {26935#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26935#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:48,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {26935#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26936#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:48,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {26936#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26936#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:48,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {26936#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26937#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:48,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {26937#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26937#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:48,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {26937#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26938#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:48,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {26938#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26938#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:48,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {26938#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26939#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:48,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {26939#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26939#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:48,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {26939#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26940#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:48,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {26940#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26940#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:48,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {26940#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26941#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:48,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {26941#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26941#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:48,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {26941#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26942#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:48,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {26942#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26942#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:48,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {26942#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26943#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:48,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {26943#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26943#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:48,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {26943#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26944#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:48,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {26944#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26944#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:48,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {26944#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26945#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:48,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {26945#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26945#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:48,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {26945#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26946#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:48,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {26946#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26946#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:48,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {26946#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26947#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:48,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {26947#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26947#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:48,990 INFO L290 TraceCheckUtils]: 65: Hoare triple {26947#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26948#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:48,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {26948#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26948#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:48,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {26948#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26949#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:48,991 INFO L290 TraceCheckUtils]: 68: Hoare triple {26949#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26949#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:48,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {26949#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26950#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:48,992 INFO L290 TraceCheckUtils]: 70: Hoare triple {26950#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26950#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:48,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {26950#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26951#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:48,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {26951#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26951#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:48,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {26951#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26952#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:48,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {26952#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26952#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:48,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {26952#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26953#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:48,993 INFO L290 TraceCheckUtils]: 76: Hoare triple {26953#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26953#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:48,994 INFO L290 TraceCheckUtils]: 77: Hoare triple {26953#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26954#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:48,994 INFO L290 TraceCheckUtils]: 78: Hoare triple {26954#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26954#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:48,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {26954#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26955#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:48,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {26955#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26955#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 81: Hoare triple {26955#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26956#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {26956#(<= main_~i~0 38)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 83: Hoare triple {26914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26914#false} is VALID [2022-04-28 02:56:48,995 INFO L272 TraceCheckUtils]: 84: Hoare triple {26914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {26914#false} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-28 02:56:48,995 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-28 02:56:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:48,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77928292] [2022-04-28 02:56:48,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77928292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:48,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478561776] [2022-04-28 02:56:48,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:48,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:48,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:48,997 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:48,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 02:56:49,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:49,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:49,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 02:56:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:49,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:49,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26913#true} is VALID [2022-04-28 02:56:49,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {26913#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(12, 2); {26913#true} is VALID [2022-04-28 02:56:49,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-28 02:56:49,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-28 02:56:49,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-28 02:56:49,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {26913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26976#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:49,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {26976#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26976#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:49,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {26976#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26919#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {26919#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26919#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {26919#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26920#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {26920#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26920#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {26920#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26921#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {26921#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26921#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {26921#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26922#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {26922#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26922#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {26922#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26923#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {26923#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26923#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {26923#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26924#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {26924#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26924#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {26924#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26925#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {26925#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26925#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {26925#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26926#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {26926#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26926#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {26926#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26927#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {26927#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26927#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {26927#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26928#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {26928#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26928#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {26928#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26929#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {26929#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26929#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {26929#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26930#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {26930#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26930#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {26930#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26931#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {26931#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26931#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {26931#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26932#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {26932#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26932#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {26932#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26933#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {26933#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26933#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {26933#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26934#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {26934#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26934#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {26934#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26935#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {26935#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26935#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {26935#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26936#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {26936#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26936#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {26936#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26937#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {26937#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26937#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {26937#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26938#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {26938#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26938#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {26938#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26939#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {26939#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26939#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {26939#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26940#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:49,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {26940#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26940#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:49,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {26940#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26941#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:49,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {26941#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26941#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:49,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {26941#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26942#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:49,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {26942#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26942#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:49,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {26942#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26943#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:49,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {26943#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26943#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:49,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {26943#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26944#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:49,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {26944#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26944#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:49,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {26944#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26945#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:49,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {26945#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26945#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:49,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {26945#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26946#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:49,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {26946#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26946#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:49,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {26946#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26947#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:49,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {26947#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26947#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:49,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {26947#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26948#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:49,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {26948#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26948#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:49,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {26948#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26949#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:49,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {26949#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26949#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:49,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {26949#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26950#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:49,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {26950#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26950#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:49,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {26950#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26951#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:49,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {26951#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26951#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:49,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {26951#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26952#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:49,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {26952#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26952#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:49,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {26952#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26953#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:49,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {26953#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26953#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:49,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {26953#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26954#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:49,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {26954#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26954#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:49,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {26954#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26955#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:49,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {26955#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26955#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:49,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {26955#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26956#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:49,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {26956#(<= main_~i~0 38)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {26914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L272 TraceCheckUtils]: 84: Hoare triple {26914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-28 02:56:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:49,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:51,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-28 02:56:51,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-28 02:56:51,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-28 02:56:51,484 INFO L272 TraceCheckUtils]: 84: Hoare triple {26914#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {26914#false} is VALID [2022-04-28 02:56:51,485 INFO L290 TraceCheckUtils]: 83: Hoare triple {26914#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26914#false} is VALID [2022-04-28 02:56:51,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {27238#(< main_~i~0 2048)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-28 02:56:51,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {27242#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27238#(< main_~i~0 2048)} is VALID [2022-04-28 02:56:51,486 INFO L290 TraceCheckUtils]: 80: Hoare triple {27242#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27242#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:51,486 INFO L290 TraceCheckUtils]: 79: Hoare triple {27249#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27242#(< main_~i~0 2047)} is VALID [2022-04-28 02:56:51,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {27249#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27249#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:51,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {27256#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27249#(< main_~i~0 2046)} is VALID [2022-04-28 02:56:51,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {27256#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27256#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:51,488 INFO L290 TraceCheckUtils]: 75: Hoare triple {27263#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27256#(< main_~i~0 2045)} is VALID [2022-04-28 02:56:51,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {27263#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27263#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:51,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {27270#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27263#(< main_~i~0 2044)} is VALID [2022-04-28 02:56:51,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {27270#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27270#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:51,489 INFO L290 TraceCheckUtils]: 71: Hoare triple {27277#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27270#(< main_~i~0 2043)} is VALID [2022-04-28 02:56:51,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {27277#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27277#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:51,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {27284#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27277#(< main_~i~0 2042)} is VALID [2022-04-28 02:56:51,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {27284#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27284#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:51,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {27291#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27284#(< main_~i~0 2041)} is VALID [2022-04-28 02:56:51,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {27291#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27291#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:51,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {27298#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27291#(< main_~i~0 2040)} is VALID [2022-04-28 02:56:51,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {27298#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27298#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:51,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {27305#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27298#(< main_~i~0 2039)} is VALID [2022-04-28 02:56:51,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {27305#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27305#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:51,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {27312#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27305#(< main_~i~0 2038)} is VALID [2022-04-28 02:56:51,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {27312#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27312#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:51,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {27319#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27312#(< main_~i~0 2037)} is VALID [2022-04-28 02:56:51,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {27319#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27319#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:51,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {27326#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27319#(< main_~i~0 2036)} is VALID [2022-04-28 02:56:51,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {27326#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27326#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:51,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {27333#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27326#(< main_~i~0 2035)} is VALID [2022-04-28 02:56:51,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {27333#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27333#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:51,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {27340#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27333#(< main_~i~0 2034)} is VALID [2022-04-28 02:56:51,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {27340#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27340#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:51,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {27347#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27340#(< main_~i~0 2033)} is VALID [2022-04-28 02:56:51,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {27347#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27347#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:51,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {27354#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27347#(< main_~i~0 2032)} is VALID [2022-04-28 02:56:51,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {27354#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27354#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:51,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {27361#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27354#(< main_~i~0 2031)} is VALID [2022-04-28 02:56:51,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {27361#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27361#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:51,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {27368#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27361#(< main_~i~0 2030)} is VALID [2022-04-28 02:56:51,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {27368#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27368#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:51,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {27375#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27368#(< main_~i~0 2029)} is VALID [2022-04-28 02:56:51,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {27375#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27375#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:51,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {27382#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27375#(< main_~i~0 2028)} is VALID [2022-04-28 02:56:51,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {27382#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27382#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:51,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {27389#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27382#(< main_~i~0 2027)} is VALID [2022-04-28 02:56:51,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {27389#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27389#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:51,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {27396#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27389#(< main_~i~0 2026)} is VALID [2022-04-28 02:56:51,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {27396#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27396#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:51,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {27403#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27396#(< main_~i~0 2025)} is VALID [2022-04-28 02:56:51,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {27403#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27403#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:51,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {27410#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27403#(< main_~i~0 2024)} is VALID [2022-04-28 02:56:51,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {27410#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27410#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:51,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {27417#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27410#(< main_~i~0 2023)} is VALID [2022-04-28 02:56:51,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {27417#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27417#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:51,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {27424#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27417#(< main_~i~0 2022)} is VALID [2022-04-28 02:56:51,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {27424#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27424#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:51,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {27431#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27424#(< main_~i~0 2021)} is VALID [2022-04-28 02:56:51,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {27431#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27431#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:51,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {27438#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27431#(< main_~i~0 2020)} is VALID [2022-04-28 02:56:51,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {27438#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27438#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:51,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {27445#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27438#(< main_~i~0 2019)} is VALID [2022-04-28 02:56:51,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {27445#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27445#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:51,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {27452#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27445#(< main_~i~0 2018)} is VALID [2022-04-28 02:56:51,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {27452#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27452#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:51,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {27459#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27452#(< main_~i~0 2017)} is VALID [2022-04-28 02:56:51,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {27459#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27459#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:51,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {27466#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27459#(< main_~i~0 2016)} is VALID [2022-04-28 02:56:51,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {27466#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27466#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:51,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {27473#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27466#(< main_~i~0 2015)} is VALID [2022-04-28 02:56:51,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {27473#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27473#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:51,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {27480#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27473#(< main_~i~0 2014)} is VALID [2022-04-28 02:56:51,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {27480#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27480#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:51,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {27487#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27480#(< main_~i~0 2013)} is VALID [2022-04-28 02:56:51,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {27487#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27487#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:51,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {27494#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27487#(< main_~i~0 2012)} is VALID [2022-04-28 02:56:51,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {27494#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27494#(< main_~i~0 2011)} is VALID [2022-04-28 02:56:51,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {27501#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27494#(< main_~i~0 2011)} is VALID [2022-04-28 02:56:51,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {27501#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27501#(< main_~i~0 2010)} is VALID [2022-04-28 02:56:51,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {26913#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27501#(< main_~i~0 2010)} is VALID [2022-04-28 02:56:51,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-28 02:56:51,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-28 02:56:51,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-28 02:56:51,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {26913#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(12, 2); {26913#true} is VALID [2022-04-28 02:56:51,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26913#true} is VALID [2022-04-28 02:56:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:51,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478561776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:51,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:51,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-28 02:56:51,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908138695] [2022-04-28 02:56:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908138695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:51,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:51,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 02:56:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108871048] [2022-04-28 02:56:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:51,516 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 02:56:51,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:51,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 02:56:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 02:56:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:56:51,569 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:52,710 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:56:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 02:56:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 02:56:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-28 02:56:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-28 02:56:52,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 98 transitions. [2022-04-28 02:56:52,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:52,784 INFO L225 Difference]: With dead ends: 98 [2022-04-28 02:56:52,784 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 02:56:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6402, Invalid=8118, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 02:56:52,785 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:52,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 02:56:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 02:56:53,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:53,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,083 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,083 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:53,084 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:56:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-28 02:56:53,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:53,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:53,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 02:56:53,084 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 02:56:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:53,085 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 02:56:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-28 02:56:53,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:53,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:53,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:53,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-04-28 02:56:53,086 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2022-04-28 02:56:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:53,086 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-04-28 02:56:53,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 91 transitions. [2022-04-28 02:56:53,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-28 02:56:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 02:56:53,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:53,177 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:53,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 02:56:53,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 02:56:53,378 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 167621736, now seen corresponding path program 77 times [2022-04-28 02:56:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:53,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528813114] [2022-04-28 02:56:53,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:53,381 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:53,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 167621736, now seen corresponding path program 78 times [2022-04-28 02:56:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:53,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52889570] [2022-04-28 02:56:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {28210#(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(12, 2); {28165#true} is VALID [2022-04-28 02:56:53,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-28 02:56:53,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-28 02:56:53,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {28165#true} call ULTIMATE.init(); {28210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:53,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {28210#(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(12, 2); {28165#true} is VALID [2022-04-28 02:56:53,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-28 02:56:53,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-28 02:56:53,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-28 02:56:53,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {28165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {28170#(= main_~i~0 0)} is VALID [2022-04-28 02:56:53,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {28170#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28170#(= main_~i~0 0)} is VALID [2022-04-28 02:56:53,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {28170#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28171#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {28171#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28171#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {28171#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28172#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {28172#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28172#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {28172#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28173#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {28173#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28173#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:53,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {28173#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28174#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {28174#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28174#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:53,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {28174#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28175#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {28175#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28175#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:53,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {28175#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28176#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {28176#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28176#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:53,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {28176#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28177#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {28177#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28177#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:53,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {28177#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28178#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {28178#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28178#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:53,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {28178#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28179#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {28179#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28179#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:53,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {28179#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28180#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {28180#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28180#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:53,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {28180#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28181#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {28181#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28181#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:53,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {28181#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28182#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {28182#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28182#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:53,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {28182#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28183#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {28183#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28183#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:53,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {28183#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28184#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {28184#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28184#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:53,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {28184#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28185#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {28185#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28185#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:53,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {28185#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28186#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {28186#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28186#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:53,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {28186#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28187#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {28187#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28187#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:53,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {28187#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28188#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {28188#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28188#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:53,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {28188#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28189#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {28189#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28189#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:53,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {28189#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28190#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {28190#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28190#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:53,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {28190#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28191#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {28191#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28191#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:53,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {28191#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28192#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {28192#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28192#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:53,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {28192#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28193#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {28193#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28193#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:53,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {28193#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28194#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {28194#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28194#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:53,977 INFO L290 TraceCheckUtils]: 55: Hoare triple {28194#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28195#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {28195#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28195#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:53,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {28195#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28196#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {28196#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28196#(<= main_~i~0 26)} is VALID [2022-04-28 02:56:53,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {28196#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28197#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {28197#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28197#(<= main_~i~0 27)} is VALID [2022-04-28 02:56:53,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {28197#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28198#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {28198#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28198#(<= main_~i~0 28)} is VALID [2022-04-28 02:56:53,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {28198#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28199#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {28199#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28199#(<= main_~i~0 29)} is VALID [2022-04-28 02:56:53,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {28199#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28200#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {28200#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28200#(<= main_~i~0 30)} is VALID [2022-04-28 02:56:53,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {28200#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28201#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {28201#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28201#(<= main_~i~0 31)} is VALID [2022-04-28 02:56:53,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {28201#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28202#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {28202#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28202#(<= main_~i~0 32)} is VALID [2022-04-28 02:56:53,981 INFO L290 TraceCheckUtils]: 71: Hoare triple {28202#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28203#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {28203#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28203#(<= main_~i~0 33)} is VALID [2022-04-28 02:56:53,981 INFO L290 TraceCheckUtils]: 73: Hoare triple {28203#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28204#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {28204#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28204#(<= main_~i~0 34)} is VALID [2022-04-28 02:56:53,982 INFO L290 TraceCheckUtils]: 75: Hoare triple {28204#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28205#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,982 INFO L290 TraceCheckUtils]: 76: Hoare triple {28205#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28205#(<= main_~i~0 35)} is VALID [2022-04-28 02:56:53,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {28205#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28206#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,983 INFO L290 TraceCheckUtils]: 78: Hoare triple {28206#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28206#(<= main_~i~0 36)} is VALID [2022-04-28 02:56:53,983 INFO L290 TraceCheckUtils]: 79: Hoare triple {28206#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28207#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,983 INFO L290 TraceCheckUtils]: 80: Hoare triple {28207#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28207#(<= main_~i~0 37)} is VALID [2022-04-28 02:56:53,984 INFO L290 TraceCheckUtils]: 81: Hoare triple {28207#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28208#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,984 INFO L290 TraceCheckUtils]: 82: Hoare triple {28208#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28208#(<= main_~i~0 38)} is VALID [2022-04-28 02:56:53,984 INFO L290 TraceCheckUtils]: 83: Hoare triple {28208#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28209#(<= main_~i~0 39)} is VALID [2022-04-28 02:56:53,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {28209#(<= main_~i~0 39)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {28166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L272 TraceCheckUtils]: 86: Hoare triple {28166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-28 02:56:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52889570] [2022-04-28 02:56:53,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52889570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775065756] [2022-04-28 02:56:53,986 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:53,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:53,987 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:53,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 02:57:01,741 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-28 02:57:01,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:01,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 02:57:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:01,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:02,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {28165#true} call ULTIMATE.init(); {28165#true} is VALID [2022-04-28 02:57:02,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {28165#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(12, 2); {28165#true} is VALID [2022-04-28 02:57:02,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-28 02:57:02,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-28 02:57:02,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-28 02:57:02,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {28165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {28229#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:02,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {28229#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28229#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:02,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {28229#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28171#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:02,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {28171#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28171#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:02,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {28171#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28172#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:02,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {28172#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28172#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:02,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {28172#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28173#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:02,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {28173#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28173#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:02,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {28173#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28174#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:02,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {28174#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28174#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:02,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {28174#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28175#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:02,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {28175#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28175#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:02,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {28175#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28176#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:02,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {28176#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28176#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:02,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {28176#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28177#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:02,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {28177#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28177#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:02,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {28177#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28178#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:02,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {28178#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28178#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:02,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {28178#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28179#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:02,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {28179#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28179#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:02,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {28179#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28180#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:02,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {28180#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28180#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:02,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {28180#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28181#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:02,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {28181#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28181#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:02,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {28181#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28182#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:02,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {28182#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28182#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:02,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {28182#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28183#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:02,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {28183#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28183#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:02,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {28183#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28184#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:02,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {28184#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28184#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:02,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {28184#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28185#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:02,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {28185#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28185#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:02,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {28185#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28186#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:02,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {28186#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28186#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:02,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {28186#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28187#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:02,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {28187#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28187#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:02,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {28187#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28188#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:02,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {28188#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28188#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:02,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {28188#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28189#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:02,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {28189#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28189#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:02,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {28189#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28190#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:02,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {28190#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28190#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:02,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {28190#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28191#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:02,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {28191#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28191#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:02,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {28191#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28192#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:02,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {28192#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28192#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:02,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {28192#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28193#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:02,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {28193#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28193#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:02,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {28193#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28194#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:02,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {28194#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28194#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:02,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {28194#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28195#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:02,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {28195#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28195#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:02,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {28195#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28196#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:02,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {28196#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28196#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:02,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {28196#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28197#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:02,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {28197#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28197#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:02,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {28197#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28198#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:02,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {28198#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28198#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:02,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {28198#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28199#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:02,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {28199#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28199#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:02,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {28199#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28200#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:02,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {28200#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28200#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:02,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {28200#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28201#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:02,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {28201#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28201#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:02,283 INFO L290 TraceCheckUtils]: 69: Hoare triple {28201#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28202#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:02,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {28202#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28202#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:02,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {28202#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28203#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:02,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {28203#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28203#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:02,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {28203#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28204#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:02,285 INFO L290 TraceCheckUtils]: 74: Hoare triple {28204#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28204#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:02,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {28204#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28205#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:02,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {28205#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28205#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:02,286 INFO L290 TraceCheckUtils]: 77: Hoare triple {28205#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28206#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:02,286 INFO L290 TraceCheckUtils]: 78: Hoare triple {28206#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28206#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:02,286 INFO L290 TraceCheckUtils]: 79: Hoare triple {28206#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28207#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:02,286 INFO L290 TraceCheckUtils]: 80: Hoare triple {28207#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28207#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:02,287 INFO L290 TraceCheckUtils]: 81: Hoare triple {28207#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28208#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:02,287 INFO L290 TraceCheckUtils]: 82: Hoare triple {28208#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28208#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:02,287 INFO L290 TraceCheckUtils]: 83: Hoare triple {28208#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28209#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:02,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {28209#(<= main_~i~0 39)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {28166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L272 TraceCheckUtils]: 86: Hoare triple {28166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-28 02:57:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:02,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:04,076 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-28 02:57:04,076 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-28 02:57:04,076 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-28 02:57:04,077 INFO L272 TraceCheckUtils]: 86: Hoare triple {28166#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {28166#false} is VALID [2022-04-28 02:57:04,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {28166#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {28166#false} is VALID [2022-04-28 02:57:04,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {28497#(< main_~i~0 2048)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-28 02:57:04,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {28501#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28497#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:04,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {28501#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28501#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:04,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {28508#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28501#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:04,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {28508#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28508#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:04,078 INFO L290 TraceCheckUtils]: 79: Hoare triple {28515#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28508#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:04,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {28515#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28515#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:04,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {28522#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28515#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:04,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {28522#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28522#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:04,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {28529#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28522#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:04,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {28529#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28529#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:04,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {28536#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28529#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:04,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {28536#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28536#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:04,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {28543#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28536#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:04,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {28543#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28543#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:04,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {28550#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28543#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:04,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {28550#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28550#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:04,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {28557#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28550#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:04,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {28557#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28557#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:04,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {28564#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28557#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:04,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {28564#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28564#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:04,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {28571#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28564#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:04,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {28571#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28571#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:04,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {28578#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28571#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:04,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {28578#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28578#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:04,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {28585#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28578#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:04,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {28585#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28585#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:04,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {28592#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28585#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:04,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {28592#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28592#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:04,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {28599#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28592#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:04,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {28599#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28599#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:04,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {28606#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28599#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:04,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {28606#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28606#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:04,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {28613#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28606#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:04,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {28613#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28613#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:04,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {28620#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28613#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:04,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {28620#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28620#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:04,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {28627#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28620#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:04,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {28627#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28627#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:04,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {28634#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28627#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:04,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {28634#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28634#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:04,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {28641#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28634#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:04,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {28641#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28641#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:04,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {28648#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28641#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:04,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {28648#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28648#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:04,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {28655#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28648#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:04,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {28655#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28655#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:04,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {28662#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28655#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:04,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {28662#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28662#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:04,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {28669#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28662#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:04,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {28669#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28669#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:04,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {28676#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28669#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:04,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {28676#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28676#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:04,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {28683#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28676#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:04,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {28683#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28683#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:04,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {28690#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28683#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:04,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {28690#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28690#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:04,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {28697#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28690#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:04,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {28697#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28697#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:04,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {28704#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28697#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:04,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {28704#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28704#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:04,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {28711#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28704#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:04,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {28711#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28711#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:04,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {28718#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28711#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:04,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {28718#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28718#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:04,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {28725#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28718#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:04,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {28725#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28725#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:04,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {28732#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28725#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:04,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {28732#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28732#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:04,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {28739#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28732#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:04,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28739#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:04,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {28746#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28739#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:04,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {28746#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28746#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:04,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {28753#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28746#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:04,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {28753#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28753#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:04,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {28760#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28753#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:04,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {28760#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28760#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:04,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {28767#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28760#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:04,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {28767#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28767#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:04,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {28165#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {28767#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:04,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-28 02:57:04,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-28 02:57:04,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-28 02:57:04,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {28165#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(12, 2); {28165#true} is VALID [2022-04-28 02:57:04,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {28165#true} call ULTIMATE.init(); {28165#true} is VALID [2022-04-28 02:57:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:04,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775065756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:04,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:04,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-28 02:57:04,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:04,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528813114] [2022-04-28 02:57:04,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528813114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:04,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:04,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 02:57:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697179910] [2022-04-28 02:57:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 02:57:04,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:04,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,155 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 02:57:04,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 02:57:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 02:57:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 02:57:04,156 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,299 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:57:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 02:57:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 02:57:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-28 02:57:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-28 02:57:05,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 100 transitions. [2022-04-28 02:57:05,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,369 INFO L225 Difference]: With dead ends: 100 [2022-04-28 02:57:05,369 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 02:57:05,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 02:57:05,371 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:05,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 29 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 02:57:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-04-28 02:57:05,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:05,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,673 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,673 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,674 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:57:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-28 02:57:05,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 02:57:05,674 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 02:57:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,675 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 02:57:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-28 02:57:05,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:05,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 88 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2022-04-28 02:57:05,676 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2022-04-28 02:57:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:05,676 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2022-04-28 02:57:05,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 93 transitions. [2022-04-28 02:57:05,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-28 02:57:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 02:57:05,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:05,786 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:05,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:05,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:05,987 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1296610954, now seen corresponding path program 79 times [2022-04-28 02:57:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:05,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658368990] [2022-04-28 02:57:05,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:05,989 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:05,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1296610954, now seen corresponding path program 80 times [2022-04-28 02:57:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:05,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021414591] [2022-04-28 02:57:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:06,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {29491#(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(12, 2); {29445#true} is VALID [2022-04-28 02:57:06,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-28 02:57:06,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-28 02:57:06,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {29445#true} call ULTIMATE.init(); {29491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:06,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {29491#(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(12, 2); {29445#true} is VALID [2022-04-28 02:57:06,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-28 02:57:06,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-28 02:57:06,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-28 02:57:06,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {29445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29450#(= main_~i~0 0)} is VALID [2022-04-28 02:57:06,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {29450#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29450#(= main_~i~0 0)} is VALID [2022-04-28 02:57:06,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {29450#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29451#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:06,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {29451#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29451#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:06,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {29451#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29452#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:06,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {29452#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29452#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:06,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {29452#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29453#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:06,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {29453#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29453#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:06,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {29453#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29454#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:06,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {29454#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29454#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:06,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {29454#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29455#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:06,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {29455#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29455#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:06,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {29455#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29456#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:06,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {29456#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29456#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:06,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {29456#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29457#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:06,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {29457#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29457#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:06,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {29457#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29458#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:06,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {29458#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29458#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:06,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {29458#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29459#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:06,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {29459#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29459#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:06,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {29459#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29460#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:06,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {29460#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29460#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:06,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {29460#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29461#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:06,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {29461#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29461#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:06,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {29461#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29462#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:06,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {29462#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29462#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:06,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {29462#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29463#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:06,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {29463#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29463#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:06,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {29463#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29464#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:06,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {29464#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29464#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:06,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {29464#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29465#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:06,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {29465#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29465#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:06,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {29465#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29466#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:06,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {29466#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29466#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:06,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {29466#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29467#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:06,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {29467#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29467#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:06,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {29467#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29468#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:06,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {29468#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29468#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:06,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {29468#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29469#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:06,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {29469#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29469#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:06,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {29469#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29470#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:06,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {29470#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29470#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:06,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {29470#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29471#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:06,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {29471#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29471#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:06,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {29471#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29472#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:06,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {29472#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29472#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:06,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {29472#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29473#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:06,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {29473#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29473#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:06,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {29473#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29474#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:06,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {29474#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29474#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:06,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {29474#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29475#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:06,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {29475#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29475#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:06,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {29475#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29476#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:06,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {29476#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29476#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:06,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {29476#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29477#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:06,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {29477#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29477#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:06,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {29477#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29478#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:06,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {29478#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29478#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:06,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {29478#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29479#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:06,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {29479#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29479#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:06,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {29479#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29480#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:06,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {29480#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29480#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:06,714 INFO L290 TraceCheckUtils]: 67: Hoare triple {29480#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29481#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:06,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {29481#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29481#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:06,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {29481#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29482#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:06,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {29482#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29482#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:06,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {29482#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29483#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:06,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {29483#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29483#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:06,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {29483#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29484#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:06,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {29484#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29484#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:06,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {29484#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29485#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:06,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {29485#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29485#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:06,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {29485#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29486#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:06,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {29486#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29486#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:06,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {29486#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29487#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:06,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {29487#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29487#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:06,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {29487#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29488#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:06,718 INFO L290 TraceCheckUtils]: 82: Hoare triple {29488#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29488#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:06,718 INFO L290 TraceCheckUtils]: 83: Hoare triple {29488#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29489#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:06,718 INFO L290 TraceCheckUtils]: 84: Hoare triple {29489#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29489#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {29489#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29490#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 86: Hoare triple {29490#(<= main_~i~0 40)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 87: Hoare triple {29446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29446#false} is VALID [2022-04-28 02:57:06,719 INFO L272 TraceCheckUtils]: 88: Hoare triple {29446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {29446#false} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-28 02:57:06,719 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-28 02:57:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:06,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021414591] [2022-04-28 02:57:06,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021414591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:06,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692578792] [2022-04-28 02:57:06,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:06,721 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:06,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 02:57:06,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:06,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:06,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 02:57:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:06,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:07,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {29445#true} call ULTIMATE.init(); {29445#true} is VALID [2022-04-28 02:57:07,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {29445#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(12, 2); {29445#true} is VALID [2022-04-28 02:57:07,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-28 02:57:07,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-28 02:57:07,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-28 02:57:07,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {29445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29510#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:07,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {29510#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29510#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:07,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {29510#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29451#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {29451#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29451#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {29451#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29452#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {29452#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29452#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {29452#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29453#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {29453#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29453#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {29453#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29454#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {29454#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29454#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {29454#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29455#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {29455#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29455#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {29455#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29456#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {29456#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29456#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {29456#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29457#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {29457#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29457#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {29457#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29458#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {29458#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29458#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {29458#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29459#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {29459#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29459#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {29459#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29460#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {29460#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29460#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {29460#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29461#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {29461#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29461#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {29461#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29462#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {29462#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29462#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {29462#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29463#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {29463#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29463#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {29463#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29464#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {29464#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29464#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {29464#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29465#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {29465#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29465#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {29465#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29466#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {29466#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29466#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {29466#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29467#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {29467#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29467#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {29467#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29468#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {29468#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29468#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {29468#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29469#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {29469#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29469#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {29469#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29470#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {29470#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29470#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {29470#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29471#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {29471#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29471#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {29471#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29472#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {29472#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29472#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {29472#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29473#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {29473#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29473#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {29473#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29474#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {29474#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29474#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {29474#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29475#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {29475#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29475#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {29475#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29476#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {29476#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29476#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {29476#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29477#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:07,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {29477#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29477#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:07,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {29477#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29478#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:07,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {29478#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29478#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:07,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {29478#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29479#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:07,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {29479#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29479#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:07,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {29479#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29480#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:07,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {29480#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29480#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:07,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {29480#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29481#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:07,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {29481#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29481#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:07,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {29481#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29482#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:07,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {29482#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29482#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:07,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {29482#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29483#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:07,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {29483#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29483#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:07,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {29483#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29484#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:07,487 INFO L290 TraceCheckUtils]: 74: Hoare triple {29484#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29484#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:07,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {29484#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29485#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:07,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {29485#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29485#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:07,488 INFO L290 TraceCheckUtils]: 77: Hoare triple {29485#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29486#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:07,488 INFO L290 TraceCheckUtils]: 78: Hoare triple {29486#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29486#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:07,488 INFO L290 TraceCheckUtils]: 79: Hoare triple {29486#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29487#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:07,488 INFO L290 TraceCheckUtils]: 80: Hoare triple {29487#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29487#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:07,489 INFO L290 TraceCheckUtils]: 81: Hoare triple {29487#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29488#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:07,489 INFO L290 TraceCheckUtils]: 82: Hoare triple {29488#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29488#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:07,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {29488#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29489#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {29489#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29489#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {29489#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29490#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {29490#(<= main_~i~0 40)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {29446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29446#false} is VALID [2022-04-28 02:57:07,490 INFO L272 TraceCheckUtils]: 88: Hoare triple {29446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {29446#false} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-28 02:57:07,490 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-28 02:57:07,491 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-28 02:57:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:07,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:09,372 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L272 TraceCheckUtils]: 88: Hoare triple {29446#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L290 TraceCheckUtils]: 87: Hoare triple {29446#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L290 TraceCheckUtils]: 86: Hoare triple {29784#(< main_~i~0 2048)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-28 02:57:09,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {29788#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29784#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:09,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {29788#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29788#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:09,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {29795#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29788#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:09,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {29795#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29795#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:09,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {29802#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29795#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:09,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {29802#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29802#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:09,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {29809#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29802#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:09,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {29809#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29809#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:09,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {29816#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29809#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:09,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {29816#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29816#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:09,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {29823#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29816#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:09,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {29823#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29823#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:09,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {29830#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29823#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:09,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {29830#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29830#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:09,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {29837#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29830#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:09,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {29837#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29837#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:09,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {29844#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29837#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:09,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {29844#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29844#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:09,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {29851#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29844#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:09,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {29851#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29851#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:09,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {29858#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29851#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:09,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {29858#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29858#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:09,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {29865#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29858#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:09,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {29865#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29865#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:09,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {29872#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29865#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:09,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {29872#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29872#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:09,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {29879#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29872#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:09,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {29879#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29879#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:09,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {29886#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29879#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:09,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {29886#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29886#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:09,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {29893#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29886#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:09,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {29893#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29893#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:09,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {29900#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29893#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:09,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {29900#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29900#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:09,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {29907#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29900#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:09,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {29907#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29907#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:09,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {29914#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29907#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:09,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {29914#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29914#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:09,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {29921#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29914#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:09,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {29921#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29921#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:09,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {29928#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29921#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:09,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {29928#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29928#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:09,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {29935#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29928#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:09,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {29935#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29935#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:09,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {29942#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29935#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:09,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {29942#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29942#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:09,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {29949#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29942#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:09,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {29949#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29949#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:09,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {29956#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29949#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:09,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {29956#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29956#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:09,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {29963#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29956#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:09,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {29963#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29963#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:09,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {29970#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29963#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:09,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {29970#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29970#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:09,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {29977#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29970#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:09,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {29977#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29977#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:09,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {29984#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29977#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:09,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {29984#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29984#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:09,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {29991#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29984#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:09,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {29991#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29991#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:09,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {29998#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29991#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:09,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {29998#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29998#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:09,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {30005#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29998#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:09,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {30005#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30005#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:09,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {30012#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30005#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:09,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {30012#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30012#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:09,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {30019#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30012#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:09,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {30019#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30019#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:09,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {30026#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30019#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:09,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {30026#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30026#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:09,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {30033#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30026#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:09,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {30033#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30033#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:09,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {30040#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30033#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:09,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {30040#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30040#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:09,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {30047#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30040#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:09,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {30047#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30047#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:09,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {30054#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30047#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:09,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {30054#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30054#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:09,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {30061#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30054#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:09,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {30061#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30061#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:09,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {29445#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {30061#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:09,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-28 02:57:09,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-28 02:57:09,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-28 02:57:09,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {29445#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(12, 2); {29445#true} is VALID [2022-04-28 02:57:09,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {29445#true} call ULTIMATE.init(); {29445#true} is VALID [2022-04-28 02:57:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692578792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:09,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 02:57:09,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658368990] [2022-04-28 02:57:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658368990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 02:57:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608134196] [2022-04-28 02:57:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:09,398 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 02:57:09,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:09,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:09,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 02:57:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 02:57:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 02:57:09,452 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:10,706 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:57:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 02:57:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 02:57:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-28 02:57:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-28 02:57:10,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 102 transitions. [2022-04-28 02:57:10,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:10,780 INFO L225 Difference]: With dead ends: 102 [2022-04-28 02:57:10,780 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 02:57:10,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 02:57:10,782 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:10,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 39 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 02:57:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-28 02:57:11,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:11,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,104 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,104 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,105 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:57:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-28 02:57:11,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 02:57:11,106 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 02:57:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,106 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 02:57:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-28 02:57:11,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:11,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2022-04-28 02:57:11,107 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2022-04-28 02:57:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:11,107 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2022-04-28 02:57:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 95 transitions. [2022-04-28 02:57:11,210 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 02:57:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-28 02:57:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 02:57:11,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:11,210 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:11,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:11,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 02:57:11,411 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -371476436, now seen corresponding path program 81 times [2022-04-28 02:57:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819811358] [2022-04-28 02:57:11,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:11,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:11,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -371476436, now seen corresponding path program 82 times [2022-04-28 02:57:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:11,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076902035] [2022-04-28 02:57:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {30800#(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(12, 2); {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {30753#true} call ULTIMATE.init(); {30800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:12,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {30800#(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(12, 2); {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-28 02:57:12,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-28 02:57:12,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {30753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {30758#(= main_~i~0 0)} is VALID [2022-04-28 02:57:12,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {30758#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30758#(= main_~i~0 0)} is VALID [2022-04-28 02:57:12,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {30758#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30759#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {30759#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30759#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {30759#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30760#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {30760#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30760#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {30760#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30761#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {30761#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30761#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {30761#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30762#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {30762#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30762#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {30762#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30763#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {30763#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30763#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {30763#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30764#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {30764#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30764#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {30764#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30765#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {30765#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30765#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {30765#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30766#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {30766#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30766#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {30766#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30767#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {30767#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30767#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {30767#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30768#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {30768#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30768#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {30768#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30769#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {30769#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30769#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {30769#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30770#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {30770#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30770#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {30770#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30771#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {30771#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30771#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {30771#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30772#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {30772#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30772#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {30772#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30773#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {30773#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30773#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {30773#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30774#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {30774#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30774#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {30774#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30775#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {30775#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30775#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {30775#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30776#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {30776#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30776#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {30776#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30777#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {30777#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30777#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {30777#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30778#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {30778#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30778#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {30778#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30779#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {30779#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30779#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {30779#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30780#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {30780#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30780#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {30780#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30781#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {30781#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30781#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {30781#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30782#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {30782#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30782#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {30782#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30783#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {30783#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30783#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {30783#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30784#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {30784#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30784#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {30784#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30785#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {30785#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30785#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {30785#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30786#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {30786#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30786#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {30786#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30787#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:12,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {30787#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30787#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:12,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {30787#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30788#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:12,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {30788#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30788#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:12,076 INFO L290 TraceCheckUtils]: 67: Hoare triple {30788#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30789#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:12,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {30789#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30789#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:12,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {30789#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30790#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:12,076 INFO L290 TraceCheckUtils]: 70: Hoare triple {30790#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30790#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:12,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {30790#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30791#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:12,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {30791#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30791#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:12,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {30791#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30792#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:12,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {30792#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30792#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:12,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {30792#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30793#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:12,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {30793#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30793#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:12,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {30793#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30794#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:12,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {30794#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30794#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:12,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {30794#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30795#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:12,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {30795#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30795#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:12,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {30795#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30796#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:12,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {30796#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30796#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:12,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {30796#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30797#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:12,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {30797#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30797#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:12,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {30797#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30798#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:12,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {30798#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30798#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:12,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {30798#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30799#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:12,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {30799#(<= main_~i~0 41)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-28 02:57:12,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {30754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {30754#false} is VALID [2022-04-28 02:57:12,082 INFO L272 TraceCheckUtils]: 90: Hoare triple {30754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {30754#false} is VALID [2022-04-28 02:57:12,082 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-28 02:57:12,082 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-28 02:57:12,082 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-28 02:57:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076902035] [2022-04-28 02:57:12,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076902035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858992371] [2022-04-28 02:57:12,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:12,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:12,083 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:12,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 02:57:12,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:12,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:12,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 02:57:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:12,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {30753#true} call ULTIMATE.init(); {30753#true} is VALID [2022-04-28 02:57:12,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {30753#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(12, 2); {30753#true} is VALID [2022-04-28 02:57:12,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-28 02:57:12,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-28 02:57:12,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-28 02:57:12,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {30753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {30819#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:12,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {30819#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30819#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:12,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {30819#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30759#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {30759#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30759#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {30759#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30760#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {30760#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30760#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {30760#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30761#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {30761#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30761#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {30761#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30762#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {30762#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30762#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {30762#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30763#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {30763#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30763#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {30763#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30764#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {30764#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30764#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {30764#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30765#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {30765#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30765#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {30765#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30766#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {30766#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30766#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {30766#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30767#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {30767#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30767#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {30767#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30768#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {30768#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30768#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {30768#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30769#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {30769#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30769#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {30769#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30770#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {30770#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30770#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {30770#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30771#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {30771#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30771#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {30771#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30772#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {30772#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30772#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {30772#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30773#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {30773#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30773#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {30773#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30774#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {30774#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30774#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {30774#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30775#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {30775#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30775#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {30775#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30776#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {30776#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30776#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {30776#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30777#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {30777#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30777#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {30777#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30778#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {30778#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30778#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {30778#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30779#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {30779#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30779#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {30779#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30780#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {30780#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30780#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {30780#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30781#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {30781#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30781#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {30781#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30782#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {30782#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30782#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {30782#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30783#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {30783#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30783#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {30783#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30784#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {30784#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30784#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {30784#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30785#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {30785#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30785#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {30785#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30786#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {30786#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30786#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {30786#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30787#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:12,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {30787#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30787#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:12,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {30787#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30788#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:12,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {30788#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30788#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:12,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {30788#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30789#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:12,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {30789#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30789#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:12,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {30789#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30790#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:12,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {30790#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30790#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:12,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {30790#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30791#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:12,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {30791#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30791#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:12,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {30791#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30792#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:12,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {30792#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30792#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:12,808 INFO L290 TraceCheckUtils]: 75: Hoare triple {30792#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30793#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:12,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {30793#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30793#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:12,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {30793#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30794#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:12,808 INFO L290 TraceCheckUtils]: 78: Hoare triple {30794#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30794#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:12,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {30794#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30795#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:12,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {30795#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30795#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:12,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {30795#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30796#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:12,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {30796#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30796#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:12,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {30796#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30797#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:12,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {30797#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30797#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:12,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {30797#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30798#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:12,811 INFO L290 TraceCheckUtils]: 86: Hoare triple {30798#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30798#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:12,811 INFO L290 TraceCheckUtils]: 87: Hoare triple {30798#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30799#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:12,811 INFO L290 TraceCheckUtils]: 88: Hoare triple {30799#(<= main_~i~0 41)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-28 02:57:12,811 INFO L290 TraceCheckUtils]: 89: Hoare triple {30754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {30754#false} is VALID [2022-04-28 02:57:12,811 INFO L272 TraceCheckUtils]: 90: Hoare triple {30754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {30754#false} is VALID [2022-04-28 02:57:12,812 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-28 02:57:12,812 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-28 02:57:12,812 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-28 02:57:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:12,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:14,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-28 02:57:14,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-28 02:57:14,744 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-28 02:57:14,744 INFO L272 TraceCheckUtils]: 90: Hoare triple {30754#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {30754#false} is VALID [2022-04-28 02:57:14,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {30754#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {30754#false} is VALID [2022-04-28 02:57:14,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {31099#(< main_~i~0 2048)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-28 02:57:14,745 INFO L290 TraceCheckUtils]: 87: Hoare triple {31103#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31099#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:14,745 INFO L290 TraceCheckUtils]: 86: Hoare triple {31103#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31103#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:14,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {31110#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31103#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:14,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {31110#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31110#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:14,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {31117#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31110#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:14,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {31117#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31117#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:14,747 INFO L290 TraceCheckUtils]: 81: Hoare triple {31124#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:14,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {31124#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31124#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:14,747 INFO L290 TraceCheckUtils]: 79: Hoare triple {31131#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:14,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {31131#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31131#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:14,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {31138#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:14,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {31138#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31138#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:14,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {31145#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:14,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {31145#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31145#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:14,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {31152#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31145#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:14,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {31152#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31152#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:14,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {31159#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31152#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:14,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {31159#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31159#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:14,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {31166#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31159#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:14,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {31166#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31166#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:14,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {31173#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31166#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:14,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {31173#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31173#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:14,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {31180#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31173#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:14,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {31180#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31180#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:14,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {31187#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31180#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:14,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {31187#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31187#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:14,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {31194#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31187#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:14,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {31194#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31194#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:14,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {31201#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31194#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:14,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {31201#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31201#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:14,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {31208#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31201#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:14,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {31208#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31208#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:14,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {31215#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31208#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:14,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {31215#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31215#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:14,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {31222#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31215#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:14,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {31222#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31222#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:14,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {31229#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31222#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:14,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {31229#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31229#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:14,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {31236#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31229#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:14,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {31236#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31236#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:14,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {31243#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31236#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:14,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {31243#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31243#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:14,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {31250#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31243#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:14,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {31250#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31250#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:14,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {31257#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31250#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:14,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {31257#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31257#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:14,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {31264#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31257#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:14,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {31264#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31264#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:14,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {31271#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31264#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:14,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {31271#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31271#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:14,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {31278#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31271#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:14,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {31278#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31278#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:14,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {31285#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31278#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:14,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {31285#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31285#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:14,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {31292#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31285#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:14,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {31292#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31292#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:14,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {31299#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31292#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:14,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {31299#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31299#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:14,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {31306#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31299#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:14,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {31306#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31306#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:14,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {31313#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31306#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:14,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {31313#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31313#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:14,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {31320#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31313#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:14,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {31320#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31320#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:14,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {31327#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31320#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:14,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {31327#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31327#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:14,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {31334#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31327#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:14,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {31334#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31334#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:14,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {31341#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31334#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:14,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {31341#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31341#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:14,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {31348#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31341#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:14,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {31348#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31348#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:14,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {31355#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31348#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:14,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {31355#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31355#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:14,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {31362#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31355#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:14,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {31362#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31362#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:14,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {31369#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31362#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:14,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {31369#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31369#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:14,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {31376#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31369#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:14,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {31376#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31376#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:14,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {31383#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31376#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:14,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {31383#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31383#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:14,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {30753#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {31383#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:14,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-28 02:57:14,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-28 02:57:14,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-28 02:57:14,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {30753#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(12, 2); {30753#true} is VALID [2022-04-28 02:57:14,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {30753#true} call ULTIMATE.init(); {30753#true} is VALID [2022-04-28 02:57:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858992371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:14,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:14,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-28 02:57:14,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819811358] [2022-04-28 02:57:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819811358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:14,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:14,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 02:57:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454862896] [2022-04-28 02:57:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:14,770 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 02:57:14,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:14,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:14,824 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 02:57:14,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 02:57:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 02:57:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:57:14,826 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,119 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:57:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 02:57:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 02:57:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-28 02:57:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-28 02:57:16,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 104 transitions. [2022-04-28 02:57:16,191 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 02:57:16,192 INFO L225 Difference]: With dead ends: 104 [2022-04-28 02:57:16,192 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 02:57:16,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7398, Invalid=9372, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 02:57:16,194 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 92 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:16,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 44 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 02:57:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-28 02:57:16,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:16,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,547 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,549 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,550 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:57:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-28 02:57:16,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:16,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:16,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 02:57:16,551 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 02:57:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,552 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 02:57:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-28 02:57:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:16,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:16,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0108695652173914) internal successors, (93), 92 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2022-04-28 02:57:16,553 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2022-04-28 02:57:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:16,554 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2022-04-28 02:57:16,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 97 transitions. [2022-04-28 02:57:16,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-28 02:57:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 02:57:16,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:16,670 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:16,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:16,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:16,887 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1380656818, now seen corresponding path program 83 times [2022-04-28 02:57:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:16,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746552127] [2022-04-28 02:57:16,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:16,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:16,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:16,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1380656818, now seen corresponding path program 84 times [2022-04-28 02:57:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:16,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135518348] [2022-04-28 02:57:16,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {32137#(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(12, 2); {32089#true} is VALID [2022-04-28 02:57:17,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-28 02:57:17,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-28 02:57:17,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {32089#true} call ULTIMATE.init(); {32137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:17,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {32137#(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(12, 2); {32089#true} is VALID [2022-04-28 02:57:17,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-28 02:57:17,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-28 02:57:17,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-28 02:57:17,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {32089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {32094#(= main_~i~0 0)} is VALID [2022-04-28 02:57:17,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {32094#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32094#(= main_~i~0 0)} is VALID [2022-04-28 02:57:17,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {32094#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32095#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {32095#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32095#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {32095#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32096#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {32096#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32096#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {32096#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32097#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:17,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {32097#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32097#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:17,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {32097#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32098#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:17,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {32098#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32098#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:17,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {32098#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32099#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:17,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {32099#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32099#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:17,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {32099#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32100#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:17,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {32100#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32100#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:17,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {32100#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32101#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:17,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {32101#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32101#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:17,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {32101#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32102#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:17,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {32102#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32102#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:17,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {32102#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32103#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:17,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {32103#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32103#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:17,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {32103#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32104#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:17,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {32104#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32104#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:17,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {32104#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32105#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:17,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {32105#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32105#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:17,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {32105#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32106#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:17,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {32106#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32106#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:17,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {32106#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32107#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:17,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {32107#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32107#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:17,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {32107#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:17,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {32108#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32108#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:17,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {32108#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:17,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {32109#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32109#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:17,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {32109#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32110#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:17,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {32110#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32110#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:17,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {32110#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32111#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:17,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {32111#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32111#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:17,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {32111#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32112#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:17,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {32112#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32112#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:17,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {32112#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32113#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:17,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32113#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:17,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {32113#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32114#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:17,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {32114#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32114#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:17,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {32114#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32115#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:17,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {32115#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32115#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:17,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {32115#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32116#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:17,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {32116#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32116#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:17,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {32116#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32117#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:17,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {32117#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32117#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:17,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {32117#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32118#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:17,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {32118#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32118#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:17,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {32118#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32119#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:17,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {32119#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32119#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:17,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {32119#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32120#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:17,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {32120#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32120#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:17,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {32120#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32121#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:17,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {32121#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32121#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:17,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {32121#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32122#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:17,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {32122#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32122#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:17,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {32122#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32123#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:17,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {32123#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32123#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:17,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {32123#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32124#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:17,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {32124#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32124#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:17,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {32124#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32125#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:17,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {32125#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32125#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:17,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {32125#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32126#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:17,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {32126#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32126#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:17,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {32126#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32127#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:17,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {32127#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32127#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:17,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {32127#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32128#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:17,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {32128#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32128#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:17,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {32128#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32129#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:17,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {32129#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32129#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:17,623 INFO L290 TraceCheckUtils]: 77: Hoare triple {32129#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32130#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:17,624 INFO L290 TraceCheckUtils]: 78: Hoare triple {32130#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32130#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:17,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {32130#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32131#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:17,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {32131#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32131#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:17,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {32131#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32132#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:17,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {32132#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32132#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:17,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {32132#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32133#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:17,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {32133#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32133#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:17,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {32133#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32134#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:17,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {32134#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32134#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:17,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {32134#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32135#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:17,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {32135#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32135#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {32135#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32136#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {32136#(<= main_~i~0 42)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 91: Hoare triple {32090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {32090#false} is VALID [2022-04-28 02:57:17,627 INFO L272 TraceCheckUtils]: 92: Hoare triple {32090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {32090#false} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-28 02:57:17,627 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-28 02:57:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135518348] [2022-04-28 02:57:17,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135518348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820707505] [2022-04-28 02:57:17,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:17,629 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:17,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 02:57:29,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-28 02:57:29,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:29,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 02:57:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:29,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:30,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {32089#true} call ULTIMATE.init(); {32089#true} is VALID [2022-04-28 02:57:30,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {32089#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(12, 2); {32089#true} is VALID [2022-04-28 02:57:30,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-28 02:57:30,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-28 02:57:30,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-28 02:57:30,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {32089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {32156#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:30,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {32156#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32156#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:30,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {32156#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32095#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:30,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {32095#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32095#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:30,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {32095#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32096#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:30,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {32096#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32096#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:30,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {32096#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32097#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:30,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {32097#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32097#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:30,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {32097#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32098#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:30,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {32098#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32098#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:30,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {32098#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32099#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:30,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {32099#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32099#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:30,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {32099#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32100#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:30,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {32100#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32100#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:30,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {32100#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32101#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:30,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {32101#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32101#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:30,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {32101#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32102#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:30,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {32102#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32102#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:30,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {32102#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32103#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:30,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {32103#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32103#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:30,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {32103#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32104#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:30,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {32104#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32104#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:30,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {32104#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32105#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:30,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {32105#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32105#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:30,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {32105#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32106#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:30,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {32106#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32106#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:30,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {32106#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32107#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:30,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {32107#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32107#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:30,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {32107#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32108#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:30,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {32108#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32108#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:30,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {32108#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32109#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:30,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {32109#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32109#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:30,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {32109#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32110#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:30,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {32110#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32110#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:30,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {32110#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32111#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:30,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {32111#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32111#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:30,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {32111#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32112#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:30,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {32112#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32112#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:30,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {32112#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32113#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:30,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {32113#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32113#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:30,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {32113#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32114#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:30,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {32114#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32114#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:30,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {32114#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32115#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:30,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {32115#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32115#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:30,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {32115#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32116#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:30,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {32116#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32116#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:30,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {32116#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32117#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:30,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {32117#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32117#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:30,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {32117#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32118#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:30,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {32118#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32118#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:30,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {32118#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32119#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:30,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {32119#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32119#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:30,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {32119#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32120#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:30,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {32120#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32120#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:30,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {32120#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32121#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:30,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {32121#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32121#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:30,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {32121#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32122#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:30,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {32122#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32122#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:30,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {32122#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32123#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:30,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {32123#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32123#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:30,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {32123#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32124#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:30,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {32124#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32124#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:30,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {32124#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32125#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:30,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {32125#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32125#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:30,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {32125#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32126#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:30,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {32126#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32126#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:30,476 INFO L290 TraceCheckUtils]: 71: Hoare triple {32126#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32127#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:30,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {32127#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32127#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:30,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {32127#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32128#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:30,477 INFO L290 TraceCheckUtils]: 74: Hoare triple {32128#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32128#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:30,477 INFO L290 TraceCheckUtils]: 75: Hoare triple {32128#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32129#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:30,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {32129#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32129#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:30,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {32129#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32130#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:30,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {32130#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32130#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:30,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {32130#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32131#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:30,478 INFO L290 TraceCheckUtils]: 80: Hoare triple {32131#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32131#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:30,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {32131#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32132#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:30,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {32132#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32132#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:30,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {32132#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32133#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:30,479 INFO L290 TraceCheckUtils]: 84: Hoare triple {32133#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32133#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:30,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {32133#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32134#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:30,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {32134#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32134#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:30,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {32134#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32135#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {32135#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32135#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {32135#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32136#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {32136#(<= main_~i~0 42)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {32090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {32090#false} is VALID [2022-04-28 02:57:30,481 INFO L272 TraceCheckUtils]: 92: Hoare triple {32090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {32090#false} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-28 02:57:30,481 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-28 02:57:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:30,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:32,517 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-28 02:57:32,517 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-28 02:57:32,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-28 02:57:32,518 INFO L272 TraceCheckUtils]: 92: Hoare triple {32090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {32090#false} is VALID [2022-04-28 02:57:32,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {32090#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {32090#false} is VALID [2022-04-28 02:57:32,518 INFO L290 TraceCheckUtils]: 90: Hoare triple {32442#(< main_~i~0 2048)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-28 02:57:32,518 INFO L290 TraceCheckUtils]: 89: Hoare triple {32446#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32442#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:32,518 INFO L290 TraceCheckUtils]: 88: Hoare triple {32446#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32446#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:32,519 INFO L290 TraceCheckUtils]: 87: Hoare triple {32453#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32446#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:32,519 INFO L290 TraceCheckUtils]: 86: Hoare triple {32453#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32453#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:32,519 INFO L290 TraceCheckUtils]: 85: Hoare triple {32460#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32453#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:32,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {32460#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32460#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:32,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {32467#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32460#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:32,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {32467#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32467#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:32,520 INFO L290 TraceCheckUtils]: 81: Hoare triple {32474#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32467#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:32,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {32474#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32474#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:32,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {32481#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32474#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:32,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {32481#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32481#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:32,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {32488#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32481#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:32,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {32488#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32488#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:32,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {32495#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32488#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:32,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {32495#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32495#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:32,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {32502#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32495#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:32,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {32502#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32502#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:32,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {32509#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32502#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:32,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {32509#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32509#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:32,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {32516#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32509#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:32,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {32516#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32516#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:32,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {32523#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32516#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:32,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {32523#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32523#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:32,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {32530#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32523#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:32,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {32530#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32530#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:32,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {32537#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32530#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:32,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {32537#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32537#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:32,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {32544#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32537#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:32,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {32544#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32544#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:32,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {32551#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32544#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:32,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {32551#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32551#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:32,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {32558#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32551#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:32,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {32558#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32558#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:32,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {32565#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32558#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:32,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {32565#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32565#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:32,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {32572#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32565#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:32,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {32572#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32572#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:32,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {32579#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32572#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:32,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {32579#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32579#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:32,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {32586#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32579#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:32,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {32586#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32586#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:32,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {32593#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32586#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:32,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {32593#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32593#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:32,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {32600#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32593#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:32,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {32600#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32600#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:32,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {32607#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32600#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:32,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {32607#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32607#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:32,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {32614#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32607#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:32,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {32614#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32614#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:32,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {32621#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32614#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:32,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {32621#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32621#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:32,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {32628#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32621#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:32,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {32628#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32628#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:32,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {32635#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32628#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:32,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {32635#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32635#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:32,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {32642#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32635#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:32,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {32642#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32642#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:32,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {32649#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32642#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:32,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {32649#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32649#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:32,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {32656#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32649#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:32,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {32656#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32656#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:32,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {32663#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32656#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:32,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {32663#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32663#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:32,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {32670#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32663#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:32,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {32670#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32670#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:32,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {32677#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32670#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:32,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {32677#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32677#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:32,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {32684#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32677#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:32,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {32684#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32684#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:32,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {32691#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32684#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:32,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {32691#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32691#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:32,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {32698#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32691#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:32,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {32698#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32698#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:32,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {32705#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32698#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:32,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {32705#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32705#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:32,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {32712#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32705#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:32,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {32712#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32712#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:32,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {32719#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32712#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:32,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {32719#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32719#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:32,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {32726#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32719#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:32,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {32726#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32726#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:32,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {32733#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32726#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:32,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {32733#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {32733#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:32,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {32089#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {32733#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:32,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-28 02:57:32,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-28 02:57:32,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-28 02:57:32,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {32089#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(12, 2); {32089#true} is VALID [2022-04-28 02:57:32,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {32089#true} call ULTIMATE.init(); {32089#true} is VALID [2022-04-28 02:57:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820707505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:32,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-28 02:57:32,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746552127] [2022-04-28 02:57:32,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746552127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:32,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:32,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 02:57:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227453727] [2022-04-28 02:57:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 02:57:32,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:32,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:32,598 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 02:57:32,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 02:57:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 02:57:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 02:57:32,600 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:33,925 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:57:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 02:57:33,925 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 02:57:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-28 02:57:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-28 02:57:33,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 106 transitions. [2022-04-28 02:57:33,996 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 02:57:33,997 INFO L225 Difference]: With dead ends: 106 [2022-04-28 02:57:33,997 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 02:57:33,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 02:57:33,999 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:33,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 34 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 02:57:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-28 02:57:34,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:34,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:34,362 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:34,362 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:34,363 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:57:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-28 02:57:34,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:34,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:34,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:57:34,363 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:57:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:34,364 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 02:57:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-28 02:57:34,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:34,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:34,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:34,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-04-28 02:57:34,365 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2022-04-28 02:57:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:34,365 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-04-28 02:57:34,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:34,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 99 transitions. [2022-04-28 02:57:34,480 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 02:57:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-28 02:57:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 02:57:34,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:34,481 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:34,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:34,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:34,686 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash -540395024, now seen corresponding path program 85 times [2022-04-28 02:57:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:34,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044623325] [2022-04-28 02:57:34,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:34,690 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:34,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash -540395024, now seen corresponding path program 86 times [2022-04-28 02:57:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:34,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591939537] [2022-04-28 02:57:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:35,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {33502#(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(12, 2); {33453#true} is VALID [2022-04-28 02:57:35,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-28 02:57:35,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-28 02:57:35,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {33453#true} call ULTIMATE.init(); {33502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:35,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {33502#(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(12, 2); {33453#true} is VALID [2022-04-28 02:57:35,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-28 02:57:35,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-28 02:57:35,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-28 02:57:35,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {33453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {33458#(= main_~i~0 0)} is VALID [2022-04-28 02:57:35,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {33458#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33458#(= main_~i~0 0)} is VALID [2022-04-28 02:57:35,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {33458#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33459#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {33459#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33459#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {33459#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33460#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {33460#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33460#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {33460#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33461#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:35,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {33461#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33461#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:35,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {33461#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33462#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:35,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {33462#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33462#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:35,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {33462#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33463#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:35,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {33463#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33463#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:35,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {33463#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33464#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:35,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {33464#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33464#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:35,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {33464#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33465#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:35,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {33465#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33465#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:35,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {33465#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33466#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:35,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {33466#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33466#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:35,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {33466#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33467#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:35,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {33467#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33467#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:35,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {33467#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33468#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:35,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {33468#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33468#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:35,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {33468#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33469#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:35,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {33469#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33469#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:35,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {33469#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33470#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:35,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {33470#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33470#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:35,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {33470#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33471#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:35,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {33471#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33471#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:35,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {33471#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33472#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:35,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {33472#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33472#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:35,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {33472#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33473#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:35,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {33473#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33473#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:35,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {33473#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33474#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:35,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {33474#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33474#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:35,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {33474#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33475#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:35,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {33475#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33475#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:35,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {33475#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33476#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:35,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {33476#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33476#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:35,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {33476#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33477#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:35,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {33477#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33477#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:35,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {33477#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33478#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:35,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {33478#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33478#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:35,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {33478#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33479#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:35,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {33479#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33479#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:35,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {33479#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33480#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:35,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {33480#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33480#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:35,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {33480#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33481#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:35,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {33481#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33481#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:35,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {33481#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33482#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:35,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {33482#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33482#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:35,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {33482#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33483#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:35,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {33483#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33483#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:35,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {33483#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33484#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:35,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {33484#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33484#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:35,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {33484#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33485#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:35,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {33485#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33485#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:35,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {33485#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33486#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:35,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {33486#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33486#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:35,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {33486#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33487#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:35,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {33487#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33487#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:35,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {33487#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33488#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:35,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {33488#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33488#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:35,417 INFO L290 TraceCheckUtils]: 67: Hoare triple {33488#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33489#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:35,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {33489#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33489#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:35,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {33489#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33490#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:35,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {33490#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33490#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:35,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {33490#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33491#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:35,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {33491#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33491#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:35,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {33491#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33492#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:35,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {33492#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33492#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:35,419 INFO L290 TraceCheckUtils]: 75: Hoare triple {33492#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33493#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:35,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {33493#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33493#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:35,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {33493#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33494#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:35,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {33494#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33494#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:35,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {33494#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33495#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:35,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {33495#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33495#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:35,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {33495#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33496#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:35,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {33496#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33496#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:35,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {33496#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33497#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:35,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {33497#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33497#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:35,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {33497#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33498#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:35,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {33498#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33498#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:35,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {33498#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33499#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:35,427 INFO L290 TraceCheckUtils]: 88: Hoare triple {33499#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33499#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:35,427 INFO L290 TraceCheckUtils]: 89: Hoare triple {33499#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33500#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:35,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {33500#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33500#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:35,428 INFO L290 TraceCheckUtils]: 91: Hoare triple {33500#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33501#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:35,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {33501#(<= main_~i~0 43)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-28 02:57:35,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {33454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {33454#false} is VALID [2022-04-28 02:57:35,428 INFO L272 TraceCheckUtils]: 94: Hoare triple {33454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {33454#false} is VALID [2022-04-28 02:57:35,429 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-28 02:57:35,429 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-28 02:57:35,429 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-28 02:57:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:35,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:35,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591939537] [2022-04-28 02:57:35,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591939537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:35,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206277130] [2022-04-28 02:57:35,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:35,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:35,430 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:35,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 02:57:35,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:35,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:35,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 02:57:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:35,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:36,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {33453#true} call ULTIMATE.init(); {33453#true} is VALID [2022-04-28 02:57:36,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {33453#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(12, 2); {33453#true} is VALID [2022-04-28 02:57:36,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-28 02:57:36,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-28 02:57:36,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-28 02:57:36,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {33453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {33521#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:36,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {33521#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33521#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:36,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {33521#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33459#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:36,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {33459#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33459#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:36,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {33459#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33460#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:36,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {33460#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33460#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:36,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {33460#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33461#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:36,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {33461#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33461#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:36,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {33461#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33462#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:36,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {33462#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33462#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:36,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {33462#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33463#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:36,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {33463#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33463#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:36,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {33463#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33464#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:36,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {33464#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33464#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:36,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {33464#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33465#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:36,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {33465#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33465#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:36,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {33465#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33466#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:36,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {33466#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33466#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:36,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {33466#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33467#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:36,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {33467#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33467#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:36,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {33467#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33468#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:36,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {33468#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33468#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:36,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {33468#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33469#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:36,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {33469#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33469#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:36,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {33469#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33470#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:36,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {33470#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33470#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:36,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {33470#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33471#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:36,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {33471#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33471#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:36,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {33471#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33472#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:36,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {33472#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33472#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:36,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {33472#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33473#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:36,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {33473#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33473#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:36,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {33473#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33474#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:36,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {33474#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33474#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:36,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {33474#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33475#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:36,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {33475#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33475#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:36,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {33475#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33476#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:36,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {33476#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33476#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:36,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {33476#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33477#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:36,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {33477#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33477#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:36,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {33477#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33478#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:36,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {33478#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33478#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:36,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {33478#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33479#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:36,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {33479#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33479#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:36,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {33479#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33480#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:36,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {33480#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33480#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:36,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {33480#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33481#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:36,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {33481#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33481#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:36,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {33481#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33482#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:36,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {33482#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33482#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:36,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {33482#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33483#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:36,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {33483#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33483#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:36,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {33483#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33484#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:36,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {33484#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33484#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:36,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {33484#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33485#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:36,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {33485#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33485#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:36,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {33485#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33486#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:36,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {33486#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33486#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:36,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {33486#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33487#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:36,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {33487#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33487#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:36,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {33487#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33488#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:36,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {33488#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33488#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:36,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {33488#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33489#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:36,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {33489#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33489#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:36,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {33489#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33490#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:36,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {33490#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33490#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:36,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {33490#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33491#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:36,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {33491#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33491#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:36,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {33491#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33492#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:36,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {33492#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33492#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:36,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {33492#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33493#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:36,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {33493#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33493#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:36,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {33493#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33494#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:36,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {33494#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33494#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:36,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {33494#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33495#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:36,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {33495#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33495#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:36,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {33495#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33496#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:36,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {33496#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33496#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:36,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {33496#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33497#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:36,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {33497#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33497#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:36,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {33497#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33498#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:36,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {33498#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33498#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:36,240 INFO L290 TraceCheckUtils]: 87: Hoare triple {33498#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33499#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:36,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {33499#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33499#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:36,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {33499#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33500#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:36,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {33500#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33500#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:36,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {33500#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33501#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:36,242 INFO L290 TraceCheckUtils]: 92: Hoare triple {33501#(<= main_~i~0 43)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L290 TraceCheckUtils]: 93: Hoare triple {33454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L272 TraceCheckUtils]: 94: Hoare triple {33454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-28 02:57:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:36,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:38,331 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-28 02:57:38,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-28 02:57:38,331 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-28 02:57:38,331 INFO L272 TraceCheckUtils]: 94: Hoare triple {33454#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {33454#false} is VALID [2022-04-28 02:57:38,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {33454#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {33454#false} is VALID [2022-04-28 02:57:38,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {33813#(< main_~i~0 2048)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-28 02:57:38,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {33817#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33813#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:38,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {33817#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33817#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:38,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {33824#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33817#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:38,333 INFO L290 TraceCheckUtils]: 88: Hoare triple {33824#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33824#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:38,333 INFO L290 TraceCheckUtils]: 87: Hoare triple {33831#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33824#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:38,333 INFO L290 TraceCheckUtils]: 86: Hoare triple {33831#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33831#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:38,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {33838#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33831#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:38,334 INFO L290 TraceCheckUtils]: 84: Hoare triple {33838#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33838#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:38,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {33845#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33838#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:38,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {33845#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33845#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:38,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {33852#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33845#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:38,335 INFO L290 TraceCheckUtils]: 80: Hoare triple {33852#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33852#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:38,335 INFO L290 TraceCheckUtils]: 79: Hoare triple {33859#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33852#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:38,335 INFO L290 TraceCheckUtils]: 78: Hoare triple {33859#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33859#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:38,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {33866#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33859#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:38,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {33866#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33866#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:38,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {33873#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33866#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:38,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {33873#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33873#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:38,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {33880#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33873#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:38,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {33880#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33880#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:38,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {33887#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33880#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:38,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {33887#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33887#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:38,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {33894#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33887#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:38,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {33894#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33894#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:38,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {33901#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33894#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:38,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {33901#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33901#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:38,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {33908#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33901#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:38,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {33908#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33908#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:38,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {33915#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33908#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:38,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {33915#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33915#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:38,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {33922#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33915#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:38,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {33922#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33922#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:38,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {33929#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33922#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:38,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {33929#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33929#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:38,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {33936#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33929#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:38,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {33936#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33936#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:38,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {33943#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33936#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:38,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {33943#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33943#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:38,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {33950#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33943#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:38,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {33950#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33950#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:38,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {33957#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33950#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:38,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {33957#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33957#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:38,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {33964#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33957#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:38,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {33964#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33964#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:38,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {33971#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33964#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:38,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {33971#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33971#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:38,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {33978#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33971#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:38,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {33978#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33978#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:38,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {33985#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33978#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:38,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {33985#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33985#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:38,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {33992#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33985#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:38,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {33992#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33992#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:38,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {33999#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33992#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:38,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {33999#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33999#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:38,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {34006#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33999#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:38,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {34006#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34006#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:38,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {34013#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34006#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:38,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {34013#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34013#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:38,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {34020#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34013#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:38,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {34020#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34020#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:38,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {34027#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34020#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:38,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {34027#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34027#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:38,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {34034#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34027#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:38,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {34034#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34034#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:38,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {34041#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34034#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:38,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {34041#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34041#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:38,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {34048#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34041#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:38,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {34048#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34048#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:38,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {34055#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34048#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:38,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {34055#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34055#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:38,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {34062#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34055#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:38,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {34062#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34062#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:38,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {34069#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34062#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:38,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {34069#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34069#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:38,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {34076#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34069#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:38,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {34076#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34076#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:38,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {34083#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34076#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:38,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {34083#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34083#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:38,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {34090#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34083#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:38,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {34090#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34090#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:38,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {34097#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34090#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:38,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {34097#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34097#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:38,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {34104#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34097#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:38,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {34104#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34104#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:38,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {34111#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34104#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:38,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {34111#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34111#(< main_~i~0 2005)} is VALID [2022-04-28 02:57:38,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {33453#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {34111#(< main_~i~0 2005)} is VALID [2022-04-28 02:57:38,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-28 02:57:38,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-28 02:57:38,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-28 02:57:38,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {33453#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(12, 2); {33453#true} is VALID [2022-04-28 02:57:38,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {33453#true} call ULTIMATE.init(); {33453#true} is VALID [2022-04-28 02:57:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:38,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206277130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:38,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:38,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 02:57:38,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:38,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044623325] [2022-04-28 02:57:38,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044623325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:38,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:38,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 02:57:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323309436] [2022-04-28 02:57:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:38,358 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 02:57:38,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:38,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:38,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:38,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 02:57:38,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:38,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 02:57:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 02:57:38,432 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:39,844 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:57:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 02:57:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 02:57:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-28 02:57:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-28 02:57:39,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 108 transitions. [2022-04-28 02:57:39,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:39,923 INFO L225 Difference]: With dead ends: 108 [2022-04-28 02:57:39,923 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 02:57:39,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 02:57:39,925 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:39,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 39 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 02:57:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-28 02:57:40,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:40,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,302 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,302 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,303 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:57:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-28 02:57:40,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 02:57:40,304 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 02:57:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,304 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 02:57:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-28 02:57:40,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:40,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-04-28 02:57:40,305 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2022-04-28 02:57:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:40,306 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-04-28 02:57:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 101 transitions. [2022-04-28 02:57:40,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-28 02:57:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 02:57:40,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:40,421 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:40,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-28 02:57:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 02:57:40,622 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -502662638, now seen corresponding path program 87 times [2022-04-28 02:57:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:40,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084974366] [2022-04-28 02:57:40,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:40,625 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:40,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -502662638, now seen corresponding path program 88 times [2022-04-28 02:57:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185108398] [2022-04-28 02:57:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:41,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:41,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {34895#(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(12, 2); {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {34845#true} call ULTIMATE.init(); {34895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:41,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {34895#(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(12, 2); {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-28 02:57:41,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {34845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {34850#(= main_~i~0 0)} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {34850#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34850#(= main_~i~0 0)} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {34850#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34851#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {34851#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34851#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {34851#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34852#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {34852#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34852#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {34852#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34853#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {34853#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34853#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {34853#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34854#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {34854#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34854#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:41,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {34854#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34855#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {34855#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34855#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {34855#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34856#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {34856#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34856#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {34856#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34857#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:41,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {34857#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34857#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:41,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {34857#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34858#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:41,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {34858#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34858#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {34858#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34859#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {34859#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34859#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {34859#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34860#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {34860#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34860#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {34860#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34861#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {34861#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34861#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {34861#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34862#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {34862#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34862#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {34862#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34863#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {34863#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34863#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {34863#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34864#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {34864#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34864#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {34864#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34865#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {34865#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34865#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {34865#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34866#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {34866#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34866#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {34866#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34867#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {34867#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34867#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:41,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {34867#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34868#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:41,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {34868#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34868#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:41,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {34868#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34869#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {34869#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34869#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {34869#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34870#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {34870#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34870#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {34870#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34871#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {34871#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34871#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {34871#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34872#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {34872#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34872#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {34872#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34873#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {34873#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34873#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:41,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {34873#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34874#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:41,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {34874#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34874#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:41,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {34874#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34875#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:41,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {34875#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34875#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:41,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {34875#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34876#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:41,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {34876#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34876#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:41,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {34876#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34877#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:41,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {34877#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34877#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:41,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {34877#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34878#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:41,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {34878#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34878#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:41,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {34878#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34879#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:41,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {34879#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34879#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:41,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {34879#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34880#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:41,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {34880#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34880#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:41,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {34880#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34881#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:41,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {34881#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34881#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:41,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {34881#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:41,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {34882#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34882#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:41,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {34882#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:41,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {34883#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34883#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:41,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {34883#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:41,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {34884#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34884#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:41,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {34884#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:41,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {34885#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34885#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:41,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {34885#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:41,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {34886#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34886#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:41,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {34886#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:41,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {34887#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34887#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:41,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {34887#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:41,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {34888#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34888#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:41,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {34888#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:41,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {34889#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34889#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:41,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {34889#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:41,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {34890#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34890#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:41,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {34890#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:41,427 INFO L290 TraceCheckUtils]: 88: Hoare triple {34891#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34891#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:41,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {34891#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:41,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {34892#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34892#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:41,428 INFO L290 TraceCheckUtils]: 91: Hoare triple {34892#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:41,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {34893#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34893#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 93: Hoare triple {34893#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 94: Hoare triple {34894#(<= main_~i~0 44)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 95: Hoare triple {34846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {34846#false} is VALID [2022-04-28 02:57:41,429 INFO L272 TraceCheckUtils]: 96: Hoare triple {34846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {34846#false} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-28 02:57:41,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-28 02:57:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185108398] [2022-04-28 02:57:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185108398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:41,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505672114] [2022-04-28 02:57:41,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:41,431 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:41,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 02:57:41,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:41,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:41,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 02:57:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:41,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:42,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {34845#true} call ULTIMATE.init(); {34845#true} is VALID [2022-04-28 02:57:42,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {34845#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(12, 2); {34845#true} is VALID [2022-04-28 02:57:42,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-28 02:57:42,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-28 02:57:42,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-28 02:57:42,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {34845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {34914#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:42,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {34914#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34914#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:42,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {34914#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34851#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:42,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {34851#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34851#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:42,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {34851#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34852#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:42,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {34852#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34852#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:42,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {34852#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34853#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:42,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {34853#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34853#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:42,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {34853#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34854#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:42,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {34854#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34854#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:42,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {34854#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34855#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:42,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {34855#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34855#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:42,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {34855#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34856#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:42,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {34856#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34856#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:42,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {34856#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34857#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:42,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {34857#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34857#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:42,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {34857#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34858#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:42,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {34858#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34858#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:42,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {34858#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34859#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:42,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {34859#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34859#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:42,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {34859#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34860#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:42,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {34860#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34860#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:42,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {34860#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34861#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:42,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {34861#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34861#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:42,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {34861#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34862#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:42,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {34862#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34862#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:42,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {34862#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34863#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:42,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {34863#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34863#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:42,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {34863#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34864#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:42,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {34864#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34864#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:42,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {34864#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34865#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:42,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {34865#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34865#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:42,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {34865#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34866#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:42,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {34866#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34866#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:42,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {34866#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34867#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:42,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {34867#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34867#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:42,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {34867#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34868#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:42,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {34868#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34868#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:42,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {34868#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34869#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:42,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {34869#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34869#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:42,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {34869#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34870#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:42,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {34870#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34870#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:42,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {34870#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34871#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:42,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {34871#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34871#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:42,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {34871#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34872#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:42,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {34872#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34872#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:42,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {34872#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34873#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:42,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {34873#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34873#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:42,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {34873#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34874#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:42,224 INFO L290 TraceCheckUtils]: 54: Hoare triple {34874#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34874#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:42,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {34874#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34875#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:42,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {34875#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34875#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:42,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {34875#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34876#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:42,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {34876#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34876#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:42,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {34876#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34877#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:42,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {34877#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34877#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:42,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {34877#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34878#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:42,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {34878#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34878#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:42,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {34878#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34879#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:42,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {34879#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34879#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:42,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {34879#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34880#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:42,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {34880#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34880#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:42,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {34880#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34881#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:42,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {34881#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34881#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:42,228 INFO L290 TraceCheckUtils]: 69: Hoare triple {34881#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:42,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {34882#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34882#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:42,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {34882#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:42,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {34883#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34883#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:42,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {34883#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:42,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {34884#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34884#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:42,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {34884#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:42,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {34885#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34885#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:42,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {34885#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:42,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {34886#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34886#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:42,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {34886#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:42,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {34887#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34887#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:42,232 INFO L290 TraceCheckUtils]: 81: Hoare triple {34887#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:42,232 INFO L290 TraceCheckUtils]: 82: Hoare triple {34888#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34888#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:42,232 INFO L290 TraceCheckUtils]: 83: Hoare triple {34888#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:42,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {34889#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34889#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:42,233 INFO L290 TraceCheckUtils]: 85: Hoare triple {34889#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:42,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {34890#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34890#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:42,233 INFO L290 TraceCheckUtils]: 87: Hoare triple {34890#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:42,234 INFO L290 TraceCheckUtils]: 88: Hoare triple {34891#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34891#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:42,234 INFO L290 TraceCheckUtils]: 89: Hoare triple {34891#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:42,234 INFO L290 TraceCheckUtils]: 90: Hoare triple {34892#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34892#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:42,235 INFO L290 TraceCheckUtils]: 91: Hoare triple {34892#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:42,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {34893#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {34893#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:42,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {34893#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:42,235 INFO L290 TraceCheckUtils]: 94: Hoare triple {34894#(<= main_~i~0 44)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-28 02:57:42,235 INFO L290 TraceCheckUtils]: 95: Hoare triple {34846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {34846#false} is VALID [2022-04-28 02:57:42,236 INFO L272 TraceCheckUtils]: 96: Hoare triple {34846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {34846#false} is VALID [2022-04-28 02:57:42,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-28 02:57:42,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-28 02:57:42,236 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-28 02:57:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:42,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:44,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L272 TraceCheckUtils]: 96: Hoare triple {34846#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L290 TraceCheckUtils]: 95: Hoare triple {34846#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L290 TraceCheckUtils]: 94: Hoare triple {35212#(< main_~i~0 2048)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-28 02:57:44,422 INFO L290 TraceCheckUtils]: 93: Hoare triple {35216#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35212#(< main_~i~0 2048)} is VALID [2022-04-28 02:57:44,423 INFO L290 TraceCheckUtils]: 92: Hoare triple {35216#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35216#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:44,423 INFO L290 TraceCheckUtils]: 91: Hoare triple {35223#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35216#(< main_~i~0 2047)} is VALID [2022-04-28 02:57:44,423 INFO L290 TraceCheckUtils]: 90: Hoare triple {35223#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35223#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:44,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {35230#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35223#(< main_~i~0 2046)} is VALID [2022-04-28 02:57:44,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {35230#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35230#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:44,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {35237#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35230#(< main_~i~0 2045)} is VALID [2022-04-28 02:57:44,424 INFO L290 TraceCheckUtils]: 86: Hoare triple {35237#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35237#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:44,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {35244#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35237#(< main_~i~0 2044)} is VALID [2022-04-28 02:57:44,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {35244#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35244#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:44,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {35251#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35244#(< main_~i~0 2043)} is VALID [2022-04-28 02:57:44,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {35251#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35251#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:44,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {35258#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35251#(< main_~i~0 2042)} is VALID [2022-04-28 02:57:44,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {35258#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35258#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:44,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {35265#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35258#(< main_~i~0 2041)} is VALID [2022-04-28 02:57:44,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {35265#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35265#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:44,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {35272#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35265#(< main_~i~0 2040)} is VALID [2022-04-28 02:57:44,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {35272#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35272#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:44,427 INFO L290 TraceCheckUtils]: 75: Hoare triple {35279#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35272#(< main_~i~0 2039)} is VALID [2022-04-28 02:57:44,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {35279#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35279#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:44,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {35286#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35279#(< main_~i~0 2038)} is VALID [2022-04-28 02:57:44,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {35286#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35286#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:44,429 INFO L290 TraceCheckUtils]: 71: Hoare triple {35293#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35286#(< main_~i~0 2037)} is VALID [2022-04-28 02:57:44,429 INFO L290 TraceCheckUtils]: 70: Hoare triple {35293#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35293#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:44,429 INFO L290 TraceCheckUtils]: 69: Hoare triple {35300#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35293#(< main_~i~0 2036)} is VALID [2022-04-28 02:57:44,429 INFO L290 TraceCheckUtils]: 68: Hoare triple {35300#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35300#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:44,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {35307#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35300#(< main_~i~0 2035)} is VALID [2022-04-28 02:57:44,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {35307#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35307#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:44,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {35314#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35307#(< main_~i~0 2034)} is VALID [2022-04-28 02:57:44,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {35314#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35314#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:44,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {35321#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35314#(< main_~i~0 2033)} is VALID [2022-04-28 02:57:44,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {35321#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35321#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:44,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {35328#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35321#(< main_~i~0 2032)} is VALID [2022-04-28 02:57:44,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {35328#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35328#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:44,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {35335#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35328#(< main_~i~0 2031)} is VALID [2022-04-28 02:57:44,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {35335#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35335#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:44,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {35342#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35335#(< main_~i~0 2030)} is VALID [2022-04-28 02:57:44,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {35342#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35342#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:44,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {35349#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35342#(< main_~i~0 2029)} is VALID [2022-04-28 02:57:44,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {35349#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35349#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:44,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {35356#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35349#(< main_~i~0 2028)} is VALID [2022-04-28 02:57:44,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {35356#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35356#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:44,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {35363#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35356#(< main_~i~0 2027)} is VALID [2022-04-28 02:57:44,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {35363#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35363#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:44,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {35370#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35363#(< main_~i~0 2026)} is VALID [2022-04-28 02:57:44,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {35370#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35370#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:44,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {35377#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35370#(< main_~i~0 2025)} is VALID [2022-04-28 02:57:44,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {35377#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35377#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:44,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {35384#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35377#(< main_~i~0 2024)} is VALID [2022-04-28 02:57:44,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {35384#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35384#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:44,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {35391#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35384#(< main_~i~0 2023)} is VALID [2022-04-28 02:57:44,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {35391#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35391#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:44,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {35398#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35391#(< main_~i~0 2022)} is VALID [2022-04-28 02:57:44,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {35398#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35398#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:44,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {35405#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35398#(< main_~i~0 2021)} is VALID [2022-04-28 02:57:44,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {35405#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35405#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:44,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {35412#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35405#(< main_~i~0 2020)} is VALID [2022-04-28 02:57:44,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {35412#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35412#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:44,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {35419#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35412#(< main_~i~0 2019)} is VALID [2022-04-28 02:57:44,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {35419#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35419#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:44,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {35426#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35419#(< main_~i~0 2018)} is VALID [2022-04-28 02:57:44,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {35426#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35426#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:44,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {35433#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35426#(< main_~i~0 2017)} is VALID [2022-04-28 02:57:44,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {35433#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35433#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:44,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {35440#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35433#(< main_~i~0 2016)} is VALID [2022-04-28 02:57:44,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {35440#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35440#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:44,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {35447#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35440#(< main_~i~0 2015)} is VALID [2022-04-28 02:57:44,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {35447#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35447#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:44,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {35454#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35447#(< main_~i~0 2014)} is VALID [2022-04-28 02:57:44,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {35454#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35454#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:44,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {35461#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35454#(< main_~i~0 2013)} is VALID [2022-04-28 02:57:44,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {35461#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35461#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:44,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {35468#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35461#(< main_~i~0 2012)} is VALID [2022-04-28 02:57:44,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {35468#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35468#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:44,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {35475#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35468#(< main_~i~0 2011)} is VALID [2022-04-28 02:57:44,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {35475#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35475#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:44,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {35482#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35475#(< main_~i~0 2010)} is VALID [2022-04-28 02:57:44,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {35482#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35482#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:44,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {35489#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35482#(< main_~i~0 2009)} is VALID [2022-04-28 02:57:44,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {35489#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35489#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:44,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {35496#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35489#(< main_~i~0 2008)} is VALID [2022-04-28 02:57:44,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {35496#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35496#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:44,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {35503#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35496#(< main_~i~0 2007)} is VALID [2022-04-28 02:57:44,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {35503#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35503#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:44,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {35510#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35503#(< main_~i~0 2006)} is VALID [2022-04-28 02:57:44,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {35510#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35510#(< main_~i~0 2005)} is VALID [2022-04-28 02:57:44,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {35517#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35510#(< main_~i~0 2005)} is VALID [2022-04-28 02:57:44,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {35517#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {35517#(< main_~i~0 2004)} is VALID [2022-04-28 02:57:44,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {34845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {35517#(< main_~i~0 2004)} is VALID [2022-04-28 02:57:44,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-28 02:57:44,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-28 02:57:44,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-28 02:57:44,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {34845#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(12, 2); {34845#true} is VALID [2022-04-28 02:57:44,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {34845#true} call ULTIMATE.init(); {34845#true} is VALID [2022-04-28 02:57:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:44,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505672114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:44,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:44,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-28 02:57:44,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:44,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084974366] [2022-04-28 02:57:44,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084974366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:44,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:44,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 02:57:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692776725] [2022-04-28 02:57:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 02:57:44,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:44,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:44,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:44,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 02:57:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 02:57:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 02:57:44,513 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,926 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:57:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 02:57:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 02:57:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-28 02:57:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-28 02:57:45,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 110 transitions. [2022-04-28 02:57:46,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:46,002 INFO L225 Difference]: With dead ends: 110 [2022-04-28 02:57:46,002 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 02:57:46,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8466, Invalid=10716, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 02:57:46,004 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 98 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:46,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 24 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 02:57:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-28 02:57:46,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:46,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,405 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,405 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:46,406 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:57:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-28 02:57:46,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:46,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:46,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-28 02:57:46,407 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-28 02:57:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:46,407 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 02:57:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-28 02:57:46,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:46,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:46,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:46,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-04-28 02:57:46,408 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2022-04-28 02:57:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:46,409 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-04-28 02:57:46,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 103 transitions. [2022-04-28 02:57:46,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-28 02:57:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 02:57:46,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:46,515 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:46,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 02:57:46,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 02:57:46,716 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:46,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1398421940, now seen corresponding path program 89 times [2022-04-28 02:57:46,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:46,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043681402] [2022-04-28 02:57:46,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:46,722 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:46,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1398421940, now seen corresponding path program 90 times [2022-04-28 02:57:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:46,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046896537] [2022-04-28 02:57:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:47,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {36316#(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(12, 2); {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {36265#true} call ULTIMATE.init(); {36316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:47,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {36316#(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(12, 2); {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-28 02:57:47,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {36265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {36270#(= main_~i~0 0)} is VALID [2022-04-28 02:57:47,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {36270#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36270#(= main_~i~0 0)} is VALID [2022-04-28 02:57:47,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {36270#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36271#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:47,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {36271#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36271#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:47,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {36271#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36272#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:47,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {36272#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36272#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:47,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {36272#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36273#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:47,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {36273#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36273#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:47,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {36273#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36274#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:47,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {36274#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36274#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:47,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {36274#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36275#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:47,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {36275#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36275#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:47,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {36275#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36276#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:47,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {36276#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36276#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:47,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {36276#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36277#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:47,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {36277#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36277#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:47,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {36277#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36278#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:47,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {36278#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36278#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:47,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {36278#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36279#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:47,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {36279#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36279#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:47,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {36279#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36280#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:47,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {36280#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36280#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:47,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {36280#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36281#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:47,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {36281#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36281#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:47,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {36281#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36282#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:47,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {36282#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36282#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:47,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {36282#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36283#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:47,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {36283#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36283#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:47,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {36283#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36284#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:47,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {36284#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36284#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:47,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {36284#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36285#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:47,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {36285#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36285#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:47,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {36285#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36286#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:47,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {36286#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36286#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:47,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {36286#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36287#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:47,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {36287#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36287#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:47,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {36287#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36288#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:47,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {36288#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36288#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:47,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {36288#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36289#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:47,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {36289#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36289#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:47,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {36289#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36290#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:47,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {36290#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36290#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:47,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {36290#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36291#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:47,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {36291#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36291#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:47,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {36291#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36292#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:47,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {36292#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36292#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:47,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {36292#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36293#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:47,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {36293#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36293#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:47,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {36293#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36294#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:47,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {36294#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36294#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:47,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {36294#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36295#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:47,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {36295#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36295#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:47,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {36295#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36296#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:47,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {36296#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36296#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:47,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {36296#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36297#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:47,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {36297#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36297#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:47,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {36297#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36298#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:47,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {36298#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36298#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:47,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {36298#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36299#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:47,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {36299#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36299#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:47,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {36299#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36300#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:47,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {36300#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36300#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:47,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {36300#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36301#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:47,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {36301#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36301#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:47,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {36301#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36302#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:47,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {36302#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36302#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:47,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {36302#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36303#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:47,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {36303#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36303#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:47,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {36303#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36304#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:47,486 INFO L290 TraceCheckUtils]: 74: Hoare triple {36304#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36304#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:47,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {36304#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36305#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:47,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {36305#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36305#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:47,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {36305#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36306#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:47,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {36306#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36306#(<= main_~i~0 36)} is VALID [2022-04-28 02:57:47,488 INFO L290 TraceCheckUtils]: 79: Hoare triple {36306#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36307#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:47,488 INFO L290 TraceCheckUtils]: 80: Hoare triple {36307#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36307#(<= main_~i~0 37)} is VALID [2022-04-28 02:57:47,488 INFO L290 TraceCheckUtils]: 81: Hoare triple {36307#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36308#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:47,489 INFO L290 TraceCheckUtils]: 82: Hoare triple {36308#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36308#(<= main_~i~0 38)} is VALID [2022-04-28 02:57:47,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {36308#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36309#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:47,489 INFO L290 TraceCheckUtils]: 84: Hoare triple {36309#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36309#(<= main_~i~0 39)} is VALID [2022-04-28 02:57:47,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {36309#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36310#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:47,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {36310#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36310#(<= main_~i~0 40)} is VALID [2022-04-28 02:57:47,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {36310#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36311#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:47,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {36311#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36311#(<= main_~i~0 41)} is VALID [2022-04-28 02:57:47,491 INFO L290 TraceCheckUtils]: 89: Hoare triple {36311#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36312#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:47,491 INFO L290 TraceCheckUtils]: 90: Hoare triple {36312#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36312#(<= main_~i~0 42)} is VALID [2022-04-28 02:57:47,491 INFO L290 TraceCheckUtils]: 91: Hoare triple {36312#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36313#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:47,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {36313#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36313#(<= main_~i~0 43)} is VALID [2022-04-28 02:57:47,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {36313#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36314#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:47,492 INFO L290 TraceCheckUtils]: 94: Hoare triple {36314#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36314#(<= main_~i~0 44)} is VALID [2022-04-28 02:57:47,492 INFO L290 TraceCheckUtils]: 95: Hoare triple {36314#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36315#(<= main_~i~0 45)} is VALID [2022-04-28 02:57:47,492 INFO L290 TraceCheckUtils]: 96: Hoare triple {36315#(<= main_~i~0 45)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L290 TraceCheckUtils]: 97: Hoare triple {36266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L272 TraceCheckUtils]: 98: Hoare triple {36266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-28 02:57:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046896537] [2022-04-28 02:57:47,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046896537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954088696] [2022-04-28 02:57:47,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:47,495 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:47,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 02:58:12,116 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-28 02:58:12,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:12,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 02:58:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:12,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:12,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {36265#true} call ULTIMATE.init(); {36265#true} is VALID [2022-04-28 02:58:12,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {36265#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(12, 2); {36265#true} is VALID [2022-04-28 02:58:12,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-28 02:58:12,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-28 02:58:12,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-28 02:58:12,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {36265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {36335#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:12,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {36335#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36335#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:12,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {36335#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36271#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:12,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {36271#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36271#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:12,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {36271#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36272#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:12,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {36272#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36272#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:12,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {36272#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36273#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:12,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {36273#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36273#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:12,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {36273#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36274#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:12,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {36274#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36274#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:12,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {36274#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36275#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:12,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {36275#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36275#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:12,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {36275#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36276#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:12,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {36276#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36276#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:12,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {36276#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36277#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:12,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {36277#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36277#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:12,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {36277#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36278#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:12,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {36278#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36278#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:12,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {36278#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36279#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:12,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {36279#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36279#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:12,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {36279#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36280#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:12,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {36280#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36280#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:12,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {36280#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36281#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:12,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {36281#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36281#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:12,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {36281#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36282#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:12,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {36282#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36282#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:12,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {36282#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36283#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:12,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {36283#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36283#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:12,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {36283#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36284#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:12,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {36284#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36284#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:12,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {36284#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36285#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:12,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {36285#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36285#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:12,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {36285#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36286#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:12,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {36286#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36286#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:12,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {36286#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36287#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:12,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {36287#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36287#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:12,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {36287#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36288#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:12,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {36288#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36288#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:12,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {36288#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36289#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:12,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {36289#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36289#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:12,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {36289#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36290#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:12,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {36290#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36290#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:12,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {36290#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36291#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:12,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {36291#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36291#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:12,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {36291#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36292#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:12,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {36292#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36292#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:12,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {36292#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36293#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:12,710 INFO L290 TraceCheckUtils]: 52: Hoare triple {36293#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36293#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:12,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {36293#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36294#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:12,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {36294#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36294#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:12,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {36294#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36295#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:12,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {36295#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36295#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:12,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {36295#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36296#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:12,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {36296#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36296#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:12,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {36296#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36297#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:12,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {36297#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36297#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:12,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {36297#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36298#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:12,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {36298#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36298#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:12,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {36298#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36299#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:12,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {36299#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36299#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:12,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {36299#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36300#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:12,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {36300#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36300#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:12,714 INFO L290 TraceCheckUtils]: 67: Hoare triple {36300#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36301#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:12,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {36301#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36301#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:12,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {36301#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36302#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:12,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {36302#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36302#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:12,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {36302#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36303#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:12,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {36303#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36303#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:12,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {36303#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36304#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:12,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {36304#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36304#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:12,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {36304#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36305#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:12,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {36305#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36305#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:12,717 INFO L290 TraceCheckUtils]: 77: Hoare triple {36305#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36306#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:12,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {36306#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36306#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:12,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {36306#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36307#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:12,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {36307#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36307#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:12,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {36307#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36308#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:12,718 INFO L290 TraceCheckUtils]: 82: Hoare triple {36308#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36308#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:12,718 INFO L290 TraceCheckUtils]: 83: Hoare triple {36308#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36309#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:12,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {36309#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36309#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:12,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {36309#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36310#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:12,719 INFO L290 TraceCheckUtils]: 86: Hoare triple {36310#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36310#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:12,719 INFO L290 TraceCheckUtils]: 87: Hoare triple {36310#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36311#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:12,720 INFO L290 TraceCheckUtils]: 88: Hoare triple {36311#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36311#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:12,720 INFO L290 TraceCheckUtils]: 89: Hoare triple {36311#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36312#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:12,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {36312#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36312#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:12,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {36312#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36313#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:12,721 INFO L290 TraceCheckUtils]: 92: Hoare triple {36313#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36313#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:12,721 INFO L290 TraceCheckUtils]: 93: Hoare triple {36313#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36314#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:12,721 INFO L290 TraceCheckUtils]: 94: Hoare triple {36314#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36314#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 95: Hoare triple {36314#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36315#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 96: Hoare triple {36315#(<= main_~i~0 45)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 97: Hoare triple {36266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {36266#false} is VALID [2022-04-28 02:58:12,722 INFO L272 TraceCheckUtils]: 98: Hoare triple {36266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {36266#false} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-28 02:58:12,722 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-28 02:58:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:12,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:14,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-28 02:58:14,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-28 02:58:14,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-28 02:58:14,989 INFO L272 TraceCheckUtils]: 98: Hoare triple {36266#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {36266#false} is VALID [2022-04-28 02:58:14,989 INFO L290 TraceCheckUtils]: 97: Hoare triple {36266#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {36266#false} is VALID [2022-04-28 02:58:14,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {36639#(< main_~i~0 2048)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-28 02:58:14,990 INFO L290 TraceCheckUtils]: 95: Hoare triple {36643#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36639#(< main_~i~0 2048)} is VALID [2022-04-28 02:58:14,990 INFO L290 TraceCheckUtils]: 94: Hoare triple {36643#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36643#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:14,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {36650#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36643#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:14,991 INFO L290 TraceCheckUtils]: 92: Hoare triple {36650#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36650#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:14,991 INFO L290 TraceCheckUtils]: 91: Hoare triple {36657#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36650#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:14,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {36657#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36657#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:14,992 INFO L290 TraceCheckUtils]: 89: Hoare triple {36664#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36657#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:14,992 INFO L290 TraceCheckUtils]: 88: Hoare triple {36664#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36664#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:14,992 INFO L290 TraceCheckUtils]: 87: Hoare triple {36671#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36664#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:14,993 INFO L290 TraceCheckUtils]: 86: Hoare triple {36671#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36671#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:14,993 INFO L290 TraceCheckUtils]: 85: Hoare triple {36678#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36671#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:14,993 INFO L290 TraceCheckUtils]: 84: Hoare triple {36678#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36678#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:14,993 INFO L290 TraceCheckUtils]: 83: Hoare triple {36685#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36678#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:14,994 INFO L290 TraceCheckUtils]: 82: Hoare triple {36685#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36685#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:14,994 INFO L290 TraceCheckUtils]: 81: Hoare triple {36692#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36685#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:14,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {36692#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36692#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:14,995 INFO L290 TraceCheckUtils]: 79: Hoare triple {36699#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36692#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:14,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {36699#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36699#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:14,995 INFO L290 TraceCheckUtils]: 77: Hoare triple {36706#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36699#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:14,995 INFO L290 TraceCheckUtils]: 76: Hoare triple {36706#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36706#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:14,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {36713#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36706#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:14,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {36713#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36713#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:14,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {36720#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36713#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:14,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {36720#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36720#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:14,997 INFO L290 TraceCheckUtils]: 71: Hoare triple {36727#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36720#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:14,997 INFO L290 TraceCheckUtils]: 70: Hoare triple {36727#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36727#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:14,997 INFO L290 TraceCheckUtils]: 69: Hoare triple {36734#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36727#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:14,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {36734#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36734#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:14,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {36741#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36734#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:14,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {36741#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36741#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:14,999 INFO L290 TraceCheckUtils]: 65: Hoare triple {36748#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36741#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:14,999 INFO L290 TraceCheckUtils]: 64: Hoare triple {36748#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36748#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:14,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {36755#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36748#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:14,999 INFO L290 TraceCheckUtils]: 62: Hoare triple {36755#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36755#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:15,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {36762#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36755#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:15,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {36762#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36762#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:15,000 INFO L290 TraceCheckUtils]: 59: Hoare triple {36769#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36762#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:15,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {36769#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36769#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:15,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {36776#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36769#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:15,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {36776#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36776#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:15,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {36783#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36776#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:15,002 INFO L290 TraceCheckUtils]: 54: Hoare triple {36783#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36783#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:15,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {36790#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36783#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:15,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {36790#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36790#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:15,003 INFO L290 TraceCheckUtils]: 51: Hoare triple {36797#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36790#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:15,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {36797#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36797#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:15,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {36804#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36797#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:15,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {36804#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36804#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:15,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {36811#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36804#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:15,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {36811#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36811#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:15,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {36818#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36811#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:15,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {36818#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36818#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:15,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {36825#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36818#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:15,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {36825#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36825#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:15,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {36832#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36825#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:15,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {36832#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36832#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:15,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {36839#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36832#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:15,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {36839#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36839#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:15,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {36846#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36839#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:15,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {36846#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36846#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:15,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {36853#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36846#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:15,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {36853#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36853#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:15,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {36860#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36853#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:15,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {36860#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36860#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:15,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {36867#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36860#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:15,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {36867#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36867#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:15,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {36874#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36867#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:15,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {36874#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36874#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:15,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {36881#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36874#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:15,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {36881#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36881#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:15,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {36888#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36881#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:15,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {36888#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36888#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:15,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {36895#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36888#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:15,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {36895#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36895#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:15,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {36902#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36895#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:15,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {36902#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36902#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:15,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {36909#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36902#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:15,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {36909#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36909#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:15,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {36916#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36909#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:15,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {36916#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36916#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:15,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {36923#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36916#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:15,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {36923#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36923#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:15,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {36930#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36923#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:15,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {36930#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36930#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:15,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {36937#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36930#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:15,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {36937#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36937#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:15,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {36944#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36937#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:15,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {36944#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36944#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:15,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {36951#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36944#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:15,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {36951#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {36951#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:15,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {36265#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {36951#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:15,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-28 02:58:15,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-28 02:58:15,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-28 02:58:15,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {36265#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(12, 2); {36265#true} is VALID [2022-04-28 02:58:15,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {36265#true} call ULTIMATE.init(); {36265#true} is VALID [2022-04-28 02:58:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:15,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954088696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:15,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 02:58:15,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043681402] [2022-04-28 02:58:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043681402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 02:58:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467490710] [2022-04-28 02:58:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 02:58:15,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:15,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:15,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:15,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 02:58:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:15,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 02:58:15,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 02:58:15,090 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:16,577 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:58:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 02:58:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 02:58:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-28 02:58:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-28 02:58:16,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 112 transitions. [2022-04-28 02:58:16,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:16,675 INFO L225 Difference]: With dead ends: 112 [2022-04-28 02:58:16,675 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 02:58:16,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 02:58:16,677 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 100 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:16,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 29 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:58:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 02:58:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-04-28 02:58:17,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:17,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,184 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:17,185 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:58:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-28 02:58:17,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:17,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:17,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 02:58:17,185 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 02:58:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:17,186 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 02:58:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-28 02:58:17,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:17,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:17,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:17,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-28 02:58:17,187 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2022-04-28 02:58:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:17,187 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-28 02:58:17,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0) internal successors, (98), 48 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 105 transitions. [2022-04-28 02:58:17,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-28 02:58:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 02:58:17,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:17,306 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:17,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:17,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 02:58:17,507 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1315366698, now seen corresponding path program 91 times [2022-04-28 02:58:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:17,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496976723] [2022-04-28 02:58:17,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:17,510 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:17,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1315366698, now seen corresponding path program 92 times [2022-04-28 02:58:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:17,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066329118] [2022-04-28 02:58:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {37765#(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(12, 2); {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {37713#true} call ULTIMATE.init(); {37765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:18,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {37765#(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(12, 2); {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-28 02:58:18,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-28 02:58:18,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {37713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {37718#(= main_~i~0 0)} is VALID [2022-04-28 02:58:18,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {37718#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37718#(= main_~i~0 0)} is VALID [2022-04-28 02:58:18,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {37718#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37719#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {37719#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {37719#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37720#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {37720#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {37720#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37721#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:18,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {37721#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:18,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {37721#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37722#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:18,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {37722#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:18,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {37722#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37723#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:18,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {37723#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:18,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {37723#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37724#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:18,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {37724#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:18,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {37724#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37725#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:18,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {37725#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:18,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {37725#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37726#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:18,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {37726#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:18,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {37726#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37727#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:18,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {37727#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:18,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {37727#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37728#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:18,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {37728#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:18,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {37728#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37729#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:18,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {37729#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:18,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {37729#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37730#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:18,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {37730#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:18,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {37730#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37731#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:18,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {37731#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:18,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {37731#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37732#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:18,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {37732#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:18,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {37732#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37733#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:18,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {37733#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:18,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {37733#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37734#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:18,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {37734#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:18,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {37734#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37735#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:18,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {37735#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:18,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {37735#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37736#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:18,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {37736#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:18,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {37736#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37737#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:18,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {37737#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:18,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {37737#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37738#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:18,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {37738#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:18,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {37738#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37739#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:18,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {37739#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:18,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {37739#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37740#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:18,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {37740#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:18,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {37740#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37741#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:18,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {37741#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:18,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {37741#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37742#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:18,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {37742#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:18,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {37742#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37743#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:18,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {37743#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:18,313 INFO L290 TraceCheckUtils]: 57: Hoare triple {37743#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:18,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {37744#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:18,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {37744#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37745#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:18,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {37745#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:18,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {37745#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37746#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:18,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {37746#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:18,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {37746#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37747#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:18,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {37747#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:18,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {37747#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37748#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:18,316 INFO L290 TraceCheckUtils]: 66: Hoare triple {37748#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:18,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {37748#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37749#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:18,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {37749#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:18,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {37749#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37750#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:18,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {37750#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:18,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {37750#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37751#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:18,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {37751#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:18,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {37751#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37752#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:18,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {37752#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:18,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {37752#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37753#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:18,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {37753#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:18,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {37753#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37754#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:18,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {37754#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:18,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {37754#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37755#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:18,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {37755#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:18,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {37755#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37756#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:18,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {37756#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:18,321 INFO L290 TraceCheckUtils]: 83: Hoare triple {37756#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37757#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:18,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {37757#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:18,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {37757#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37758#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:18,322 INFO L290 TraceCheckUtils]: 86: Hoare triple {37758#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:18,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {37758#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37759#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:18,322 INFO L290 TraceCheckUtils]: 88: Hoare triple {37759#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:18,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {37759#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37760#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:18,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {37760#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:18,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {37760#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37761#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:18,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {37761#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:18,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {37761#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37762#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:18,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {37762#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:18,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {37762#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37763#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:18,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {37763#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {37763#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37764#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 98: Hoare triple {37764#(<= main_~i~0 46)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 99: Hoare triple {37714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {37714#false} is VALID [2022-04-28 02:58:18,325 INFO L272 TraceCheckUtils]: 100: Hoare triple {37714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {37714#false} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-28 02:58:18,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-28 02:58:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066329118] [2022-04-28 02:58:18,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066329118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777184412] [2022-04-28 02:58:18,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:18,327 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:18,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 02:58:18,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:18,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 02:58:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:19,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {37713#true} call ULTIMATE.init(); {37713#true} is VALID [2022-04-28 02:58:19,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {37713#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(12, 2); {37713#true} is VALID [2022-04-28 02:58:19,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-28 02:58:19,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-28 02:58:19,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-28 02:58:19,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {37713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {37784#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:19,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {37784#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37784#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:19,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {37784#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37719#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:19,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {37719#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:19,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {37719#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37720#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:19,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {37720#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:19,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {37720#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37721#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:19,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {37721#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:19,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {37721#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37722#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:19,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {37722#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:19,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {37722#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37723#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:19,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {37723#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:19,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {37723#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37724#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:19,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {37724#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:19,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {37724#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37725#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:19,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {37725#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:19,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {37725#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37726#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:19,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {37726#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:19,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {37726#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37727#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:19,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {37727#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:19,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {37727#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37728#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:19,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {37728#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:19,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {37728#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37729#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:19,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {37729#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:19,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {37729#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37730#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:19,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {37730#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:19,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {37730#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37731#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:19,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {37731#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:19,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {37731#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37732#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:19,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {37732#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:19,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {37732#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37733#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:19,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {37733#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:19,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {37733#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37734#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:19,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {37734#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:19,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {37734#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37735#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:19,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {37735#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:19,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {37735#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37736#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:19,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {37736#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:19,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {37736#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37737#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:19,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {37737#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:19,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {37737#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37738#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:19,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {37738#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:19,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {37738#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37739#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:19,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {37739#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:19,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {37739#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37740#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:19,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {37740#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:19,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {37740#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37741#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:19,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {37741#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:19,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {37741#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37742#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:19,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {37742#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:19,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {37742#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37743#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:19,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {37743#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:19,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {37743#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:19,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {37744#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:19,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {37744#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37745#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:19,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {37745#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:19,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {37745#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37746#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:19,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {37746#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:19,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {37746#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37747#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:19,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {37747#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:19,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {37747#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37748#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:19,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {37748#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:19,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {37748#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37749#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:19,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {37749#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:19,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {37749#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37750#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:19,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {37750#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:19,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {37750#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37751#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:19,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {37751#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:19,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {37751#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37752#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:19,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {37752#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:19,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {37752#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37753#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:19,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {37753#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:19,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {37753#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37754#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:19,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {37754#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:19,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {37754#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37755#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:19,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {37755#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:19,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {37755#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37756#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:19,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {37756#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:19,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {37756#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37757#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:19,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {37757#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:19,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {37757#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37758#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:19,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {37758#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:19,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {37758#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37759#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:19,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {37759#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:19,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {37759#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37760#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:19,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {37760#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:19,175 INFO L290 TraceCheckUtils]: 91: Hoare triple {37760#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37761#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:19,175 INFO L290 TraceCheckUtils]: 92: Hoare triple {37761#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:19,175 INFO L290 TraceCheckUtils]: 93: Hoare triple {37761#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37762#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:19,175 INFO L290 TraceCheckUtils]: 94: Hoare triple {37762#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:19,176 INFO L290 TraceCheckUtils]: 95: Hoare triple {37762#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37763#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:19,176 INFO L290 TraceCheckUtils]: 96: Hoare triple {37763#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:19,176 INFO L290 TraceCheckUtils]: 97: Hoare triple {37763#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37764#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:19,177 INFO L290 TraceCheckUtils]: 98: Hoare triple {37764#(<= main_~i~0 46)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L290 TraceCheckUtils]: 99: Hoare triple {37714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L272 TraceCheckUtils]: 100: Hoare triple {37714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-28 02:58:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:19,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:21,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-28 02:58:21,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-28 02:58:21,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-28 02:58:21,590 INFO L272 TraceCheckUtils]: 100: Hoare triple {37714#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {37714#false} is VALID [2022-04-28 02:58:21,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {37714#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {37714#false} is VALID [2022-04-28 02:58:21,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {38094#(< main_~i~0 2048)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-28 02:58:21,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {38098#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38094#(< main_~i~0 2048)} is VALID [2022-04-28 02:58:21,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {38098#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38098#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:21,591 INFO L290 TraceCheckUtils]: 95: Hoare triple {38105#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38098#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:21,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {38105#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38105#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:21,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {38112#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38105#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:21,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {38112#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38112#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:21,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {38119#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38112#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:21,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {38119#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38119#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:21,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {38126#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38119#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:21,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {38126#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38126#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:21,594 INFO L290 TraceCheckUtils]: 87: Hoare triple {38133#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38126#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:21,594 INFO L290 TraceCheckUtils]: 86: Hoare triple {38133#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38133#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:21,594 INFO L290 TraceCheckUtils]: 85: Hoare triple {38140#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38133#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:21,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {38140#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38140#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:21,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {38147#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38140#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:21,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {38147#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38147#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:21,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {38154#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38147#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:21,596 INFO L290 TraceCheckUtils]: 80: Hoare triple {38154#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38154#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:21,596 INFO L290 TraceCheckUtils]: 79: Hoare triple {38161#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38154#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:21,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {38161#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38161#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:21,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {38168#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38161#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:21,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {38168#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38168#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:21,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {38175#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38168#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:21,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {38175#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38175#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:21,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {38182#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38175#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:21,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {38182#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38182#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:21,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {38189#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38182#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:21,599 INFO L290 TraceCheckUtils]: 70: Hoare triple {38189#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38189#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:21,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {38196#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38189#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:21,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {38196#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38196#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:21,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {38203#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38196#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:21,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {38203#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38203#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:21,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {38210#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38203#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:21,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {38210#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38210#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:21,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {38217#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38210#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:21,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {38217#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38217#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:21,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {38224#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38217#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:21,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {38224#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38224#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:21,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {38231#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38224#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:21,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {38231#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38231#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:21,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {38238#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38231#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:21,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {38238#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38238#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:21,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {38245#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38238#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:21,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {38245#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38245#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:21,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {38252#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38245#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:21,604 INFO L290 TraceCheckUtils]: 52: Hoare triple {38252#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38252#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:21,604 INFO L290 TraceCheckUtils]: 51: Hoare triple {38259#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38252#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:21,604 INFO L290 TraceCheckUtils]: 50: Hoare triple {38259#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38259#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:21,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {38266#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38259#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:21,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {38266#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38266#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:21,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {38273#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38266#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:21,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {38273#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38273#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:21,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {38280#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38273#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:21,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {38280#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38280#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:21,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {38287#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38280#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:21,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {38287#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38287#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:21,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {38294#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38287#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:21,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {38294#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38294#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:21,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {38301#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38294#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:21,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {38301#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38301#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:21,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {38308#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38301#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:21,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {38308#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38308#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:21,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {38315#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38308#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:21,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {38315#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38315#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:21,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {38322#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38315#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:21,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {38322#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38322#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:21,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {38329#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38322#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:21,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {38329#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38329#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:21,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {38336#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38329#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:21,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {38336#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38336#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:21,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {38343#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38336#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:21,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {38343#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38343#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:21,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {38350#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38343#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:21,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {38350#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38350#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:21,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {38357#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38350#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:21,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {38357#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38357#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:21,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {38364#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38357#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:21,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {38364#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38364#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:21,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {38371#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38364#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:21,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {38371#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38371#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:21,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {38378#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38371#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:21,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {38378#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38378#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:21,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {38385#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38378#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:21,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {38385#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38385#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:21,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {38392#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38385#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:21,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {38392#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38392#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:21,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {38399#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38392#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:21,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {38399#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38399#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:21,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {38406#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38399#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:21,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {38406#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38406#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:21,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {38413#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38406#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:21,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {38413#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {38413#(< main_~i~0 2002)} is VALID [2022-04-28 02:58:21,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {37713#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {38413#(< main_~i~0 2002)} is VALID [2022-04-28 02:58:21,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-28 02:58:21,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-28 02:58:21,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-28 02:58:21,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {37713#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(12, 2); {37713#true} is VALID [2022-04-28 02:58:21,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {37713#true} call ULTIMATE.init(); {37713#true} is VALID [2022-04-28 02:58:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:21,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777184412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:21,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:21,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 02:58:21,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:21,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496976723] [2022-04-28 02:58:21,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496976723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:21,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:21,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 02:58:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786714027] [2022-04-28 02:58:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-28 02:58:21,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:21,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:21,681 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 02:58:21,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 02:58:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 02:58:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 02:58:21,683 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:23,251 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:58:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 02:58:23,251 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-28 02:58:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-28 02:58:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-28 02:58:23,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 114 transitions. [2022-04-28 02:58:23,328 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 02:58:23,329 INFO L225 Difference]: With dead ends: 114 [2022-04-28 02:58:23,329 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 02:58:23,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 02:58:23,331 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:23,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 39 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:58:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 02:58:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-28 02:58:23,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:23,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,749 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,749 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:23,749 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:58:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-28 02:58:23,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:23,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:23,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 02:58:23,750 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 02:58:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:23,751 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 02:58:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-28 02:58:23,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:23,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:23,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:23,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-04-28 02:58:23,752 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2022-04-28 02:58:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:23,752 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-04-28 02:58:23,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 107 transitions. [2022-04-28 02:58:23,877 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 02:58:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-28 02:58:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 02:58:23,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:23,878 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:23,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 02:58:24,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:24,079 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2073868152, now seen corresponding path program 93 times [2022-04-28 02:58:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:24,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086017391] [2022-04-28 02:58:24,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:24,081 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:24,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2073868152, now seen corresponding path program 94 times [2022-04-28 02:58:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:24,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005292690] [2022-04-28 02:58:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:24,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {39242#(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(12, 2); {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {39189#true} call ULTIMATE.init(); {39242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:24,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {39242#(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(12, 2); {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-28 02:58:24,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-28 02:58:24,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {39189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {39194#(= main_~i~0 0)} is VALID [2022-04-28 02:58:24,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {39194#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39194#(= main_~i~0 0)} is VALID [2022-04-28 02:58:24,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {39194#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39195#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:24,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {39195#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39195#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:24,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {39195#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39196#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:24,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {39196#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39196#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:24,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {39196#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39197#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:24,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {39197#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39197#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:24,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {39197#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39198#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:24,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {39198#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39198#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:24,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {39198#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39199#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:24,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {39199#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39199#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:24,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {39199#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39200#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:24,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {39200#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39200#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:24,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {39200#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39201#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:24,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {39201#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39201#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:24,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {39201#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39202#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:24,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {39202#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39202#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:24,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {39202#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39203#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:24,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {39203#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39203#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:24,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {39203#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39204#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:24,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {39204#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39204#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:24,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {39204#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39205#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:24,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {39205#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39205#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:24,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {39205#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39206#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:24,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {39206#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39206#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:24,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {39206#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39207#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:24,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {39207#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39207#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:24,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {39207#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39208#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:24,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {39208#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39208#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:24,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {39208#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39209#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:24,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {39209#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39209#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:24,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {39209#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39210#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:24,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {39210#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39210#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:24,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {39210#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39211#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:24,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {39211#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39211#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:24,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {39211#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39212#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:24,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {39212#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39212#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:24,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {39212#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39213#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:24,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {39213#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39213#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:24,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {39213#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39214#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:24,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {39214#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39214#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:24,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {39214#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39215#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:24,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {39215#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39215#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:24,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {39215#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39216#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:24,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {39216#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39216#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:24,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {39216#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39217#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:24,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {39217#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39217#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:24,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {39217#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39218#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:24,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {39218#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39218#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:24,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {39218#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39219#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:24,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {39219#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39219#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:24,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {39219#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39220#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:24,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {39220#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39220#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:24,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {39220#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39221#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:24,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {39221#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39221#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:24,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {39221#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39222#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:24,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {39222#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39222#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:24,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {39222#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39223#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:24,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {39223#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39223#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:24,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {39223#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39224#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:24,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {39224#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39224#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:24,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {39224#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39225#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:24,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {39225#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39225#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:24,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {39225#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39226#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:24,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {39226#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39226#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:24,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {39226#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39227#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:24,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {39227#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39227#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:24,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {39227#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39228#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:24,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {39228#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39228#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:24,911 INFO L290 TraceCheckUtils]: 75: Hoare triple {39228#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39229#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:24,911 INFO L290 TraceCheckUtils]: 76: Hoare triple {39229#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39229#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:24,911 INFO L290 TraceCheckUtils]: 77: Hoare triple {39229#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39230#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:24,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {39230#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39230#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:24,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {39230#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39231#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:24,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {39231#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39231#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:24,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {39231#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39232#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:24,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {39232#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39232#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:24,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {39232#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39233#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:24,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {39233#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39233#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:24,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {39233#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39234#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:24,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {39234#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39234#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:24,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {39234#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39235#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:24,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {39235#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39235#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:24,915 INFO L290 TraceCheckUtils]: 89: Hoare triple {39235#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39236#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:24,915 INFO L290 TraceCheckUtils]: 90: Hoare triple {39236#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39236#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:24,915 INFO L290 TraceCheckUtils]: 91: Hoare triple {39236#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39237#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:24,915 INFO L290 TraceCheckUtils]: 92: Hoare triple {39237#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39237#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:24,916 INFO L290 TraceCheckUtils]: 93: Hoare triple {39237#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39238#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:24,916 INFO L290 TraceCheckUtils]: 94: Hoare triple {39238#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39238#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:24,916 INFO L290 TraceCheckUtils]: 95: Hoare triple {39238#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39239#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:24,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {39239#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39239#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:24,917 INFO L290 TraceCheckUtils]: 97: Hoare triple {39239#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39240#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:24,917 INFO L290 TraceCheckUtils]: 98: Hoare triple {39240#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39240#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:24,917 INFO L290 TraceCheckUtils]: 99: Hoare triple {39240#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39241#(<= main_~i~0 47)} is VALID [2022-04-28 02:58:24,918 INFO L290 TraceCheckUtils]: 100: Hoare triple {39241#(<= main_~i~0 47)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L290 TraceCheckUtils]: 101: Hoare triple {39190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L272 TraceCheckUtils]: 102: Hoare triple {39190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-28 02:58:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005292690] [2022-04-28 02:58:24,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005292690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840482103] [2022-04-28 02:58:24,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:24,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:24,920 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:24,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 02:58:25,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:25,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:25,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 02:58:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:25,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {39189#true} call ULTIMATE.init(); {39189#true} is VALID [2022-04-28 02:58:25,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {39189#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(12, 2); {39189#true} is VALID [2022-04-28 02:58:25,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-28 02:58:25,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-28 02:58:25,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-28 02:58:25,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {39189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {39261#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:25,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {39261#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39261#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:25,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {39261#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39195#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:25,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {39195#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39195#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:25,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {39195#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39196#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:25,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {39196#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39196#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:25,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {39196#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39197#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:25,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {39197#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39197#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:25,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {39197#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39198#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:25,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {39198#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39198#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:25,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {39198#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39199#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:25,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {39199#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39199#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:25,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {39199#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39200#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:25,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {39200#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39200#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:25,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {39200#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39201#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:25,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {39201#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39201#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:25,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {39201#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39202#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:25,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {39202#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39202#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:25,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {39202#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39203#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:25,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {39203#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39203#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:25,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {39203#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39204#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:25,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {39204#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39204#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:25,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {39204#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39205#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:25,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {39205#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39205#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:25,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {39205#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39206#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:25,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {39206#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39206#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:25,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {39206#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39207#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:25,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {39207#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39207#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:25,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {39207#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39208#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:25,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {39208#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39208#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:25,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {39208#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39209#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:25,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {39209#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39209#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:25,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {39209#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39210#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:25,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {39210#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39210#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:25,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {39210#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39211#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:25,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {39211#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39211#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:25,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {39211#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39212#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:25,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {39212#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39212#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:25,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {39212#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39213#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:25,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {39213#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39213#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:25,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {39213#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39214#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:25,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {39214#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39214#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:25,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {39214#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39215#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:25,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {39215#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39215#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:25,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {39215#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39216#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:25,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {39216#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39216#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:25,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {39216#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39217#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:25,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {39217#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39217#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:25,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {39217#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39218#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:25,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {39218#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39218#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:25,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {39218#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39219#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:25,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {39219#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39219#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:25,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {39219#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39220#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:25,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {39220#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39220#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:25,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {39220#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39221#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:25,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {39221#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39221#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:25,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {39221#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39222#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:25,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {39222#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39222#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:25,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {39222#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39223#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:25,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {39223#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39223#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:25,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {39223#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39224#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:25,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {39224#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39224#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:25,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {39224#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39225#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:25,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {39225#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39225#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:25,792 INFO L290 TraceCheckUtils]: 69: Hoare triple {39225#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39226#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:25,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {39226#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39226#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:25,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {39226#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39227#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:25,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {39227#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39227#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:25,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {39227#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39228#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:25,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {39228#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39228#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:25,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {39228#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39229#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:25,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {39229#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39229#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:25,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {39229#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39230#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:25,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {39230#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39230#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:25,795 INFO L290 TraceCheckUtils]: 79: Hoare triple {39230#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39231#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:25,795 INFO L290 TraceCheckUtils]: 80: Hoare triple {39231#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39231#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:25,795 INFO L290 TraceCheckUtils]: 81: Hoare triple {39231#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39232#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:25,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {39232#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39232#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:25,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {39232#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39233#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:25,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {39233#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39233#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:25,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {39233#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39234#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:25,797 INFO L290 TraceCheckUtils]: 86: Hoare triple {39234#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39234#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:25,797 INFO L290 TraceCheckUtils]: 87: Hoare triple {39234#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39235#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:25,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {39235#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39235#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:25,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {39235#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39236#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:25,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {39236#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39236#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:25,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {39236#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39237#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:25,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {39237#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39237#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:25,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {39237#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39238#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:25,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {39238#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39238#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:25,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {39238#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39239#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:25,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {39239#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39239#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:25,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {39239#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39240#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:25,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {39240#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39240#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:25,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {39240#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39241#(<= main_~i~0 47)} is VALID [2022-04-28 02:58:25,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {39241#(<= main_~i~0 47)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L290 TraceCheckUtils]: 101: Hoare triple {39190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L272 TraceCheckUtils]: 102: Hoare triple {39190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-28 02:58:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:25,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:28,270 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-28 02:58:28,270 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-28 02:58:28,270 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-28 02:58:28,270 INFO L272 TraceCheckUtils]: 102: Hoare triple {39190#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {39190#false} is VALID [2022-04-28 02:58:28,270 INFO L290 TraceCheckUtils]: 101: Hoare triple {39190#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {39190#false} is VALID [2022-04-28 02:58:28,271 INFO L290 TraceCheckUtils]: 100: Hoare triple {39577#(< main_~i~0 2048)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-28 02:58:28,271 INFO L290 TraceCheckUtils]: 99: Hoare triple {39581#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39577#(< main_~i~0 2048)} is VALID [2022-04-28 02:58:28,271 INFO L290 TraceCheckUtils]: 98: Hoare triple {39581#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39581#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:28,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {39588#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39581#(< main_~i~0 2047)} is VALID [2022-04-28 02:58:28,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {39588#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39588#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:28,272 INFO L290 TraceCheckUtils]: 95: Hoare triple {39595#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39588#(< main_~i~0 2046)} is VALID [2022-04-28 02:58:28,272 INFO L290 TraceCheckUtils]: 94: Hoare triple {39595#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39595#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:28,273 INFO L290 TraceCheckUtils]: 93: Hoare triple {39602#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39595#(< main_~i~0 2045)} is VALID [2022-04-28 02:58:28,273 INFO L290 TraceCheckUtils]: 92: Hoare triple {39602#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39602#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:28,273 INFO L290 TraceCheckUtils]: 91: Hoare triple {39609#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39602#(< main_~i~0 2044)} is VALID [2022-04-28 02:58:28,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {39609#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39609#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:28,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {39616#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39609#(< main_~i~0 2043)} is VALID [2022-04-28 02:58:28,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {39616#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39616#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:28,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {39623#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39616#(< main_~i~0 2042)} is VALID [2022-04-28 02:58:28,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {39623#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39623#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:28,275 INFO L290 TraceCheckUtils]: 85: Hoare triple {39630#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39623#(< main_~i~0 2041)} is VALID [2022-04-28 02:58:28,275 INFO L290 TraceCheckUtils]: 84: Hoare triple {39630#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39630#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:28,276 INFO L290 TraceCheckUtils]: 83: Hoare triple {39637#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39630#(< main_~i~0 2040)} is VALID [2022-04-28 02:58:28,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {39637#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39637#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:28,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {39644#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39637#(< main_~i~0 2039)} is VALID [2022-04-28 02:58:28,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {39644#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39644#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:28,277 INFO L290 TraceCheckUtils]: 79: Hoare triple {39651#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39644#(< main_~i~0 2038)} is VALID [2022-04-28 02:58:28,277 INFO L290 TraceCheckUtils]: 78: Hoare triple {39651#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39651#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:28,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {39658#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39651#(< main_~i~0 2037)} is VALID [2022-04-28 02:58:28,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {39658#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39658#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:28,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {39665#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39658#(< main_~i~0 2036)} is VALID [2022-04-28 02:58:28,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {39665#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39665#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:28,279 INFO L290 TraceCheckUtils]: 73: Hoare triple {39672#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39665#(< main_~i~0 2035)} is VALID [2022-04-28 02:58:28,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {39672#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39672#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:28,279 INFO L290 TraceCheckUtils]: 71: Hoare triple {39679#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39672#(< main_~i~0 2034)} is VALID [2022-04-28 02:58:28,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {39679#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39679#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:28,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {39686#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39679#(< main_~i~0 2033)} is VALID [2022-04-28 02:58:28,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {39686#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39686#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:28,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {39693#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39686#(< main_~i~0 2032)} is VALID [2022-04-28 02:58:28,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {39693#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39693#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:28,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {39700#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39693#(< main_~i~0 2031)} is VALID [2022-04-28 02:58:28,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {39700#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39700#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:28,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {39707#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39700#(< main_~i~0 2030)} is VALID [2022-04-28 02:58:28,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {39707#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39707#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:28,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {39714#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39707#(< main_~i~0 2029)} is VALID [2022-04-28 02:58:28,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {39714#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39714#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:28,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {39721#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39714#(< main_~i~0 2028)} is VALID [2022-04-28 02:58:28,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {39721#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39721#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:28,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {39728#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39721#(< main_~i~0 2027)} is VALID [2022-04-28 02:58:28,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {39728#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39728#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {39735#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39728#(< main_~i~0 2026)} is VALID [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {39735#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39735#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {39742#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39735#(< main_~i~0 2025)} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {39742#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39742#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {39749#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39742#(< main_~i~0 2024)} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {39749#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39749#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {39756#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39749#(< main_~i~0 2023)} is VALID [2022-04-28 02:58:28,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {39756#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39756#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:28,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {39763#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39756#(< main_~i~0 2022)} is VALID [2022-04-28 02:58:28,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {39763#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39763#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {39770#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39763#(< main_~i~0 2021)} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {39770#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39770#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {39777#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39770#(< main_~i~0 2020)} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {39777#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39777#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:28,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {39784#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39777#(< main_~i~0 2019)} is VALID [2022-04-28 02:58:28,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {39784#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39784#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:28,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {39791#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39784#(< main_~i~0 2018)} is VALID [2022-04-28 02:58:28,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {39791#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39791#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:28,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {39798#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39791#(< main_~i~0 2017)} is VALID [2022-04-28 02:58:28,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {39798#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39798#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {39805#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39798#(< main_~i~0 2016)} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {39805#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39805#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {39812#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39805#(< main_~i~0 2015)} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {39812#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39812#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:28,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {39819#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39812#(< main_~i~0 2014)} is VALID [2022-04-28 02:58:28,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {39819#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39819#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:28,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {39826#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39819#(< main_~i~0 2013)} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {39826#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39826#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {39833#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39826#(< main_~i~0 2012)} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {39833#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39833#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {39840#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39833#(< main_~i~0 2011)} is VALID [2022-04-28 02:58:28,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {39840#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39840#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:28,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {39847#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39840#(< main_~i~0 2010)} is VALID [2022-04-28 02:58:28,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {39847#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39847#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {39854#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39847#(< main_~i~0 2009)} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {39854#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39854#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {39861#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39854#(< main_~i~0 2008)} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {39861#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39861#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {39868#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39861#(< main_~i~0 2007)} is VALID [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {39868#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39868#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {39875#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39868#(< main_~i~0 2006)} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {39875#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39875#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {39882#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39875#(< main_~i~0 2005)} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {39882#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39882#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {39889#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39882#(< main_~i~0 2004)} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {39889#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39889#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {39896#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39889#(< main_~i~0 2003)} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {39896#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39896#(< main_~i~0 2002)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {39903#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39896#(< main_~i~0 2002)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {39903#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {39903#(< main_~i~0 2001)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {39189#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {39903#(< main_~i~0 2001)} is VALID [2022-04-28 02:58:28,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-28 02:58:28,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {39189#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(12, 2); {39189#true} is VALID [2022-04-28 02:58:28,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {39189#true} call ULTIMATE.init(); {39189#true} is VALID [2022-04-28 02:58:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:28,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840482103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:28,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:28,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-28 02:58:28,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:28,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086017391] [2022-04-28 02:58:28,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086017391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:28,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:28,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 02:58:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648009234] [2022-04-28 02:58:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:28,300 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 02:58:28,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:28,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:28,362 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 02:58:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 02:58:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 02:58:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:58:28,363 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:29,993 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:58:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 02:58:29,993 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 02:58:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-28 02:58:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-28 02:58:29,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 116 transitions. [2022-04-28 02:58:30,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:30,076 INFO L225 Difference]: With dead ends: 116 [2022-04-28 02:58:30,076 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 02:58:30,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=9606, Invalid=12150, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 02:58:30,077 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:30,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 39 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:58:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 02:58:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-28 02:58:30,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:30,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:30,560 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:30,560 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:30,561 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:58:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-28 02:58:30,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:30,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:30,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 02:58:30,561 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 02:58:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:30,562 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 02:58:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-28 02:58:30,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:30,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:30,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:30,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-04-28 02:58:30,563 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2022-04-28 02:58:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:30,564 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-04-28 02:58:30,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:30,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 109 transitions. [2022-04-28 02:58:30,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-28 02:58:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 02:58:30,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:30,685 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:30,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:30,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 02:58:30,886 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -751618662, now seen corresponding path program 95 times [2022-04-28 02:58:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:30,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875503408] [2022-04-28 02:58:30,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:30,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:30,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash -751618662, now seen corresponding path program 96 times [2022-04-28 02:58:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649625641] [2022-04-28 02:58:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:31,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {40747#(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(12, 2); {40693#true} is VALID [2022-04-28 02:58:31,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-28 02:58:31,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-28 02:58:31,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {40693#true} call ULTIMATE.init(); {40747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:31,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {40747#(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(12, 2); {40693#true} is VALID [2022-04-28 02:58:31,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-28 02:58:31,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-28 02:58:31,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-28 02:58:31,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {40693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {40698#(= main_~i~0 0)} is VALID [2022-04-28 02:58:31,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {40698#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40698#(= main_~i~0 0)} is VALID [2022-04-28 02:58:31,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {40698#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40699#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:31,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {40699#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40699#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:31,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {40699#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40700#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:31,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {40700#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40700#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:31,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {40700#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40701#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:31,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {40701#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40701#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:31,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {40701#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40702#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:31,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {40702#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40702#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:31,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {40702#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40703#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:31,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {40703#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40703#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:31,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {40703#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40704#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:31,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {40704#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40704#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:31,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {40704#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40705#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:31,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {40705#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40705#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:31,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {40705#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40706#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:31,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {40706#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40706#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:31,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {40706#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40707#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:31,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {40707#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40707#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:31,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {40707#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40708#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:31,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {40708#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40708#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:31,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {40708#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40709#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:31,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {40709#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40709#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:31,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {40709#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40710#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:31,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {40710#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40710#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:31,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {40710#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40711#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:31,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {40711#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40711#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:31,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {40711#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40712#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:31,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {40712#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40712#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:31,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {40712#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40713#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:31,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {40713#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40713#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:31,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {40713#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40714#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:31,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {40714#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40714#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:31,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {40714#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40715#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:31,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {40715#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40715#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:31,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {40715#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40716#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:31,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {40716#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40716#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:31,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {40716#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40717#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:31,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {40717#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40717#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:31,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {40717#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40718#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:31,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {40718#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40718#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:31,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {40718#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40719#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:31,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {40719#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40719#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:31,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {40719#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40720#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:31,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {40720#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40720#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:31,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {40720#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40721#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:31,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {40721#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40721#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:31,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {40721#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40722#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:31,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {40722#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40722#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:31,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {40722#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40723#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:31,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {40723#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40723#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:31,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {40723#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40724#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:31,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {40724#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40724#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:31,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {40724#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40725#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:31,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {40725#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40725#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:31,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {40725#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40726#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:31,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {40726#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40726#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:31,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {40726#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40727#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:31,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {40727#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40727#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:31,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {40727#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40728#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:31,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {40728#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40728#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:31,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {40728#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40729#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:31,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {40729#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40729#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:31,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {40729#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40730#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:31,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {40730#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40730#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:31,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {40730#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40731#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:31,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {40731#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40731#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:31,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {40731#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40732#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:31,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {40732#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40732#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:31,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {40732#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40733#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:31,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {40733#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40733#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:31,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {40733#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40734#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:31,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {40734#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40734#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:31,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {40734#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40735#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:31,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {40735#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40735#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:31,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {40735#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40736#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:31,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {40736#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40736#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:31,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {40736#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40737#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:31,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {40737#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40737#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:31,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {40737#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40738#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:31,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {40738#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40738#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:31,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {40738#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40739#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:31,743 INFO L290 TraceCheckUtils]: 88: Hoare triple {40739#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40739#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:31,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {40739#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40740#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:31,744 INFO L290 TraceCheckUtils]: 90: Hoare triple {40740#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40740#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:31,744 INFO L290 TraceCheckUtils]: 91: Hoare triple {40740#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40741#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:31,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {40741#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40741#(<= main_~i~0 43)} is VALID [2022-04-28 02:58:31,745 INFO L290 TraceCheckUtils]: 93: Hoare triple {40741#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40742#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:31,745 INFO L290 TraceCheckUtils]: 94: Hoare triple {40742#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40742#(<= main_~i~0 44)} is VALID [2022-04-28 02:58:31,745 INFO L290 TraceCheckUtils]: 95: Hoare triple {40742#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40743#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:31,745 INFO L290 TraceCheckUtils]: 96: Hoare triple {40743#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40743#(<= main_~i~0 45)} is VALID [2022-04-28 02:58:31,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {40743#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40744#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:31,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {40744#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40744#(<= main_~i~0 46)} is VALID [2022-04-28 02:58:31,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {40744#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40745#(<= main_~i~0 47)} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 100: Hoare triple {40745#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40745#(<= main_~i~0 47)} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 101: Hoare triple {40745#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40746#(<= main_~i~0 48)} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {40746#(<= main_~i~0 48)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {40694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {40694#false} is VALID [2022-04-28 02:58:31,747 INFO L272 TraceCheckUtils]: 104: Hoare triple {40694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {40694#false} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-28 02:58:31,747 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-28 02:58:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:31,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649625641] [2022-04-28 02:58:31,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649625641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:31,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437608480] [2022-04-28 02:58:31,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:31,749 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:31,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 02:59:03,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2022-04-28 02:59:03,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:03,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 02:59:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:03,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:03,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {40693#true} call ULTIMATE.init(); {40693#true} is VALID [2022-04-28 02:59:03,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {40693#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(12, 2); {40693#true} is VALID [2022-04-28 02:59:03,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-28 02:59:03,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-28 02:59:03,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-28 02:59:03,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {40693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {40766#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:03,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {40766#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40766#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:03,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {40766#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40699#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:03,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {40699#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40699#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:03,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {40699#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40700#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:03,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {40700#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40700#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:03,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {40700#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40701#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:03,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {40701#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40701#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:03,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {40701#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40702#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:03,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {40702#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40702#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:03,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {40702#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40703#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:03,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {40703#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40703#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:03,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {40703#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40704#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:03,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {40704#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40704#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:03,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {40704#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40705#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:03,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {40705#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40705#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:03,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {40705#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40706#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:03,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {40706#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40706#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:03,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {40706#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40707#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:03,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {40707#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40707#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:03,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {40707#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40708#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:03,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {40708#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40708#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:03,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {40708#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40709#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:03,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {40709#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40709#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:03,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {40709#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40710#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:03,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {40710#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40710#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:03,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {40710#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40711#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:03,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {40711#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40711#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:03,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {40711#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40712#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:03,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {40712#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40712#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:03,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {40712#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40713#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:03,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {40713#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40713#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:03,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {40713#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40714#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:03,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {40714#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40714#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:03,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {40714#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40715#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:03,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {40715#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40715#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:03,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {40715#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40716#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:03,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {40716#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40716#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:03,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {40716#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40717#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:03,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {40717#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40717#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:03,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {40717#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40718#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:03,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {40718#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40718#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:03,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {40718#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40719#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:03,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {40719#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40719#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:03,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {40719#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40720#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:03,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {40720#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40720#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:03,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {40720#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40721#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:03,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {40721#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40721#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:03,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {40721#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40722#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:03,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {40722#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40722#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:03,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {40722#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40723#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:03,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {40723#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40723#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:03,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {40723#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40724#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:03,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {40724#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40724#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:03,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {40724#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40725#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:03,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {40725#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40725#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:03,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {40725#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40726#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:03,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {40726#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40726#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:03,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {40726#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40727#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:03,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {40727#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40727#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:03,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {40727#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40728#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:03,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {40728#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40728#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:03,724 INFO L290 TraceCheckUtils]: 67: Hoare triple {40728#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40729#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:03,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {40729#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40729#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:03,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {40729#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40730#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:03,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {40730#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40730#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:03,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {40730#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40731#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:03,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {40731#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40731#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:03,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {40731#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40732#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:03,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {40732#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40732#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:03,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {40732#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40733#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:03,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {40733#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40733#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:03,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {40733#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40734#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:03,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {40734#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40734#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:03,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {40734#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40735#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:03,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {40735#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40735#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:03,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {40735#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40736#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:03,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {40736#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40736#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:03,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {40736#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40737#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:03,729 INFO L290 TraceCheckUtils]: 84: Hoare triple {40737#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40737#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:03,729 INFO L290 TraceCheckUtils]: 85: Hoare triple {40737#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40738#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:03,729 INFO L290 TraceCheckUtils]: 86: Hoare triple {40738#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40738#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:03,729 INFO L290 TraceCheckUtils]: 87: Hoare triple {40738#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40739#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:03,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {40739#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40739#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:03,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {40739#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40740#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:03,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {40740#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40740#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:03,731 INFO L290 TraceCheckUtils]: 91: Hoare triple {40740#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40741#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:03,731 INFO L290 TraceCheckUtils]: 92: Hoare triple {40741#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40741#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:03,731 INFO L290 TraceCheckUtils]: 93: Hoare triple {40741#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40742#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:03,731 INFO L290 TraceCheckUtils]: 94: Hoare triple {40742#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40742#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:03,732 INFO L290 TraceCheckUtils]: 95: Hoare triple {40742#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40743#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:03,732 INFO L290 TraceCheckUtils]: 96: Hoare triple {40743#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40743#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:03,732 INFO L290 TraceCheckUtils]: 97: Hoare triple {40743#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40744#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:03,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {40744#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40744#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:03,733 INFO L290 TraceCheckUtils]: 99: Hoare triple {40744#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40745#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:03,733 INFO L290 TraceCheckUtils]: 100: Hoare triple {40745#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {40745#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:03,733 INFO L290 TraceCheckUtils]: 101: Hoare triple {40745#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40746#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:03,734 INFO L290 TraceCheckUtils]: 102: Hoare triple {40746#(<= main_~i~0 48)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L290 TraceCheckUtils]: 103: Hoare triple {40694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L272 TraceCheckUtils]: 104: Hoare triple {40694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-28 02:59:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:03,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:06,281 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-28 02:59:06,281 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-28 02:59:06,281 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-28 02:59:06,281 INFO L272 TraceCheckUtils]: 104: Hoare triple {40694#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {40694#false} is VALID [2022-04-28 02:59:06,281 INFO L290 TraceCheckUtils]: 103: Hoare triple {40694#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {40694#false} is VALID [2022-04-28 02:59:06,281 INFO L290 TraceCheckUtils]: 102: Hoare triple {41088#(< main_~i~0 2048)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-28 02:59:06,282 INFO L290 TraceCheckUtils]: 101: Hoare triple {41092#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41088#(< main_~i~0 2048)} is VALID [2022-04-28 02:59:06,282 INFO L290 TraceCheckUtils]: 100: Hoare triple {41092#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41092#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:06,282 INFO L290 TraceCheckUtils]: 99: Hoare triple {41099#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41092#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:06,282 INFO L290 TraceCheckUtils]: 98: Hoare triple {41099#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41099#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:06,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {41106#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41099#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:06,283 INFO L290 TraceCheckUtils]: 96: Hoare triple {41106#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41106#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:06,283 INFO L290 TraceCheckUtils]: 95: Hoare triple {41113#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41106#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:06,284 INFO L290 TraceCheckUtils]: 94: Hoare triple {41113#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41113#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:06,284 INFO L290 TraceCheckUtils]: 93: Hoare triple {41120#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41113#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:06,284 INFO L290 TraceCheckUtils]: 92: Hoare triple {41120#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41120#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:06,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {41127#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41120#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:06,285 INFO L290 TraceCheckUtils]: 90: Hoare triple {41127#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41127#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:06,285 INFO L290 TraceCheckUtils]: 89: Hoare triple {41134#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41127#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:06,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {41134#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41134#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:06,286 INFO L290 TraceCheckUtils]: 87: Hoare triple {41141#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41134#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:06,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {41141#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41141#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:06,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {41148#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41141#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:06,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {41148#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41148#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:06,287 INFO L290 TraceCheckUtils]: 83: Hoare triple {41155#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41148#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:06,287 INFO L290 TraceCheckUtils]: 82: Hoare triple {41155#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41155#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:06,287 INFO L290 TraceCheckUtils]: 81: Hoare triple {41162#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41155#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:06,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {41162#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41162#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:06,288 INFO L290 TraceCheckUtils]: 79: Hoare triple {41169#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41162#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:06,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {41169#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41169#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:06,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {41176#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41169#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:06,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {41176#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41176#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:06,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {41183#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41176#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:06,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {41183#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41183#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:06,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {41190#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41183#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:06,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {41190#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41190#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:06,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {41197#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41190#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:06,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {41197#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41197#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:06,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {41204#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41197#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:06,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {41204#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41204#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:06,291 INFO L290 TraceCheckUtils]: 67: Hoare triple {41211#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41204#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:06,291 INFO L290 TraceCheckUtils]: 66: Hoare triple {41211#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41211#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:06,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {41218#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41211#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:06,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {41218#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41218#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:06,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {41225#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41218#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:06,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {41225#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41225#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:06,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {41232#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41225#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:06,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {41232#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41232#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:06,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {41239#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41232#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:06,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {41239#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41239#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:06,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {41246#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41239#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:06,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {41246#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41246#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:06,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {41253#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41246#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:06,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {41253#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41253#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:06,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {41260#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41253#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:06,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {41260#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41260#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:06,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {41267#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41260#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:06,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {41267#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41267#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:06,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {41274#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41267#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:06,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {41274#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41274#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:06,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {41281#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41274#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:06,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {41281#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41281#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:06,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {41288#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41281#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:06,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {41288#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41288#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:06,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {41295#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41288#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:06,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {41295#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41295#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:06,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {41302#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41295#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:06,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {41302#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41302#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:06,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {41309#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41302#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:06,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {41309#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41309#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:06,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {41316#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41309#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:06,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {41316#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41316#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:06,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {41323#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41316#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:06,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {41323#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41323#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:06,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {41330#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41323#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:06,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {41330#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41330#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:06,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {41337#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41330#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:06,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {41337#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41337#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:06,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {41344#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41337#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:06,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {41344#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41344#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:06,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {41351#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41344#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:06,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {41351#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41351#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:06,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {41358#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41351#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:06,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {41358#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41358#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:06,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {41365#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41358#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:06,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {41365#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41365#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:06,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {41372#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41365#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:06,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {41372#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41372#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:06,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {41379#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41372#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:06,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {41379#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41379#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:06,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {41386#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41379#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:06,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {41386#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41386#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:06,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {41393#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41386#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:06,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {41393#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41393#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:06,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {41400#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41393#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:06,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {41400#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41400#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:06,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {41407#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41400#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:06,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {41407#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41407#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:06,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {41414#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41407#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:06,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {41414#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41414#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:06,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {41421#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {41414#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:06,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {41421#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {41421#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:06,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {40693#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {41421#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:06,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-28 02:59:06,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-28 02:59:06,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-28 02:59:06,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {40693#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(12, 2); {40693#true} is VALID [2022-04-28 02:59:06,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {40693#true} call ULTIMATE.init(); {40693#true} is VALID [2022-04-28 02:59:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437608480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:06,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:06,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-28 02:59:06,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:06,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875503408] [2022-04-28 02:59:06,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875503408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:06,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:06,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 02:59:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690774980] [2022-04-28 02:59:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 02:59:06,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:06,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:06,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:06,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 02:59:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 02:59:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 02:59:06,380 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,041 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-28 02:59:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 02:59:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 02:59:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-28 02:59:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-28 02:59:08,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 118 transitions. [2022-04-28 02:59:08,135 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 02:59:08,136 INFO L225 Difference]: With dead ends: 118 [2022-04-28 02:59:08,136 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 02:59:08,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-28 02:59:08,137 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 106 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:08,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 29 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 02:59:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-04-28 02:59:08,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:08,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,592 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,592 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,593 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:59:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-28 02:59:08,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:08,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:08,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-28 02:59:08,593 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 112 states. [2022-04-28 02:59:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:08,594 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 02:59:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-28 02:59:08,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:08,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:08,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:08,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2022-04-28 02:59:08,596 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2022-04-28 02:59:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:08,596 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2022-04-28 02:59:08,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 51 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:08,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 111 transitions. [2022-04-28 02:59:08,735 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 02:59:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-28 02:59:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 02:59:08,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:08,736 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:08,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:08,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 02:59:08,936 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1625115844, now seen corresponding path program 97 times [2022-04-28 02:59:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:08,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815793702] [2022-04-28 02:59:08,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:08,939 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:08,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1625115844, now seen corresponding path program 98 times [2022-04-28 02:59:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:08,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991350066] [2022-04-28 02:59:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:09,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {42280#(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(12, 2); {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {42225#true} call ULTIMATE.init(); {42280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:09,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {42280#(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(12, 2); {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-28 02:59:09,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-28 02:59:09,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {42225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {42230#(= main_~i~0 0)} is VALID [2022-04-28 02:59:09,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {42230#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42230#(= main_~i~0 0)} is VALID [2022-04-28 02:59:09,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {42230#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42231#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:09,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {42231#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42231#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:09,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {42231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42232#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:09,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {42232#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42232#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:09,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {42232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42233#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:09,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {42233#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42233#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:09,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {42233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42234#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:09,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {42234#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42234#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:09,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {42234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42235#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:09,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {42235#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42235#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:09,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {42235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42236#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:09,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {42236#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42236#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:09,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {42236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42237#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:09,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {42237#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42237#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:09,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {42237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42238#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:09,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {42238#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42238#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:09,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {42238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42239#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:09,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {42239#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42239#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:09,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {42239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42240#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:09,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {42240#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42240#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:09,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {42240#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42241#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:09,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {42241#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42241#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:09,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {42241#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42242#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:09,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {42242#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42242#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:09,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {42242#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42243#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:09,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {42243#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42243#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:09,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {42243#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42244#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:09,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {42244#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42244#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:09,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {42244#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:09,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42245#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:09,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42246#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:09,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {42246#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42246#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:09,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {42246#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42247#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:09,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {42247#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42247#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:09,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {42247#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42248#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:09,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {42248#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42248#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:09,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {42248#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42249#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:09,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {42249#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42249#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:09,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {42249#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42250#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:09,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {42250#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42250#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:09,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {42250#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42251#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:09,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {42251#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:09,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {42251#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42252#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:09,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {42252#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:09,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {42252#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42253#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:09,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {42253#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42253#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:09,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {42253#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42254#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:09,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {42254#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42254#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:09,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {42254#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42255#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:09,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {42255#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42255#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:09,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {42255#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42256#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:09,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {42256#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42256#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:09,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {42256#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42257#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:09,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {42257#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42257#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:09,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {42257#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42258#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:09,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {42258#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42258#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:09,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {42258#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42259#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:09,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {42259#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42259#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:09,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {42259#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42260#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:09,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {42260#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42260#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:09,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {42260#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42261#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:09,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {42261#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42261#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:09,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {42261#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42262#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:09,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {42262#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42262#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:09,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {42262#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42263#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:09,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {42263#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42263#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:09,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {42263#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42264#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:09,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {42264#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42264#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:09,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {42264#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42265#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:09,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {42265#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42265#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:09,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {42265#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42266#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:09,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {42266#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42266#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:09,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {42266#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42267#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:09,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {42267#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42267#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:09,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {42267#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42268#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:09,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {42268#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42268#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:09,816 INFO L290 TraceCheckUtils]: 83: Hoare triple {42268#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42269#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:09,816 INFO L290 TraceCheckUtils]: 84: Hoare triple {42269#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42269#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:09,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {42269#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42270#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:09,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {42270#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42270#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:09,817 INFO L290 TraceCheckUtils]: 87: Hoare triple {42270#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42271#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:09,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {42271#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42271#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:09,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {42271#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42272#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:09,818 INFO L290 TraceCheckUtils]: 90: Hoare triple {42272#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42272#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:09,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {42272#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42273#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:09,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {42273#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42273#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:09,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {42273#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42274#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:09,819 INFO L290 TraceCheckUtils]: 94: Hoare triple {42274#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42274#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:09,820 INFO L290 TraceCheckUtils]: 95: Hoare triple {42274#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42275#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:09,820 INFO L290 TraceCheckUtils]: 96: Hoare triple {42275#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42275#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:09,820 INFO L290 TraceCheckUtils]: 97: Hoare triple {42275#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42276#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:09,820 INFO L290 TraceCheckUtils]: 98: Hoare triple {42276#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42276#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:09,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {42276#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42277#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:09,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {42277#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42277#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:09,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {42277#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42278#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:09,821 INFO L290 TraceCheckUtils]: 102: Hoare triple {42278#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42278#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 103: Hoare triple {42278#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42279#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 104: Hoare triple {42279#(<= main_~i~0 49)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 105: Hoare triple {42226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {42226#false} is VALID [2022-04-28 02:59:09,822 INFO L272 TraceCheckUtils]: 106: Hoare triple {42226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {42226#false} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-28 02:59:09,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-28 02:59:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:09,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991350066] [2022-04-28 02:59:09,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991350066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:09,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275523750] [2022-04-28 02:59:09,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:09,824 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:09,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 02:59:10,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:10,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:10,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 02:59:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:10,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:10,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {42225#true} call ULTIMATE.init(); {42225#true} is VALID [2022-04-28 02:59:10,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {42225#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(12, 2); {42225#true} is VALID [2022-04-28 02:59:10,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-28 02:59:10,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-28 02:59:10,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-28 02:59:10,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {42225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {42299#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:10,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {42299#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42299#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:10,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {42299#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42231#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:10,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {42231#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42231#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:10,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {42231#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42232#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:10,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {42232#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42232#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:10,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {42232#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42233#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:10,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {42233#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42233#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:10,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {42233#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42234#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:10,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {42234#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42234#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:10,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {42234#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42235#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:10,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {42235#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42235#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:10,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {42235#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42236#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:10,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {42236#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42236#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:10,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {42236#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42237#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:10,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {42237#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42237#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:10,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {42237#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42238#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:10,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {42238#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42238#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:10,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {42238#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42239#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:10,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {42239#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42239#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:10,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {42239#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42240#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:10,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {42240#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42240#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:10,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {42240#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42241#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:10,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {42241#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42241#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:10,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {42241#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42242#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:10,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {42242#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42242#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:10,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {42242#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42243#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:10,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {42243#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42243#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:10,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {42243#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42244#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:10,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {42244#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42244#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:10,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {42244#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:10,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42245#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:10,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42246#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:10,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {42246#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42246#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:10,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {42246#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42247#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:10,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {42247#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42247#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:10,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {42247#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42248#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:10,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {42248#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42248#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:10,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {42248#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42249#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:10,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {42249#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42249#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:10,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {42249#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42250#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:10,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {42250#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42250#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:10,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {42250#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42251#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:10,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {42251#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:10,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {42251#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42252#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:10,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {42252#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:10,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {42252#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42253#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {42253#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42253#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {42253#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42254#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {42254#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42254#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:10,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {42254#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42255#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:10,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {42255#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42255#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:10,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {42255#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42256#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:10,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {42256#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42256#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:10,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {42256#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42257#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:10,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {42257#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42257#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:10,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {42257#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42258#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:10,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {42258#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42258#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:10,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {42258#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42259#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:10,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {42259#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42259#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:10,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {42259#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42260#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:10,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {42260#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42260#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:10,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {42260#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42261#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:10,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {42261#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42261#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:10,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {42261#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42262#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:10,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {42262#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42262#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:10,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {42262#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42263#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:10,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {42263#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42263#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:10,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {42263#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42264#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:10,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {42264#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42264#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:10,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {42264#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42265#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:10,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {42265#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42265#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:10,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {42265#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42266#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:10,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {42266#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42266#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:10,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {42266#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42267#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:10,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {42267#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42267#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:10,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {42267#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42268#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:10,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {42268#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42268#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:10,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {42268#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42269#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:10,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {42269#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42269#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:10,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {42269#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42270#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:10,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {42270#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42270#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:10,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {42270#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42271#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:10,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {42271#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42271#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:10,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {42271#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42272#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:10,733 INFO L290 TraceCheckUtils]: 90: Hoare triple {42272#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42272#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:10,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {42272#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42273#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:10,734 INFO L290 TraceCheckUtils]: 92: Hoare triple {42273#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42273#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:10,734 INFO L290 TraceCheckUtils]: 93: Hoare triple {42273#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42274#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:10,734 INFO L290 TraceCheckUtils]: 94: Hoare triple {42274#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42274#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:10,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {42274#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42275#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:10,735 INFO L290 TraceCheckUtils]: 96: Hoare triple {42275#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42275#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:10,735 INFO L290 TraceCheckUtils]: 97: Hoare triple {42275#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42276#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:10,735 INFO L290 TraceCheckUtils]: 98: Hoare triple {42276#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42276#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:10,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {42276#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42277#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:10,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {42277#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42277#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:10,736 INFO L290 TraceCheckUtils]: 101: Hoare triple {42277#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42278#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:10,736 INFO L290 TraceCheckUtils]: 102: Hoare triple {42278#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42278#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 103: Hoare triple {42278#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42279#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 104: Hoare triple {42279#(<= main_~i~0 49)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 105: Hoare triple {42226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {42226#false} is VALID [2022-04-28 02:59:10,737 INFO L272 TraceCheckUtils]: 106: Hoare triple {42226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {42226#false} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-28 02:59:10,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-28 02:59:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:10,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:13,368 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L272 TraceCheckUtils]: 106: Hoare triple {42226#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L290 TraceCheckUtils]: 105: Hoare triple {42226#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L290 TraceCheckUtils]: 104: Hoare triple {42627#(< main_~i~0 2048)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-28 02:59:13,369 INFO L290 TraceCheckUtils]: 103: Hoare triple {42631#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42627#(< main_~i~0 2048)} is VALID [2022-04-28 02:59:13,370 INFO L290 TraceCheckUtils]: 102: Hoare triple {42631#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42631#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:13,370 INFO L290 TraceCheckUtils]: 101: Hoare triple {42638#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42631#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:13,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {42638#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42638#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:13,371 INFO L290 TraceCheckUtils]: 99: Hoare triple {42645#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42638#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:13,371 INFO L290 TraceCheckUtils]: 98: Hoare triple {42645#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42645#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:13,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {42652#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42645#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:13,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {42652#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42652#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:13,372 INFO L290 TraceCheckUtils]: 95: Hoare triple {42659#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42652#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:13,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {42659#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42659#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:13,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {42666#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42659#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:13,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {42666#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42666#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:13,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {42673#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42666#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:13,373 INFO L290 TraceCheckUtils]: 90: Hoare triple {42673#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42673#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:13,373 INFO L290 TraceCheckUtils]: 89: Hoare triple {42680#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42673#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:13,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {42680#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42680#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:13,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {42687#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42680#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:13,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {42687#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42687#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:13,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {42694#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42687#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:13,375 INFO L290 TraceCheckUtils]: 84: Hoare triple {42694#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42694#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:13,375 INFO L290 TraceCheckUtils]: 83: Hoare triple {42701#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42694#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:13,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {42701#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42701#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:13,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {42708#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42701#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:13,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {42708#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42708#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:13,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {42715#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42708#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:13,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {42715#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42715#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:13,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {42722#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42715#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:13,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {42722#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42722#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:13,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {42729#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42722#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:13,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {42729#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42729#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:13,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {42736#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42729#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:13,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {42736#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42736#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:13,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {42743#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42736#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:13,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {42743#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42743#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:13,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {42750#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42743#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:13,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {42750#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42750#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:13,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {42757#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42750#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:13,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {42757#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42757#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:13,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {42764#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42757#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:13,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {42764#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42764#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:13,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {42771#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42764#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:13,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {42771#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42771#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:13,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {42778#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42771#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:13,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {42778#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42778#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:13,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {42785#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42778#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:13,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {42785#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42785#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:13,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {42792#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42785#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:13,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {42792#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42792#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:13,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {42799#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42792#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:13,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {42799#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42799#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:13,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {42806#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42799#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:13,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {42806#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42806#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:13,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {42813#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42806#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:13,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {42813#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42813#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:13,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {42820#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42813#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:13,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {42820#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42820#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:13,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {42827#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42820#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:13,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {42827#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42827#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:13,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {42834#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42827#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:13,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {42834#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42834#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:13,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {42841#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42834#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:13,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {42841#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42841#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:13,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {42848#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42841#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:13,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {42848#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42848#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:13,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {42855#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42848#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:13,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {42855#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42855#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:13,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {42862#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42855#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:13,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {42862#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42862#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:13,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {42869#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42862#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:13,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {42869#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42869#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:13,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {42876#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42869#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:13,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {42876#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42876#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:13,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {42883#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42876#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:13,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {42883#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42883#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:13,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {42890#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42883#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:13,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {42890#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42890#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:13,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {42897#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42890#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:13,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {42897#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42897#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:13,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {42904#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42897#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:13,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {42904#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42904#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:13,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {42911#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42904#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:13,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {42911#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42911#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:13,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {42918#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42911#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:13,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {42918#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42918#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:13,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {42925#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42918#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:13,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {42925#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42925#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:13,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {42932#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42925#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:13,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {42932#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42932#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:13,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {42939#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42932#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:13,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {42939#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42939#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:13,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {42946#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42939#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:13,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {42946#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42946#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:13,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {42953#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42946#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:13,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {42953#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42953#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:13,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {42960#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42953#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:13,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {42960#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42960#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:13,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {42967#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42960#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:13,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {42967#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {42967#(< main_~i~0 1999)} is VALID [2022-04-28 02:59:13,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {42225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {42967#(< main_~i~0 1999)} is VALID [2022-04-28 02:59:13,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-28 02:59:13,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-28 02:59:13,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-28 02:59:13,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {42225#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(12, 2); {42225#true} is VALID [2022-04-28 02:59:13,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {42225#true} call ULTIMATE.init(); {42225#true} is VALID [2022-04-28 02:59:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275523750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:13,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 02:59:13,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:13,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815793702] [2022-04-28 02:59:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815793702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:13,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 02:59:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179015613] [2022-04-28 02:59:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 02:59:13,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:13,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:13,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:13,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 02:59:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 02:59:13,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 02:59:13,473 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:15,208 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-28 02:59:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 02:59:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 02:59:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-28 02:59:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-28 02:59:15,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 120 transitions. [2022-04-28 02:59:15,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:15,291 INFO L225 Difference]: With dead ends: 120 [2022-04-28 02:59:15,291 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 02:59:15,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 02:59:15,293 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:15,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 29 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 02:59:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-28 02:59:15,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:15,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,781 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,781 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:15,782 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:59:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-28 02:59:15,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:15,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:15,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:59:15,782 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:59:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:15,783 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 02:59:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-28 02:59:15,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:15,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:15,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:15,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2022-04-28 02:59:15,784 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2022-04-28 02:59:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:15,784 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2022-04-28 02:59:15,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0) internal successors, (106), 52 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:15,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 113 transitions. [2022-04-28 02:59:15,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-28 02:59:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 02:59:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:15,912 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:15,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-28 02:59:16,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:16,113 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 757682270, now seen corresponding path program 99 times [2022-04-28 02:59:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:16,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89186792] [2022-04-28 02:59:16,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:16,115 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:16,115 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash 757682270, now seen corresponding path program 100 times [2022-04-28 02:59:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:16,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087949514] [2022-04-28 02:59:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:17,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {43841#(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(12, 2); {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {43785#true} call ULTIMATE.init(); {43841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:17,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {43841#(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(12, 2); {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-28 02:59:17,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-28 02:59:17,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {43785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {43790#(= main_~i~0 0)} is VALID [2022-04-28 02:59:17,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {43790#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43790#(= main_~i~0 0)} is VALID [2022-04-28 02:59:17,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {43790#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43791#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:17,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {43791#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43791#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:17,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {43791#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43792#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:17,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {43792#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43792#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:17,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {43792#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43793#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:17,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {43793#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43793#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:17,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {43793#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43794#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:17,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {43794#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43794#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:17,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {43794#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43795#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:17,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {43795#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43795#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:17,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {43795#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43796#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:17,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {43796#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43796#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:17,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {43796#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43797#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:17,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {43797#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43797#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:17,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {43797#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43798#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:17,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {43798#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43798#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:17,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {43798#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43799#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:17,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {43799#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43799#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:17,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {43799#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43800#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:17,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {43800#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43800#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:17,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {43800#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43801#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:17,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {43801#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43801#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:17,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {43801#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43802#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:17,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {43802#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43802#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:17,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {43802#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43803#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:17,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {43803#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43803#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:17,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {43803#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43804#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:17,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {43804#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43804#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:17,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {43804#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43805#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:17,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {43805#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43805#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:17,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {43805#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43806#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:17,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {43806#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43806#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:17,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {43806#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43807#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:17,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {43807#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43807#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:17,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {43807#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43808#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:17,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {43808#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43808#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:17,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {43808#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43809#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:17,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {43809#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43809#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:17,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {43809#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43810#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:17,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {43810#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43810#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:17,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {43810#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43811#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:17,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {43811#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43811#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:17,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {43811#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43812#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:17,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {43812#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43812#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:17,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {43812#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43813#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:17,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {43813#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43813#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:17,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {43813#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43814#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:17,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {43814#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43814#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:17,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {43814#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43815#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:17,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {43815#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43815#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:17,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {43815#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43816#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:17,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {43816#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43816#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:17,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {43816#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43817#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:17,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {43817#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43817#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:17,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {43817#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43818#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:17,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {43818#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43818#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:17,076 INFO L290 TraceCheckUtils]: 63: Hoare triple {43818#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43819#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:17,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {43819#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43819#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:17,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {43819#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43820#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:17,076 INFO L290 TraceCheckUtils]: 66: Hoare triple {43820#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43820#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:17,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {43820#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43821#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:17,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {43821#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43821#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:17,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {43821#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43822#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:17,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {43822#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43822#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:17,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {43822#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43823#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:17,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {43823#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43823#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:17,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {43823#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43824#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:17,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {43824#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43824#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:17,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {43824#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43825#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:17,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {43825#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43825#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:17,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {43825#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43826#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:17,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {43826#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43826#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:17,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {43826#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43827#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:17,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {43827#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43827#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:17,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {43827#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43828#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:17,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {43828#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43828#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:17,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {43828#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43829#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:17,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {43829#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43829#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:17,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {43829#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43830#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:17,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {43830#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43830#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:17,082 INFO L290 TraceCheckUtils]: 87: Hoare triple {43830#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43831#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:17,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {43831#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43831#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:17,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {43831#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43832#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:17,083 INFO L290 TraceCheckUtils]: 90: Hoare triple {43832#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43832#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:17,083 INFO L290 TraceCheckUtils]: 91: Hoare triple {43832#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43833#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:17,084 INFO L290 TraceCheckUtils]: 92: Hoare triple {43833#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43833#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:17,084 INFO L290 TraceCheckUtils]: 93: Hoare triple {43833#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43834#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:17,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {43834#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43834#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:17,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {43834#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43835#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:17,085 INFO L290 TraceCheckUtils]: 96: Hoare triple {43835#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43835#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:17,085 INFO L290 TraceCheckUtils]: 97: Hoare triple {43835#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43836#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:17,085 INFO L290 TraceCheckUtils]: 98: Hoare triple {43836#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43836#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:17,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {43836#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43837#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:17,086 INFO L290 TraceCheckUtils]: 100: Hoare triple {43837#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43837#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:17,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {43837#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43838#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:17,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {43838#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43838#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:17,087 INFO L290 TraceCheckUtils]: 103: Hoare triple {43838#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43839#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:17,087 INFO L290 TraceCheckUtils]: 104: Hoare triple {43839#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43839#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:17,087 INFO L290 TraceCheckUtils]: 105: Hoare triple {43839#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43840#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:17,088 INFO L290 TraceCheckUtils]: 106: Hoare triple {43840#(<= main_~i~0 50)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L290 TraceCheckUtils]: 107: Hoare triple {43786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L272 TraceCheckUtils]: 108: Hoare triple {43786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-28 02:59:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:17,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087949514] [2022-04-28 02:59:17,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087949514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:17,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452262681] [2022-04-28 02:59:17,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:59:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:17,091 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:17,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 02:59:17,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:59:17,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:17,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 02:59:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:17,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {43785#true} call ULTIMATE.init(); {43785#true} is VALID [2022-04-28 02:59:17,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {43785#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(12, 2); {43785#true} is VALID [2022-04-28 02:59:17,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-28 02:59:17,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-28 02:59:17,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-28 02:59:17,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {43785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {43860#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:17,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {43860#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43860#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:17,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {43860#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43791#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:17,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {43791#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43791#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:17,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {43791#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43792#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:17,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {43792#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43792#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:17,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {43792#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43793#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:18,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {43793#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43793#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:18,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {43793#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43794#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:18,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {43794#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43794#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:18,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {43794#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43795#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:18,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {43795#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43795#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:18,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {43795#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43796#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:18,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {43796#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43796#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:18,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {43796#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43797#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:18,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {43797#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43797#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:18,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {43797#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43798#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:18,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {43798#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43798#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:18,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {43798#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43799#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:18,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {43799#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43799#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:18,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {43799#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43800#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:18,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {43800#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43800#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:18,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {43800#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43801#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:18,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {43801#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43801#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:18,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {43801#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43802#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:18,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {43802#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43802#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:18,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {43802#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43803#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:18,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {43803#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43803#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:18,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {43803#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43804#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:18,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {43804#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43804#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:18,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {43804#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43805#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:18,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {43805#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43805#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:18,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {43805#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43806#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:18,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {43806#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43806#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:18,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {43806#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43807#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:18,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {43807#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43807#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:18,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {43807#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43808#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:18,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {43808#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43808#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:18,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {43808#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43809#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:18,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {43809#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43809#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:18,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {43809#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43810#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:18,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {43810#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43810#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:18,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {43810#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43811#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:18,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {43811#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43811#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:18,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {43811#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43812#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:18,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {43812#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43812#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:18,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {43812#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43813#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:18,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {43813#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43813#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:18,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {43813#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43814#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:18,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {43814#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43814#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:18,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {43814#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43815#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:18,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {43815#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43815#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:18,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {43815#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43816#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:18,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {43816#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43816#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:18,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {43816#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43817#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:18,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {43817#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43817#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:18,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {43817#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43818#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:18,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {43818#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43818#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:18,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {43818#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43819#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:18,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {43819#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43819#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:18,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {43819#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43820#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:18,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {43820#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43820#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:18,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {43820#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43821#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:18,015 INFO L290 TraceCheckUtils]: 68: Hoare triple {43821#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43821#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:18,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {43821#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43822#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:18,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {43822#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43822#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:18,016 INFO L290 TraceCheckUtils]: 71: Hoare triple {43822#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43823#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:18,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {43823#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43823#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:18,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {43823#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43824#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:18,017 INFO L290 TraceCheckUtils]: 74: Hoare triple {43824#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43824#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:18,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {43824#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43825#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:18,017 INFO L290 TraceCheckUtils]: 76: Hoare triple {43825#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43825#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:18,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {43825#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43826#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:18,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {43826#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43826#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:18,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {43826#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43827#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:18,019 INFO L290 TraceCheckUtils]: 80: Hoare triple {43827#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43827#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:18,019 INFO L290 TraceCheckUtils]: 81: Hoare triple {43827#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43828#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:18,019 INFO L290 TraceCheckUtils]: 82: Hoare triple {43828#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43828#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:18,019 INFO L290 TraceCheckUtils]: 83: Hoare triple {43828#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43829#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:18,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {43829#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43829#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:18,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {43829#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43830#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:18,020 INFO L290 TraceCheckUtils]: 86: Hoare triple {43830#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43830#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:18,021 INFO L290 TraceCheckUtils]: 87: Hoare triple {43830#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43831#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:18,021 INFO L290 TraceCheckUtils]: 88: Hoare triple {43831#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43831#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:18,021 INFO L290 TraceCheckUtils]: 89: Hoare triple {43831#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43832#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:18,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {43832#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43832#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:18,022 INFO L290 TraceCheckUtils]: 91: Hoare triple {43832#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43833#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:18,022 INFO L290 TraceCheckUtils]: 92: Hoare triple {43833#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43833#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:18,022 INFO L290 TraceCheckUtils]: 93: Hoare triple {43833#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43834#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:18,022 INFO L290 TraceCheckUtils]: 94: Hoare triple {43834#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43834#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:18,023 INFO L290 TraceCheckUtils]: 95: Hoare triple {43834#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43835#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:18,023 INFO L290 TraceCheckUtils]: 96: Hoare triple {43835#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43835#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:18,023 INFO L290 TraceCheckUtils]: 97: Hoare triple {43835#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43836#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:18,024 INFO L290 TraceCheckUtils]: 98: Hoare triple {43836#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43836#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:18,024 INFO L290 TraceCheckUtils]: 99: Hoare triple {43836#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43837#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:18,024 INFO L290 TraceCheckUtils]: 100: Hoare triple {43837#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43837#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:18,024 INFO L290 TraceCheckUtils]: 101: Hoare triple {43837#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43838#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:18,025 INFO L290 TraceCheckUtils]: 102: Hoare triple {43838#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43838#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:18,025 INFO L290 TraceCheckUtils]: 103: Hoare triple {43838#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43839#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:18,025 INFO L290 TraceCheckUtils]: 104: Hoare triple {43839#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {43839#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 105: Hoare triple {43839#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {43840#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 106: Hoare triple {43840#(<= main_~i~0 50)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 107: Hoare triple {43786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L272 TraceCheckUtils]: 108: Hoare triple {43786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-28 02:59:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:18,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:20,752 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-28 02:59:20,752 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-28 02:59:20,752 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-28 02:59:20,753 INFO L272 TraceCheckUtils]: 108: Hoare triple {43786#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {43786#false} is VALID [2022-04-28 02:59:20,753 INFO L290 TraceCheckUtils]: 107: Hoare triple {43786#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {43786#false} is VALID [2022-04-28 02:59:20,753 INFO L290 TraceCheckUtils]: 106: Hoare triple {44194#(< main_~i~0 2048)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-28 02:59:20,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {44198#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44194#(< main_~i~0 2048)} is VALID [2022-04-28 02:59:20,753 INFO L290 TraceCheckUtils]: 104: Hoare triple {44198#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44198#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:20,754 INFO L290 TraceCheckUtils]: 103: Hoare triple {44205#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44198#(< main_~i~0 2047)} is VALID [2022-04-28 02:59:20,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {44205#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44205#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:20,754 INFO L290 TraceCheckUtils]: 101: Hoare triple {44212#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44205#(< main_~i~0 2046)} is VALID [2022-04-28 02:59:20,755 INFO L290 TraceCheckUtils]: 100: Hoare triple {44212#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44212#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:20,755 INFO L290 TraceCheckUtils]: 99: Hoare triple {44219#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44212#(< main_~i~0 2045)} is VALID [2022-04-28 02:59:20,755 INFO L290 TraceCheckUtils]: 98: Hoare triple {44219#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44219#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:20,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {44226#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44219#(< main_~i~0 2044)} is VALID [2022-04-28 02:59:20,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {44226#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44226#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:20,756 INFO L290 TraceCheckUtils]: 95: Hoare triple {44233#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44226#(< main_~i~0 2043)} is VALID [2022-04-28 02:59:20,756 INFO L290 TraceCheckUtils]: 94: Hoare triple {44233#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44233#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:20,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {44240#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44233#(< main_~i~0 2042)} is VALID [2022-04-28 02:59:20,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {44240#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44240#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:20,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {44247#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44240#(< main_~i~0 2041)} is VALID [2022-04-28 02:59:20,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {44247#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44247#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:20,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {44254#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44247#(< main_~i~0 2040)} is VALID [2022-04-28 02:59:20,758 INFO L290 TraceCheckUtils]: 88: Hoare triple {44254#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44254#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:20,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {44261#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44254#(< main_~i~0 2039)} is VALID [2022-04-28 02:59:20,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {44261#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44261#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:20,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {44268#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44261#(< main_~i~0 2038)} is VALID [2022-04-28 02:59:20,759 INFO L290 TraceCheckUtils]: 84: Hoare triple {44268#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44268#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:20,760 INFO L290 TraceCheckUtils]: 83: Hoare triple {44275#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44268#(< main_~i~0 2037)} is VALID [2022-04-28 02:59:20,760 INFO L290 TraceCheckUtils]: 82: Hoare triple {44275#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44275#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:20,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {44282#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44275#(< main_~i~0 2036)} is VALID [2022-04-28 02:59:20,760 INFO L290 TraceCheckUtils]: 80: Hoare triple {44282#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44282#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:20,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {44289#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44282#(< main_~i~0 2035)} is VALID [2022-04-28 02:59:20,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {44289#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44289#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:20,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {44296#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44289#(< main_~i~0 2034)} is VALID [2022-04-28 02:59:20,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {44296#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44296#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:20,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {44303#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44296#(< main_~i~0 2033)} is VALID [2022-04-28 02:59:20,762 INFO L290 TraceCheckUtils]: 74: Hoare triple {44303#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44303#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:20,762 INFO L290 TraceCheckUtils]: 73: Hoare triple {44310#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44303#(< main_~i~0 2032)} is VALID [2022-04-28 02:59:20,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {44310#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44310#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:20,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {44317#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44310#(< main_~i~0 2031)} is VALID [2022-04-28 02:59:20,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {44317#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44317#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:20,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {44324#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44317#(< main_~i~0 2030)} is VALID [2022-04-28 02:59:20,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {44324#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44324#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:20,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {44331#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44324#(< main_~i~0 2029)} is VALID [2022-04-28 02:59:20,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {44331#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44331#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:20,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {44338#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44331#(< main_~i~0 2028)} is VALID [2022-04-28 02:59:20,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {44338#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44338#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:20,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {44345#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44338#(< main_~i~0 2027)} is VALID [2022-04-28 02:59:20,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {44345#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44345#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:20,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {44352#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44345#(< main_~i~0 2026)} is VALID [2022-04-28 02:59:20,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {44352#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44352#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:20,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {44359#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44352#(< main_~i~0 2025)} is VALID [2022-04-28 02:59:20,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {44359#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44359#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:20,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {44366#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44359#(< main_~i~0 2024)} is VALID [2022-04-28 02:59:20,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {44366#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44366#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:20,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {44373#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44366#(< main_~i~0 2023)} is VALID [2022-04-28 02:59:20,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {44373#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44373#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:20,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {44380#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44373#(< main_~i~0 2022)} is VALID [2022-04-28 02:59:20,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {44380#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44380#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:20,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {44387#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44380#(< main_~i~0 2021)} is VALID [2022-04-28 02:59:20,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {44387#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44387#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:20,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {44394#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44387#(< main_~i~0 2020)} is VALID [2022-04-28 02:59:20,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {44394#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44394#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:20,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {44401#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44394#(< main_~i~0 2019)} is VALID [2022-04-28 02:59:20,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {44401#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44401#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:20,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {44408#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44401#(< main_~i~0 2018)} is VALID [2022-04-28 02:59:20,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {44408#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44408#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:20,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {44415#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44408#(< main_~i~0 2017)} is VALID [2022-04-28 02:59:20,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {44415#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44415#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:20,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {44422#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44415#(< main_~i~0 2016)} is VALID [2022-04-28 02:59:20,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {44422#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44422#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:20,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {44429#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(< main_~i~0 2015)} is VALID [2022-04-28 02:59:20,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {44429#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44429#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:20,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(< main_~i~0 2014)} is VALID [2022-04-28 02:59:20,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44436#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:20,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {44443#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(< main_~i~0 2013)} is VALID [2022-04-28 02:59:20,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {44443#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44443#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:20,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {44450#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(< main_~i~0 2012)} is VALID [2022-04-28 02:59:20,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {44450#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44450#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:20,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {44457#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(< main_~i~0 2011)} is VALID [2022-04-28 02:59:20,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {44457#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44457#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:20,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {44464#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(< main_~i~0 2010)} is VALID [2022-04-28 02:59:20,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {44464#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44464#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:20,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {44471#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44464#(< main_~i~0 2009)} is VALID [2022-04-28 02:59:20,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {44471#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44471#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:20,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {44478#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44471#(< main_~i~0 2008)} is VALID [2022-04-28 02:59:20,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {44478#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44478#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:20,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {44485#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44478#(< main_~i~0 2007)} is VALID [2022-04-28 02:59:20,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {44485#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44485#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:20,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {44492#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44485#(< main_~i~0 2006)} is VALID [2022-04-28 02:59:20,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {44492#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44492#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:20,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {44499#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44492#(< main_~i~0 2005)} is VALID [2022-04-28 02:59:20,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {44499#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44499#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:20,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {44506#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44499#(< main_~i~0 2004)} is VALID [2022-04-28 02:59:20,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {44506#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44506#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:20,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {44513#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44506#(< main_~i~0 2003)} is VALID [2022-04-28 02:59:20,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {44513#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44513#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:20,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {44520#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44513#(< main_~i~0 2002)} is VALID [2022-04-28 02:59:20,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {44520#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44520#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:20,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {44527#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44520#(< main_~i~0 2001)} is VALID [2022-04-28 02:59:20,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {44527#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44527#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:20,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {44534#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44527#(< main_~i~0 2000)} is VALID [2022-04-28 02:59:20,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {44534#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44534#(< main_~i~0 1999)} is VALID [2022-04-28 02:59:20,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {44541#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44534#(< main_~i~0 1999)} is VALID [2022-04-28 02:59:20,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {44541#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {44541#(< main_~i~0 1998)} is VALID [2022-04-28 02:59:20,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {43785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {44541#(< main_~i~0 1998)} is VALID [2022-04-28 02:59:20,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-28 02:59:20,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-28 02:59:20,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-28 02:59:20,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {43785#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(12, 2); {43785#true} is VALID [2022-04-28 02:59:20,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {43785#true} call ULTIMATE.init(); {43785#true} is VALID [2022-04-28 02:59:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:20,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452262681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:20,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:20,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-28 02:59:20,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89186792] [2022-04-28 02:59:20,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89186792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:20,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:20,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 02:59:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131142268] [2022-04-28 02:59:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 02:59:20,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:20,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:20,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 02:59:20,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 02:59:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:59:20,853 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:22,666 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-28 02:59:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 02:59:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 02:59:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 02:59:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 02:59:22,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 122 transitions. [2022-04-28 02:59:22,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:22,749 INFO L225 Difference]: With dead ends: 122 [2022-04-28 02:59:22,749 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 02:59:22,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=10818, Invalid=13674, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 02:59:22,751 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:22,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 34 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:59:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 02:59:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-28 02:59:23,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:23,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,253 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,253 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:23,254 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:59:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-28 02:59:23,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:23,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:23,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-28 02:59:23,254 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-28 02:59:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:23,255 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 02:59:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-28 02:59:23,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:23,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:23,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:23,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2022-04-28 02:59:23,256 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2022-04-28 02:59:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:23,256 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2022-04-28 02:59:23,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0) internal successors, (108), 53 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 115 transitions. [2022-04-28 02:59:23,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2022-04-28 02:59:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 02:59:23,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:23,390 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:23,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-28 02:59:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 02:59:23,591 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1409101056, now seen corresponding path program 101 times [2022-04-28 02:59:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:23,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1421847345] [2022-04-28 02:59:23,593 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:23,593 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:23,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1409101056, now seen corresponding path program 102 times [2022-04-28 02:59:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:23,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646856233] [2022-04-28 02:59:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {45430#(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(12, 2); {45373#true} is VALID [2022-04-28 02:59:24,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-28 02:59:24,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-28 02:59:24,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {45373#true} call ULTIMATE.init(); {45430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:24,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {45430#(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(12, 2); {45373#true} is VALID [2022-04-28 02:59:24,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-28 02:59:24,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-28 02:59:24,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-28 02:59:24,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {45373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {45378#(= main_~i~0 0)} is VALID [2022-04-28 02:59:24,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {45378#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45378#(= main_~i~0 0)} is VALID [2022-04-28 02:59:24,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {45378#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45379#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:24,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {45379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45379#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:24,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {45379#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45380#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:24,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {45380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45380#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:24,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {45380#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45381#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:24,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {45381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45381#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:24,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {45381#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45382#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:24,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {45382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45382#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:24,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {45382#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45383#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:24,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {45383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45383#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:24,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {45383#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45384#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:24,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {45384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45384#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:24,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {45384#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45385#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:24,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {45385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45385#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:24,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {45385#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45386#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:24,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {45386#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45386#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:24,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {45386#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45387#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:24,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {45387#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45387#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:24,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {45387#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45388#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:24,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {45388#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45388#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:24,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {45388#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45389#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:24,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {45389#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45389#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:24,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {45389#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45390#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:24,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {45390#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45390#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:24,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {45390#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45391#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:24,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {45391#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45391#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:24,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {45391#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45392#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:24,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {45392#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45392#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:24,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {45392#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45393#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:24,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {45393#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45393#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:24,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {45393#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45394#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:24,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {45394#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45394#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:24,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {45394#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45395#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:24,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {45395#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45395#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:24,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {45395#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45396#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:24,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {45396#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45396#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:24,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {45396#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45397#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:24,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {45397#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45397#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:24,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {45397#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45398#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:24,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {45398#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45398#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:24,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {45398#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45399#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:24,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {45399#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45399#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:24,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {45399#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45400#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:24,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {45400#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45400#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:24,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {45400#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45401#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:24,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {45401#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45401#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:24,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {45401#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45402#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:24,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {45402#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45402#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:24,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {45402#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45403#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:24,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {45403#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45403#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:24,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {45403#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45404#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:24,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {45404#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45404#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:24,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {45404#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45405#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:24,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {45405#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45405#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:24,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {45405#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45406#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:24,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {45406#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45406#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:24,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {45406#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45407#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:24,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {45407#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45407#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:24,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {45407#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45408#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:24,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {45408#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45408#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:24,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {45408#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45409#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:24,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {45409#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45409#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:24,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {45409#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45410#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:24,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {45410#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45410#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:24,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {45410#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45411#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:24,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {45411#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45411#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:24,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {45411#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45412#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:24,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {45412#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45412#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:24,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {45412#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45413#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:24,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {45413#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45413#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:24,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {45413#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45414#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:24,523 INFO L290 TraceCheckUtils]: 78: Hoare triple {45414#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45414#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:24,523 INFO L290 TraceCheckUtils]: 79: Hoare triple {45414#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45415#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:24,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {45415#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45415#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:24,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {45415#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45416#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:24,524 INFO L290 TraceCheckUtils]: 82: Hoare triple {45416#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45416#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:24,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {45416#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45417#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:24,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {45417#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45417#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:24,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {45417#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45418#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:24,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {45418#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45418#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:24,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {45418#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45419#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:24,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {45419#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45419#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:24,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {45419#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45420#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:24,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {45420#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45420#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:24,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {45420#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45421#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:24,527 INFO L290 TraceCheckUtils]: 92: Hoare triple {45421#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45421#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:24,527 INFO L290 TraceCheckUtils]: 93: Hoare triple {45421#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45422#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:24,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {45422#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45422#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:24,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {45422#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45423#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:24,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {45423#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45423#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:24,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {45423#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45424#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:24,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {45424#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45424#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:24,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {45424#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45425#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:24,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {45425#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45425#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:24,530 INFO L290 TraceCheckUtils]: 101: Hoare triple {45425#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45426#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:24,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {45426#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45426#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:24,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {45426#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45427#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:24,530 INFO L290 TraceCheckUtils]: 104: Hoare triple {45427#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45427#(<= main_~i~0 49)} is VALID [2022-04-28 02:59:24,531 INFO L290 TraceCheckUtils]: 105: Hoare triple {45427#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45428#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:24,531 INFO L290 TraceCheckUtils]: 106: Hoare triple {45428#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45428#(<= main_~i~0 50)} is VALID [2022-04-28 02:59:24,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {45428#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45429#(<= main_~i~0 51)} is VALID [2022-04-28 02:59:24,532 INFO L290 TraceCheckUtils]: 108: Hoare triple {45429#(<= main_~i~0 51)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L290 TraceCheckUtils]: 109: Hoare triple {45374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L272 TraceCheckUtils]: 110: Hoare triple {45374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-28 02:59:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:24,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646856233] [2022-04-28 02:59:24,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646856233] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:24,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78678161] [2022-04-28 02:59:24,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:24,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:24,534 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:24,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 03:00:13,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2022-04-28 03:00:13,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:13,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 03:00:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:13,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:14,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {45373#true} call ULTIMATE.init(); {45373#true} is VALID [2022-04-28 03:00:14,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {45373#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(12, 2); {45373#true} is VALID [2022-04-28 03:00:14,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-28 03:00:14,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-28 03:00:14,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-28 03:00:14,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {45373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {45449#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:14,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {45449#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45449#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:14,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {45449#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45379#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:14,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {45379#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45379#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:14,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {45379#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45380#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:14,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {45380#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45380#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:14,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {45380#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45381#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:14,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {45381#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45381#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:14,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {45381#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45382#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:14,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {45382#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45382#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:14,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {45382#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45383#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:14,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {45383#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45383#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:14,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {45383#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45384#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:14,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {45384#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45384#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:14,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {45384#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45385#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:14,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {45385#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45385#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:14,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {45385#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45386#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:14,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {45386#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45386#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:14,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {45386#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45387#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:14,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {45387#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45387#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:14,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {45387#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45388#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:14,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {45388#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45388#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:14,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {45388#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45389#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:14,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {45389#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45389#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:14,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {45389#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45390#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:14,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {45390#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45390#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:14,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {45390#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45391#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:14,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {45391#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45391#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:14,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {45391#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45392#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:14,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {45392#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45392#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:14,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {45392#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45393#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:14,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {45393#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45393#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:14,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {45393#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45394#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:14,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {45394#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45394#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:14,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {45394#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45395#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:14,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {45395#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45395#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:14,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {45395#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45396#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:14,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {45396#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45396#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:14,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {45396#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45397#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:14,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {45397#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45397#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:14,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {45397#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45398#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:14,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {45398#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45398#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:14,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {45398#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45399#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:14,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {45399#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45399#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:14,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {45399#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45400#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:14,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {45400#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45400#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:14,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {45400#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45401#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:14,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {45401#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45401#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:14,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {45401#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45402#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:14,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {45402#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45402#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:14,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {45402#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45403#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:14,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {45403#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45403#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:14,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {45403#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45404#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:14,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {45404#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45404#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:14,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {45404#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45405#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:14,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {45405#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45405#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:14,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {45405#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45406#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:14,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {45406#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45406#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:14,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {45406#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45407#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:14,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {45407#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45407#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:14,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {45407#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45408#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:14,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {45408#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45408#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:14,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {45408#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45409#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:14,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {45409#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45409#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:14,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {45409#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45410#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:14,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {45410#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45410#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:14,479 INFO L290 TraceCheckUtils]: 71: Hoare triple {45410#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45411#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:14,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {45411#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45411#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:14,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {45411#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45412#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:14,480 INFO L290 TraceCheckUtils]: 74: Hoare triple {45412#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45412#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:14,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {45412#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45413#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:14,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {45413#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45413#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:14,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {45413#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45414#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:14,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {45414#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45414#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:14,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {45414#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45415#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:14,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {45415#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45415#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:14,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {45415#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45416#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:14,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {45416#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45416#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:14,483 INFO L290 TraceCheckUtils]: 83: Hoare triple {45416#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45417#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:14,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {45417#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45417#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:14,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {45417#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45418#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:14,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {45418#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45418#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:14,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {45418#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45419#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:14,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {45419#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45419#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:14,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {45419#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45420#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:14,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {45420#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45420#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:14,485 INFO L290 TraceCheckUtils]: 91: Hoare triple {45420#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45421#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:14,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {45421#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45421#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:14,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {45421#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45422#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:14,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {45422#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45422#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:14,486 INFO L290 TraceCheckUtils]: 95: Hoare triple {45422#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45423#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:14,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {45423#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45423#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:14,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {45423#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45424#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:14,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {45424#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45424#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:14,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {45424#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45425#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:14,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {45425#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45425#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:14,488 INFO L290 TraceCheckUtils]: 101: Hoare triple {45425#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45426#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:14,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {45426#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45426#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:14,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {45426#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45427#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:14,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {45427#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45427#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:14,489 INFO L290 TraceCheckUtils]: 105: Hoare triple {45427#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45428#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:14,489 INFO L290 TraceCheckUtils]: 106: Hoare triple {45428#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45428#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:14,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {45428#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45429#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:14,490 INFO L290 TraceCheckUtils]: 108: Hoare triple {45429#(<= main_~i~0 51)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L290 TraceCheckUtils]: 109: Hoare triple {45374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L272 TraceCheckUtils]: 110: Hoare triple {45374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-28 03:00:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:14,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:17,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-28 03:00:17,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-28 03:00:17,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-28 03:00:17,381 INFO L272 TraceCheckUtils]: 110: Hoare triple {45374#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {45374#false} is VALID [2022-04-28 03:00:17,381 INFO L290 TraceCheckUtils]: 109: Hoare triple {45374#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {45374#false} is VALID [2022-04-28 03:00:17,381 INFO L290 TraceCheckUtils]: 108: Hoare triple {45789#(< main_~i~0 2048)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-28 03:00:17,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {45793#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45789#(< main_~i~0 2048)} is VALID [2022-04-28 03:00:17,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {45793#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45793#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:17,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {45800#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45793#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:17,383 INFO L290 TraceCheckUtils]: 104: Hoare triple {45800#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45800#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:17,383 INFO L290 TraceCheckUtils]: 103: Hoare triple {45807#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45800#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:17,383 INFO L290 TraceCheckUtils]: 102: Hoare triple {45807#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45807#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:17,384 INFO L290 TraceCheckUtils]: 101: Hoare triple {45814#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45807#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:17,384 INFO L290 TraceCheckUtils]: 100: Hoare triple {45814#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45814#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:17,384 INFO L290 TraceCheckUtils]: 99: Hoare triple {45821#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45814#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:17,384 INFO L290 TraceCheckUtils]: 98: Hoare triple {45821#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45821#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:17,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {45828#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45821#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:17,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {45828#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45828#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:17,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {45835#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45828#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:17,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {45835#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45835#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:17,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {45842#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45835#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:17,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {45842#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45842#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:17,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {45849#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45842#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:17,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {45849#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45849#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:17,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {45856#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45849#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:17,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {45856#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45856#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:17,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {45863#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45856#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:17,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {45863#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45863#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:17,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {45870#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45863#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:17,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {45870#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45870#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:17,389 INFO L290 TraceCheckUtils]: 83: Hoare triple {45877#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45870#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:17,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {45877#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45877#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:17,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {45884#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45877#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:17,390 INFO L290 TraceCheckUtils]: 80: Hoare triple {45884#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45884#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:17,390 INFO L290 TraceCheckUtils]: 79: Hoare triple {45891#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45884#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:17,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {45891#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45891#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:17,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {45898#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45891#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:17,391 INFO L290 TraceCheckUtils]: 76: Hoare triple {45898#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45898#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:17,391 INFO L290 TraceCheckUtils]: 75: Hoare triple {45905#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45898#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:17,391 INFO L290 TraceCheckUtils]: 74: Hoare triple {45905#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45905#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:17,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {45912#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45905#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:17,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {45912#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45912#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:17,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {45919#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45912#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:17,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {45919#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45919#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:17,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {45926#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45919#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:17,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {45926#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45926#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:17,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {45933#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45926#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:17,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {45933#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45933#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:17,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {45940#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45933#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:17,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {45940#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45940#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:17,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {45947#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45940#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:17,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {45947#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45947#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:17,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {45954#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45947#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:17,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {45954#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45954#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:17,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {45961#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45954#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:17,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {45961#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45961#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:17,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {45968#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45961#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:17,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {45968#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45968#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:17,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {45975#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45968#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:17,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {45975#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45975#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:17,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {45982#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45975#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:17,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {45982#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45982#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:17,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {45989#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45982#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:17,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {45989#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45989#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:17,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {45996#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45989#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:17,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {45996#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {45996#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:17,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {46003#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45996#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:17,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {46003#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46003#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:17,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {46010#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46003#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:17,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {46010#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46010#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:17,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {46017#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46010#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:17,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {46017#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46017#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:17,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {46024#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46017#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:17,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {46024#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46024#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:17,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {46031#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46024#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:17,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {46031#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46031#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:17,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {46038#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46031#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:17,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {46038#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46038#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:17,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {46045#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46038#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:17,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {46045#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46045#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:17,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {46052#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46045#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:17,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {46052#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46052#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:17,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {46059#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46052#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:17,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {46059#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46059#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:17,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {46066#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46059#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:17,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {46066#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46066#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:17,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {46073#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46066#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:17,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {46073#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46073#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:17,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {46080#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46073#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:17,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {46080#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46080#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:17,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {46087#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46080#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:17,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {46087#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46087#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:17,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {46094#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46087#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:17,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {46094#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46094#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:17,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {46101#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46094#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:17,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {46101#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46101#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:17,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {46108#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46101#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:17,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {46108#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46108#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:17,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {46115#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46108#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:17,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {46115#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46115#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:17,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {46122#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46115#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:17,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {46122#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46122#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:17,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {46129#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46122#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:17,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {46129#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46129#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:17,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {46136#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46129#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:17,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {46136#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46136#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:17,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {46143#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46136#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:17,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {46143#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46143#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:17,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {45373#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {46143#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:17,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-28 03:00:17,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-28 03:00:17,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-28 03:00:17,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {45373#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(12, 2); {45373#true} is VALID [2022-04-28 03:00:17,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {45373#true} call ULTIMATE.init(); {45373#true} is VALID [2022-04-28 03:00:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:17,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78678161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:17,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:17,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-28 03:00:17,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:17,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1421847345] [2022-04-28 03:00:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1421847345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:17,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:17,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:00:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807784740] [2022-04-28 03:00:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 03:00:17,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:17,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:17,481 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 03:00:17,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:00:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:00:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:00:17,483 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:19,389 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-28 03:00:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:00:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 03:00:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 124 transitions. [2022-04-28 03:00:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 124 transitions. [2022-04-28 03:00:19,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 124 transitions. [2022-04-28 03:00:19,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:19,475 INFO L225 Difference]: With dead ends: 124 [2022-04-28 03:00:19,475 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 03:00:19,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-28 03:00:19,477 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 112 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:19,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 29 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 03:00:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-04-28 03:00:20,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:20,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:20,001 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:20,001 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:20,002 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-28 03:00:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2022-04-28 03:00:20,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:20,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:20,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:00:20,002 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:00:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:20,003 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-28 03:00:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2022-04-28 03:00:20,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:20,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:20,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:20,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0089285714285714) internal successors, (113), 112 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2022-04-28 03:00:20,005 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2022-04-28 03:00:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:20,005 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2022-04-28 03:00:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0) internal successors, (110), 54 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:20,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 117 transitions. [2022-04-28 03:00:20,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2022-04-28 03:00:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 03:00:20,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:20,147 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:20,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-28 03:00:20,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:20,347 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash 357329186, now seen corresponding path program 103 times [2022-04-28 03:00:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:20,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033737977] [2022-04-28 03:00:20,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:20,350 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:20,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash 357329186, now seen corresponding path program 104 times [2022-04-28 03:00:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:20,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515152080] [2022-04-28 03:00:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:21,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {47047#(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(12, 2); {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {46989#true} call ULTIMATE.init(); {47047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:21,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {47047#(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(12, 2); {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-28 03:00:21,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-28 03:00:21,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {46989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {46994#(= main_~i~0 0)} is VALID [2022-04-28 03:00:21,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {46994#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46994#(= main_~i~0 0)} is VALID [2022-04-28 03:00:21,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {46994#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46995#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:21,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {46995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46995#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:21,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {46995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46996#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:21,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {46996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46996#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:21,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {46996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46997#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:21,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {46997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46997#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:21,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {46997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46998#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:21,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {46998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46998#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:21,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {46998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46999#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:21,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {46999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46999#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:21,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {46999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47000#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:21,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {47000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47000#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:21,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {47000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47001#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:21,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {47001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47001#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:21,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {47001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47002#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:21,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {47002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47002#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:21,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {47002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47003#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:21,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {47003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47003#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:21,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {47003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47004#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:21,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47004#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:21,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47005#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:21,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {47005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47005#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:21,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47006#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:21,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {47006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47006#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:21,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {47006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47007#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:21,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {47007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47007#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:21,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {47007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47008#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:21,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {47008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47008#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:21,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {47008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47009#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:21,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {47009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47009#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:21,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {47009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47010#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:21,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {47010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47010#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:21,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {47010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47011#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:21,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {47011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47011#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:21,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {47011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47012#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:21,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {47012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47012#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:21,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {47012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47013#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:21,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {47013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47013#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:21,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {47013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47014#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:21,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {47014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47014#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:21,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {47014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47015#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:21,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {47015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47015#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:21,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {47015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47016#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:21,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {47016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47016#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:21,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {47016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47017#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:21,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {47017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47017#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:21,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {47017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47018#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:21,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {47018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47018#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:21,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {47018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47019#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:21,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {47019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47019#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:21,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {47019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47020#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:21,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {47020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47020#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:21,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {47020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47021#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:21,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {47021#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47021#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:21,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {47021#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47022#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {47022#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47022#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {47022#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47023#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {47023#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47023#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:21,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {47023#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47024#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:21,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {47024#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47024#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:21,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {47024#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47025#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:21,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {47025#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47025#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:21,353 INFO L290 TraceCheckUtils]: 69: Hoare triple {47025#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47026#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:21,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {47026#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47026#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:21,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {47026#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47027#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:21,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {47027#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47027#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:21,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {47027#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47028#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:21,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {47028#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47028#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:21,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {47028#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47029#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:21,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {47029#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47029#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:21,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {47029#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47030#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:21,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {47030#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47030#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:21,355 INFO L290 TraceCheckUtils]: 79: Hoare triple {47030#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47031#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:21,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {47031#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47031#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:21,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {47031#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47032#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:21,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {47032#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47032#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:21,357 INFO L290 TraceCheckUtils]: 83: Hoare triple {47032#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47033#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:21,357 INFO L290 TraceCheckUtils]: 84: Hoare triple {47033#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47033#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:21,357 INFO L290 TraceCheckUtils]: 85: Hoare triple {47033#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47034#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:21,357 INFO L290 TraceCheckUtils]: 86: Hoare triple {47034#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47034#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:21,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {47034#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47035#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:21,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {47035#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47035#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:21,358 INFO L290 TraceCheckUtils]: 89: Hoare triple {47035#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47036#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:21,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {47036#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47036#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:21,359 INFO L290 TraceCheckUtils]: 91: Hoare triple {47036#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47037#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:21,359 INFO L290 TraceCheckUtils]: 92: Hoare triple {47037#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47037#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:21,359 INFO L290 TraceCheckUtils]: 93: Hoare triple {47037#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47038#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:21,360 INFO L290 TraceCheckUtils]: 94: Hoare triple {47038#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47038#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:21,360 INFO L290 TraceCheckUtils]: 95: Hoare triple {47038#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47039#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:21,360 INFO L290 TraceCheckUtils]: 96: Hoare triple {47039#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47039#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:21,361 INFO L290 TraceCheckUtils]: 97: Hoare triple {47039#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47040#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:21,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {47040#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47040#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:21,361 INFO L290 TraceCheckUtils]: 99: Hoare triple {47040#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47041#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:21,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {47041#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47041#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:21,362 INFO L290 TraceCheckUtils]: 101: Hoare triple {47041#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47042#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:21,362 INFO L290 TraceCheckUtils]: 102: Hoare triple {47042#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47042#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:21,362 INFO L290 TraceCheckUtils]: 103: Hoare triple {47042#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47043#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:21,363 INFO L290 TraceCheckUtils]: 104: Hoare triple {47043#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47043#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:21,363 INFO L290 TraceCheckUtils]: 105: Hoare triple {47043#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47044#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:21,363 INFO L290 TraceCheckUtils]: 106: Hoare triple {47044#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47044#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:21,363 INFO L290 TraceCheckUtils]: 107: Hoare triple {47044#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47045#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:21,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {47045#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47045#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:21,364 INFO L290 TraceCheckUtils]: 109: Hoare triple {47045#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47046#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:21,364 INFO L290 TraceCheckUtils]: 110: Hoare triple {47046#(<= main_~i~0 52)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-28 03:00:21,364 INFO L290 TraceCheckUtils]: 111: Hoare triple {46990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {46990#false} is VALID [2022-04-28 03:00:21,364 INFO L272 TraceCheckUtils]: 112: Hoare triple {46990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {46990#false} is VALID [2022-04-28 03:00:21,364 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-28 03:00:21,365 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-28 03:00:21,365 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-28 03:00:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515152080] [2022-04-28 03:00:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515152080] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285933464] [2022-04-28 03:00:21,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:21,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:21,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:21,366 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:21,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 03:00:21,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:21,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:21,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 03:00:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:21,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:22,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {46989#true} call ULTIMATE.init(); {46989#true} is VALID [2022-04-28 03:00:22,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {46989#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(12, 2); {46989#true} is VALID [2022-04-28 03:00:22,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-28 03:00:22,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-28 03:00:22,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-28 03:00:22,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {46989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {47066#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:22,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {47066#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47066#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:22,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {47066#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46995#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:22,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {46995#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46995#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:22,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {46995#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46996#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:22,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {46996#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46996#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:22,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {46996#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46997#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:22,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {46997#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46997#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:22,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {46997#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46998#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:22,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {46998#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46998#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:22,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {46998#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46999#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:22,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {46999#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {46999#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:22,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {46999#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47000#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:22,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {47000#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47000#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:22,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {47000#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47001#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:22,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {47001#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47001#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:22,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {47001#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47002#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:22,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {47002#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47002#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:22,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {47002#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47003#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:22,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {47003#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47003#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:22,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {47003#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47004#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:22,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47004#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:22,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47005#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:22,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {47005#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47005#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:22,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47006#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:22,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {47006#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47006#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:22,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {47006#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47007#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:22,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {47007#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47007#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:22,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {47007#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47008#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:22,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {47008#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47008#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:22,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {47008#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47009#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:22,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {47009#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47009#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:22,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {47009#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47010#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:22,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {47010#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47010#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:22,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {47010#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47011#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:22,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {47011#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47011#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:22,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {47011#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47012#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:22,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {47012#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47012#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:22,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {47012#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47013#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:22,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {47013#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47013#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:22,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {47013#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47014#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:22,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {47014#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47014#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:22,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {47014#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47015#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:22,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {47015#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47015#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:22,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {47015#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47016#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:22,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {47016#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47016#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:22,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {47016#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47017#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:22,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {47017#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47017#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:22,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {47017#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47018#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:22,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {47018#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47018#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:22,334 INFO L290 TraceCheckUtils]: 55: Hoare triple {47018#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47019#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:22,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {47019#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47019#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:22,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {47019#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47020#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:22,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {47020#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47020#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:22,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {47020#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47021#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:22,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {47021#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47021#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:22,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {47021#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47022#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:22,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {47022#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47022#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:22,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {47022#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47023#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:22,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {47023#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47023#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:22,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {47023#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47024#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:22,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {47024#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47024#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:22,348 INFO L290 TraceCheckUtils]: 67: Hoare triple {47024#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47025#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:22,348 INFO L290 TraceCheckUtils]: 68: Hoare triple {47025#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47025#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:22,348 INFO L290 TraceCheckUtils]: 69: Hoare triple {47025#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47026#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:22,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {47026#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47026#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:22,349 INFO L290 TraceCheckUtils]: 71: Hoare triple {47026#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47027#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:22,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {47027#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47027#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:22,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {47027#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47028#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:22,349 INFO L290 TraceCheckUtils]: 74: Hoare triple {47028#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47028#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:22,350 INFO L290 TraceCheckUtils]: 75: Hoare triple {47028#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47029#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:22,350 INFO L290 TraceCheckUtils]: 76: Hoare triple {47029#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47029#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:22,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {47029#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47030#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:22,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {47030#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47030#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:22,351 INFO L290 TraceCheckUtils]: 79: Hoare triple {47030#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47031#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:22,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {47031#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47031#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:22,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {47031#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47032#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:22,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {47032#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47032#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:22,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {47032#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47033#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:22,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {47033#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47033#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:22,353 INFO L290 TraceCheckUtils]: 85: Hoare triple {47033#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47034#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:22,353 INFO L290 TraceCheckUtils]: 86: Hoare triple {47034#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47034#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:22,353 INFO L290 TraceCheckUtils]: 87: Hoare triple {47034#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47035#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:22,353 INFO L290 TraceCheckUtils]: 88: Hoare triple {47035#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47035#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:22,354 INFO L290 TraceCheckUtils]: 89: Hoare triple {47035#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47036#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:22,354 INFO L290 TraceCheckUtils]: 90: Hoare triple {47036#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47036#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:22,354 INFO L290 TraceCheckUtils]: 91: Hoare triple {47036#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47037#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:22,355 INFO L290 TraceCheckUtils]: 92: Hoare triple {47037#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47037#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:22,355 INFO L290 TraceCheckUtils]: 93: Hoare triple {47037#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47038#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:22,355 INFO L290 TraceCheckUtils]: 94: Hoare triple {47038#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47038#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:22,355 INFO L290 TraceCheckUtils]: 95: Hoare triple {47038#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47039#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:22,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {47039#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47039#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:22,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {47039#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47040#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:22,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {47040#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47040#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:22,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {47040#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47041#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:22,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {47041#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47041#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:22,357 INFO L290 TraceCheckUtils]: 101: Hoare triple {47041#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47042#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:22,357 INFO L290 TraceCheckUtils]: 102: Hoare triple {47042#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47042#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:22,358 INFO L290 TraceCheckUtils]: 103: Hoare triple {47042#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47043#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:22,358 INFO L290 TraceCheckUtils]: 104: Hoare triple {47043#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47043#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:22,358 INFO L290 TraceCheckUtils]: 105: Hoare triple {47043#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47044#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:22,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {47044#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47044#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:22,359 INFO L290 TraceCheckUtils]: 107: Hoare triple {47044#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47045#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:22,359 INFO L290 TraceCheckUtils]: 108: Hoare triple {47045#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47045#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:22,359 INFO L290 TraceCheckUtils]: 109: Hoare triple {47045#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47046#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:22,360 INFO L290 TraceCheckUtils]: 110: Hoare triple {47046#(<= main_~i~0 52)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L290 TraceCheckUtils]: 111: Hoare triple {46990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L272 TraceCheckUtils]: 112: Hoare triple {46990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-28 03:00:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:22,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:25,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-28 03:00:25,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-28 03:00:25,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-28 03:00:25,305 INFO L272 TraceCheckUtils]: 112: Hoare triple {46990#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {46990#false} is VALID [2022-04-28 03:00:25,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {46990#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {46990#false} is VALID [2022-04-28 03:00:25,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {47412#(< main_~i~0 2048)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-28 03:00:25,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {47416#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47412#(< main_~i~0 2048)} is VALID [2022-04-28 03:00:25,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {47416#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47416#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:25,307 INFO L290 TraceCheckUtils]: 107: Hoare triple {47423#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47416#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:25,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {47423#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47423#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:25,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {47430#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47423#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:25,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {47430#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47430#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:25,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {47437#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47430#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:25,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {47437#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47437#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:25,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {47444#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47437#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:25,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {47444#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47444#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:25,309 INFO L290 TraceCheckUtils]: 99: Hoare triple {47451#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47444#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:25,309 INFO L290 TraceCheckUtils]: 98: Hoare triple {47451#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47451#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:25,310 INFO L290 TraceCheckUtils]: 97: Hoare triple {47458#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47451#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:25,310 INFO L290 TraceCheckUtils]: 96: Hoare triple {47458#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47458#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:25,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {47465#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47458#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:25,310 INFO L290 TraceCheckUtils]: 94: Hoare triple {47465#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47465#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:25,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {47472#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47465#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:25,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {47472#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47472#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:25,311 INFO L290 TraceCheckUtils]: 91: Hoare triple {47479#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47472#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:25,311 INFO L290 TraceCheckUtils]: 90: Hoare triple {47479#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47479#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:25,312 INFO L290 TraceCheckUtils]: 89: Hoare triple {47486#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47479#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:25,312 INFO L290 TraceCheckUtils]: 88: Hoare triple {47486#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47486#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:25,312 INFO L290 TraceCheckUtils]: 87: Hoare triple {47493#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47486#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:25,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {47493#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47493#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:25,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {47500#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47493#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:25,313 INFO L290 TraceCheckUtils]: 84: Hoare triple {47500#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47500#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:25,313 INFO L290 TraceCheckUtils]: 83: Hoare triple {47507#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47500#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:25,314 INFO L290 TraceCheckUtils]: 82: Hoare triple {47507#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47507#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:25,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {47514#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47507#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:25,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {47514#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47514#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:25,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {47521#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47514#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:25,315 INFO L290 TraceCheckUtils]: 78: Hoare triple {47521#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47521#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:25,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {47528#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47521#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:25,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {47528#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47528#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:25,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {47535#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47528#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:25,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {47535#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47535#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:25,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {47542#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47535#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:25,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {47542#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47542#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:25,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {47549#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47542#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:25,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {47549#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47549#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:25,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {47556#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47549#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:25,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {47556#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47556#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:25,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {47563#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47556#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:25,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {47563#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47563#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:25,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {47570#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47563#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:25,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {47570#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47570#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:25,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {47577#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47570#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:25,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {47577#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47577#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:25,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {47584#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47577#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:25,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {47584#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47584#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:25,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {47591#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47584#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:25,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {47591#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47591#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:25,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {47598#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47591#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:25,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {47598#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47598#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:25,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {47605#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47598#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:25,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {47605#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47605#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:25,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {47612#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47605#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:25,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {47612#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47612#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:25,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {47619#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47612#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:25,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {47619#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47619#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:25,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {47626#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47619#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:25,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {47626#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47626#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:25,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {47633#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47626#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:25,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {47633#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47633#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:25,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {47640#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47633#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:25,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {47640#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47640#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:25,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {47647#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47640#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:25,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {47647#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47647#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:25,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {47654#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47647#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:25,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {47654#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47654#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:25,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {47661#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47654#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:25,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {47661#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47661#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:25,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {47668#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47661#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:25,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {47668#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47668#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:25,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {47675#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47668#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:25,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {47675#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47675#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:25,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {47682#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47675#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:25,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {47682#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47682#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:25,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {47689#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47682#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:25,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {47689#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47689#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:25,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {47696#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47689#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:25,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {47696#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47696#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:25,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {47703#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47696#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:25,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {47703#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47703#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:25,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {47710#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47703#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:25,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {47710#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47710#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:25,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {47717#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47710#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:25,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {47717#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47717#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:25,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {47724#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47717#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:25,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {47724#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47724#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:25,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {47731#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47724#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:25,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {47731#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47731#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:25,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {47738#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47731#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:25,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {47738#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47738#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:25,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {47745#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47738#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:25,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {47745#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47745#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:25,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {47752#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47745#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:25,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {47752#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47752#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:25,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {47759#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47752#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:25,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {47759#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47759#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:25,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {47766#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47759#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:25,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {47766#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47766#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:25,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {47773#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {47766#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:25,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {47773#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {47773#(< main_~i~0 1996)} is VALID [2022-04-28 03:00:25,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {46989#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {47773#(< main_~i~0 1996)} is VALID [2022-04-28 03:00:25,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-28 03:00:25,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-28 03:00:25,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-28 03:00:25,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {46989#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(12, 2); {46989#true} is VALID [2022-04-28 03:00:25,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {46989#true} call ULTIMATE.init(); {46989#true} is VALID [2022-04-28 03:00:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:25,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285933464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:25,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-28 03:00:25,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033737977] [2022-04-28 03:00:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033737977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:25,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:00:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127826004] [2022-04-28 03:00:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-28 03:00:25,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:25,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:00:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:00:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:00:25,406 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,346 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-28 03:00:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:00:27,346 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-28 03:00:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 126 transitions. [2022-04-28 03:00:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 126 transitions. [2022-04-28 03:00:27,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 126 transitions. [2022-04-28 03:00:27,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:27,436 INFO L225 Difference]: With dead ends: 126 [2022-04-28 03:00:27,436 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:00:27,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:00:27,438 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 114 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:27,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 34 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:00:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-28 03:00:28,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:28,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,004 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,004 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:28,005 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-28 03:00:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-04-28 03:00:28,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:28,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:28,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:00:28,005 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:00:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:28,006 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-28 03:00:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-04-28 03:00:28,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:28,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:28,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:28,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0087719298245614) internal successors, (115), 114 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2022-04-28 03:00:28,007 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2022-04-28 03:00:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:28,007 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2022-04-28 03:00:28,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0) internal successors, (112), 55 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 119 transitions. [2022-04-28 03:00:28,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2022-04-28 03:00:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 03:00:28,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:28,143 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:28,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:28,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 03:00:28,343 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1078123324, now seen corresponding path program 105 times [2022-04-28 03:00:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930294652] [2022-04-28 03:00:28,346 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:28,346 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:28,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1078123324, now seen corresponding path program 106 times [2022-04-28 03:00:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369204248] [2022-04-28 03:00:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:29,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {48692#(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(12, 2); {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {48633#true} call ULTIMATE.init(); {48692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:29,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {48692#(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(12, 2); {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-28 03:00:29,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-28 03:00:29,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {48633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {48638#(= main_~i~0 0)} is VALID [2022-04-28 03:00:29,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {48638#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48638#(= main_~i~0 0)} is VALID [2022-04-28 03:00:29,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {48638#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48639#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:29,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {48639#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48639#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:29,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {48639#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:29,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {48640#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48640#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:29,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {48640#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:29,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {48641#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48641#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:29,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {48641#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:29,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {48642#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48642#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:29,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {48642#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:29,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {48643#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48643#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:29,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {48643#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:29,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {48644#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48644#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:29,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {48644#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:29,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {48645#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48645#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:29,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {48645#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:29,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {48646#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48646#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:29,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {48646#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:29,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {48647#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48647#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:29,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {48647#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:29,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {48648#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48648#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:29,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {48648#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:29,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {48649#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48649#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:29,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {48649#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:29,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {48650#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48650#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:29,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {48650#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:29,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {48651#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48651#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:29,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {48651#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:29,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {48652#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48652#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:29,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {48652#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:29,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {48653#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48653#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:29,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {48653#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:29,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {48654#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48654#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:29,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {48654#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:29,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {48655#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48655#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:29,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {48655#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:29,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {48656#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48656#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:29,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {48656#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:29,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {48657#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48657#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:29,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {48657#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:29,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {48658#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48658#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:29,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {48658#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:29,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {48659#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48659#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:29,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {48659#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:29,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {48660#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48660#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:29,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {48660#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:29,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {48661#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48661#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:29,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {48661#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:29,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {48662#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48662#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:29,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {48662#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:29,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {48663#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48663#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:29,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {48663#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:29,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {48664#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48664#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:29,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {48664#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:29,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {48665#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48665#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:29,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {48665#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:29,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {48666#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48666#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:29,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {48666#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:29,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {48667#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48667#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:29,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {48667#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:29,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {48668#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48668#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:29,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {48668#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:29,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {48669#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48669#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:29,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {48669#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:29,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {48670#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48670#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:29,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {48670#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:29,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {48671#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48671#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:29,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {48671#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:29,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {48672#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48672#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:29,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {48672#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:29,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {48673#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48673#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:29,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {48673#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:29,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {48674#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48674#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:29,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {48674#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:29,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {48675#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48675#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:29,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {48675#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:29,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {48676#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48676#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:29,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {48676#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:29,428 INFO L290 TraceCheckUtils]: 84: Hoare triple {48677#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48677#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:29,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {48677#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:29,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {48678#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48678#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:29,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {48678#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48679#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:29,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {48679#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48679#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:29,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {48679#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48680#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:29,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {48680#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48680#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:29,430 INFO L290 TraceCheckUtils]: 91: Hoare triple {48680#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48681#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:29,430 INFO L290 TraceCheckUtils]: 92: Hoare triple {48681#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48681#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:29,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {48681#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48682#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:29,431 INFO L290 TraceCheckUtils]: 94: Hoare triple {48682#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48682#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:29,431 INFO L290 TraceCheckUtils]: 95: Hoare triple {48682#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48683#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:29,431 INFO L290 TraceCheckUtils]: 96: Hoare triple {48683#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48683#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:29,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {48683#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48684#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:29,432 INFO L290 TraceCheckUtils]: 98: Hoare triple {48684#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48684#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:29,432 INFO L290 TraceCheckUtils]: 99: Hoare triple {48684#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48685#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:29,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {48685#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48685#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:29,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {48685#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48686#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:29,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {48686#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48686#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:29,433 INFO L290 TraceCheckUtils]: 103: Hoare triple {48686#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48687#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:29,433 INFO L290 TraceCheckUtils]: 104: Hoare triple {48687#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48687#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:29,434 INFO L290 TraceCheckUtils]: 105: Hoare triple {48687#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48688#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:29,434 INFO L290 TraceCheckUtils]: 106: Hoare triple {48688#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48688#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:29,434 INFO L290 TraceCheckUtils]: 107: Hoare triple {48688#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48689#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:29,434 INFO L290 TraceCheckUtils]: 108: Hoare triple {48689#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48689#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:29,435 INFO L290 TraceCheckUtils]: 109: Hoare triple {48689#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48690#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:29,435 INFO L290 TraceCheckUtils]: 110: Hoare triple {48690#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48690#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:29,435 INFO L290 TraceCheckUtils]: 111: Hoare triple {48690#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48691#(<= main_~i~0 53)} is VALID [2022-04-28 03:00:29,436 INFO L290 TraceCheckUtils]: 112: Hoare triple {48691#(<= main_~i~0 53)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L290 TraceCheckUtils]: 113: Hoare triple {48634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L272 TraceCheckUtils]: 114: Hoare triple {48634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-28 03:00:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369204248] [2022-04-28 03:00:29,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369204248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:29,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407213415] [2022-04-28 03:00:29,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:29,438 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:29,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 03:00:29,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:29,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:29,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 03:00:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:30,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {48633#true} call ULTIMATE.init(); {48633#true} is VALID [2022-04-28 03:00:30,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {48633#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(12, 2); {48633#true} is VALID [2022-04-28 03:00:30,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-28 03:00:30,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-28 03:00:30,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-28 03:00:30,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {48633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {48711#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:30,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {48711#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48711#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:30,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {48711#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48639#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:30,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {48639#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48639#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:30,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {48639#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:30,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {48640#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48640#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:30,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {48640#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:30,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {48641#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48641#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:30,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {48641#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:30,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {48642#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48642#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:30,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {48642#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:30,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {48643#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48643#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:30,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {48643#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:30,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {48644#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48644#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:30,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {48644#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:30,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {48645#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48645#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:30,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {48645#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:30,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {48646#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48646#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:30,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {48646#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:30,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {48647#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48647#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:30,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {48647#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:30,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {48648#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48648#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:30,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {48648#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:30,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {48649#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48649#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:30,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {48649#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:30,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {48650#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48650#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:30,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {48650#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:30,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {48651#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48651#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:30,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {48651#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:30,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {48652#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48652#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:30,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {48652#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:30,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {48653#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48653#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:30,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {48653#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:30,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {48654#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48654#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:30,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {48654#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:30,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {48655#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48655#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:30,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {48655#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:30,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {48656#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48656#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:30,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {48656#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:30,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {48657#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48657#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:30,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {48657#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:30,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {48658#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48658#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:30,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {48658#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:30,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {48659#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48659#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:30,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {48659#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:30,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {48660#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48660#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:30,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {48660#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:30,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {48661#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48661#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:30,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {48661#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:30,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {48662#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48662#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:30,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {48662#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:30,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {48663#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48663#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:30,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {48663#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:30,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {48664#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48664#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:30,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {48664#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:30,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {48665#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48665#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:30,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {48665#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:30,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {48666#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48666#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:30,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {48666#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:30,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {48667#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48667#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:30,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {48667#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:30,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {48668#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48668#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:30,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {48668#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:30,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {48669#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48669#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:30,403 INFO L290 TraceCheckUtils]: 69: Hoare triple {48669#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:30,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {48670#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48670#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:30,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {48670#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:30,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {48671#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48671#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:30,404 INFO L290 TraceCheckUtils]: 73: Hoare triple {48671#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:30,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {48672#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48672#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:30,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {48672#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:30,405 INFO L290 TraceCheckUtils]: 76: Hoare triple {48673#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48673#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:30,405 INFO L290 TraceCheckUtils]: 77: Hoare triple {48673#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:30,405 INFO L290 TraceCheckUtils]: 78: Hoare triple {48674#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48674#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:30,405 INFO L290 TraceCheckUtils]: 79: Hoare triple {48674#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:30,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {48675#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48675#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:30,406 INFO L290 TraceCheckUtils]: 81: Hoare triple {48675#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:30,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {48676#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48676#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:30,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {48676#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:30,407 INFO L290 TraceCheckUtils]: 84: Hoare triple {48677#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48677#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:30,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {48677#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:30,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {48678#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48678#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:30,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {48678#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48679#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:30,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {48679#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48679#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:30,408 INFO L290 TraceCheckUtils]: 89: Hoare triple {48679#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48680#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:30,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {48680#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48680#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:30,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {48680#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48681#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:30,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {48681#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48681#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:30,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {48681#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48682#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:30,410 INFO L290 TraceCheckUtils]: 94: Hoare triple {48682#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48682#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:30,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {48682#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48683#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:30,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {48683#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48683#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:30,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {48683#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48684#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:30,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {48684#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48684#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:30,411 INFO L290 TraceCheckUtils]: 99: Hoare triple {48684#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48685#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:30,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {48685#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48685#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:30,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {48685#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48686#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:30,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {48686#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48686#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:30,412 INFO L290 TraceCheckUtils]: 103: Hoare triple {48686#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48687#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:30,412 INFO L290 TraceCheckUtils]: 104: Hoare triple {48687#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48687#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:30,413 INFO L290 TraceCheckUtils]: 105: Hoare triple {48687#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48688#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:30,413 INFO L290 TraceCheckUtils]: 106: Hoare triple {48688#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48688#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:30,413 INFO L290 TraceCheckUtils]: 107: Hoare triple {48688#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48689#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:30,414 INFO L290 TraceCheckUtils]: 108: Hoare triple {48689#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48689#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:30,414 INFO L290 TraceCheckUtils]: 109: Hoare triple {48689#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48690#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:30,414 INFO L290 TraceCheckUtils]: 110: Hoare triple {48690#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {48690#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:30,414 INFO L290 TraceCheckUtils]: 111: Hoare triple {48690#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48691#(<= main_~i~0 53)} is VALID [2022-04-28 03:00:30,415 INFO L290 TraceCheckUtils]: 112: Hoare triple {48691#(<= main_~i~0 53)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L290 TraceCheckUtils]: 113: Hoare triple {48634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L272 TraceCheckUtils]: 114: Hoare triple {48634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-28 03:00:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:30,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:33,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-28 03:00:33,446 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-28 03:00:33,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-28 03:00:33,446 INFO L272 TraceCheckUtils]: 114: Hoare triple {48634#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {48634#false} is VALID [2022-04-28 03:00:33,446 INFO L290 TraceCheckUtils]: 113: Hoare triple {48634#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {48634#false} is VALID [2022-04-28 03:00:33,447 INFO L290 TraceCheckUtils]: 112: Hoare triple {49063#(< main_~i~0 2048)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-28 03:00:33,447 INFO L290 TraceCheckUtils]: 111: Hoare triple {49067#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49063#(< main_~i~0 2048)} is VALID [2022-04-28 03:00:33,447 INFO L290 TraceCheckUtils]: 110: Hoare triple {49067#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49067#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:33,448 INFO L290 TraceCheckUtils]: 109: Hoare triple {49074#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49067#(< main_~i~0 2047)} is VALID [2022-04-28 03:00:33,448 INFO L290 TraceCheckUtils]: 108: Hoare triple {49074#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49074#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:33,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {49081#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49074#(< main_~i~0 2046)} is VALID [2022-04-28 03:00:33,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {49081#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49081#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:33,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {49088#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49081#(< main_~i~0 2045)} is VALID [2022-04-28 03:00:33,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {49088#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49088#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:33,449 INFO L290 TraceCheckUtils]: 103: Hoare triple {49095#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49088#(< main_~i~0 2044)} is VALID [2022-04-28 03:00:33,450 INFO L290 TraceCheckUtils]: 102: Hoare triple {49095#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49095#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:33,450 INFO L290 TraceCheckUtils]: 101: Hoare triple {49102#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49095#(< main_~i~0 2043)} is VALID [2022-04-28 03:00:33,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {49102#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49102#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:33,451 INFO L290 TraceCheckUtils]: 99: Hoare triple {49109#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49102#(< main_~i~0 2042)} is VALID [2022-04-28 03:00:33,451 INFO L290 TraceCheckUtils]: 98: Hoare triple {49109#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49109#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:33,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {49116#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49109#(< main_~i~0 2041)} is VALID [2022-04-28 03:00:33,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {49116#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49116#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:33,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {49123#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49116#(< main_~i~0 2040)} is VALID [2022-04-28 03:00:33,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {49123#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49123#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:33,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {49130#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49123#(< main_~i~0 2039)} is VALID [2022-04-28 03:00:33,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {49130#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49130#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:33,453 INFO L290 TraceCheckUtils]: 91: Hoare triple {49137#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49130#(< main_~i~0 2038)} is VALID [2022-04-28 03:00:33,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {49137#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49137#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:33,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {49144#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49137#(< main_~i~0 2037)} is VALID [2022-04-28 03:00:33,454 INFO L290 TraceCheckUtils]: 88: Hoare triple {49144#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49144#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:33,454 INFO L290 TraceCheckUtils]: 87: Hoare triple {49151#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49144#(< main_~i~0 2036)} is VALID [2022-04-28 03:00:33,454 INFO L290 TraceCheckUtils]: 86: Hoare triple {49151#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49151#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:33,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {49158#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49151#(< main_~i~0 2035)} is VALID [2022-04-28 03:00:33,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {49158#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49158#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:33,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {49165#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49158#(< main_~i~0 2034)} is VALID [2022-04-28 03:00:33,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {49165#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49165#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:33,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {49172#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49165#(< main_~i~0 2033)} is VALID [2022-04-28 03:00:33,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {49172#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49172#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:33,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {49179#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49172#(< main_~i~0 2032)} is VALID [2022-04-28 03:00:33,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {49179#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49179#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:33,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {49186#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49179#(< main_~i~0 2031)} is VALID [2022-04-28 03:00:33,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {49186#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49186#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:33,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {49193#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49186#(< main_~i~0 2030)} is VALID [2022-04-28 03:00:33,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {49193#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49193#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:33,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {49200#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49193#(< main_~i~0 2029)} is VALID [2022-04-28 03:00:33,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {49200#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49200#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:33,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {49207#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49200#(< main_~i~0 2028)} is VALID [2022-04-28 03:00:33,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {49207#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49207#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:33,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {49214#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49207#(< main_~i~0 2027)} is VALID [2022-04-28 03:00:33,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {49214#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49214#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:33,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {49221#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49214#(< main_~i~0 2026)} is VALID [2022-04-28 03:00:33,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {49221#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49221#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:33,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {49228#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49221#(< main_~i~0 2025)} is VALID [2022-04-28 03:00:33,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {49228#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49228#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:33,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {49235#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49228#(< main_~i~0 2024)} is VALID [2022-04-28 03:00:33,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {49235#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49235#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:33,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {49242#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49235#(< main_~i~0 2023)} is VALID [2022-04-28 03:00:33,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {49242#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49242#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:33,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {49249#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49242#(< main_~i~0 2022)} is VALID [2022-04-28 03:00:33,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {49249#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49249#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:33,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {49256#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49249#(< main_~i~0 2021)} is VALID [2022-04-28 03:00:33,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {49256#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49256#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:33,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {49263#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49256#(< main_~i~0 2020)} is VALID [2022-04-28 03:00:33,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {49263#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49263#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:33,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {49270#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49263#(< main_~i~0 2019)} is VALID [2022-04-28 03:00:33,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {49270#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49270#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:33,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {49277#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49270#(< main_~i~0 2018)} is VALID [2022-04-28 03:00:33,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {49277#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49277#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:33,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {49284#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49277#(< main_~i~0 2017)} is VALID [2022-04-28 03:00:33,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {49284#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49284#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:33,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {49291#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49284#(< main_~i~0 2016)} is VALID [2022-04-28 03:00:33,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {49291#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49291#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:33,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {49298#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49291#(< main_~i~0 2015)} is VALID [2022-04-28 03:00:33,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {49298#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49298#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:33,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {49305#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49298#(< main_~i~0 2014)} is VALID [2022-04-28 03:00:33,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {49305#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49305#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:33,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {49312#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49305#(< main_~i~0 2013)} is VALID [2022-04-28 03:00:33,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {49312#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49312#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:33,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {49319#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49312#(< main_~i~0 2012)} is VALID [2022-04-28 03:00:33,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {49319#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49319#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:33,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {49326#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49319#(< main_~i~0 2011)} is VALID [2022-04-28 03:00:33,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {49326#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49326#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:33,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {49333#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49326#(< main_~i~0 2010)} is VALID [2022-04-28 03:00:33,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {49333#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49333#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:33,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {49340#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49333#(< main_~i~0 2009)} is VALID [2022-04-28 03:00:33,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {49340#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49340#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:33,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {49347#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49340#(< main_~i~0 2008)} is VALID [2022-04-28 03:00:33,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {49347#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49347#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:33,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {49354#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49347#(< main_~i~0 2007)} is VALID [2022-04-28 03:00:33,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {49354#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49354#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:33,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {49361#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49354#(< main_~i~0 2006)} is VALID [2022-04-28 03:00:33,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {49361#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49361#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:33,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {49368#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49361#(< main_~i~0 2005)} is VALID [2022-04-28 03:00:33,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {49368#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49368#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:33,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {49375#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49368#(< main_~i~0 2004)} is VALID [2022-04-28 03:00:33,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {49375#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49375#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:33,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {49382#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49375#(< main_~i~0 2003)} is VALID [2022-04-28 03:00:33,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {49382#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49382#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:33,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {49389#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49382#(< main_~i~0 2002)} is VALID [2022-04-28 03:00:33,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {49389#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49389#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:33,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {49396#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49389#(< main_~i~0 2001)} is VALID [2022-04-28 03:00:33,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {49396#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49396#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:33,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {49403#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49396#(< main_~i~0 2000)} is VALID [2022-04-28 03:00:33,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {49403#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49403#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:33,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {49410#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49403#(< main_~i~0 1999)} is VALID [2022-04-28 03:00:33,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {49410#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49410#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:33,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {49417#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49410#(< main_~i~0 1998)} is VALID [2022-04-28 03:00:33,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {49417#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49417#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:33,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {49424#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49417#(< main_~i~0 1997)} is VALID [2022-04-28 03:00:33,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {49424#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49424#(< main_~i~0 1996)} is VALID [2022-04-28 03:00:33,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {49431#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49424#(< main_~i~0 1996)} is VALID [2022-04-28 03:00:33,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {49431#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {49431#(< main_~i~0 1995)} is VALID [2022-04-28 03:00:33,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {48633#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {49431#(< main_~i~0 1995)} is VALID [2022-04-28 03:00:33,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-28 03:00:33,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-28 03:00:33,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-28 03:00:33,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {48633#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(12, 2); {48633#true} is VALID [2022-04-28 03:00:33,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {48633#true} call ULTIMATE.init(); {48633#true} is VALID [2022-04-28 03:00:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:33,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407213415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:33,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:33,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-28 03:00:33,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930294652] [2022-04-28 03:00:33,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930294652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:33,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:33,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:00:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686242739] [2022-04-28 03:00:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 03:00:33,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:33,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:33,547 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 03:00:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:00:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:00:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6107, Invalid=6325, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:00:33,549 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:35,545 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-28 03:00:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:00:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 03:00:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 128 transitions. [2022-04-28 03:00:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 128 transitions. [2022-04-28 03:00:35,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 128 transitions. [2022-04-28 03:00:35,632 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 03:00:35,633 INFO L225 Difference]: With dead ends: 128 [2022-04-28 03:00:35,633 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 03:00:35,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=12102, Invalid=15288, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 03:00:35,636 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:35,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 39 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 03:00:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-28 03:00:36,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:36,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:36,210 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:36,210 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:36,211 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-28 03:00:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2022-04-28 03:00:36,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:36,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:36,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 03:00:36,212 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 03:00:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:36,213 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-28 03:00:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2022-04-28 03:00:36,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:36,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:36,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:36,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2022-04-28 03:00:36,214 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2022-04-28 03:00:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:36,220 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2022-04-28 03:00:36,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0) internal successors, (114), 56 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:36,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 121 transitions. [2022-04-28 03:00:36,362 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 03:00:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2022-04-28 03:00:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 03:00:36,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:36,363 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:36,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-28 03:00:36,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 03:00:36,563 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1863483418, now seen corresponding path program 107 times [2022-04-28 03:00:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:36,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137488237] [2022-04-28 03:00:36,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:36,567 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:36,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1863483418, now seen corresponding path program 108 times [2022-04-28 03:00:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:36,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439156436] [2022-04-28 03:00:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:37,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {50365#(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(12, 2); {50305#true} is VALID [2022-04-28 03:00:37,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-28 03:00:37,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-28 03:00:37,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {50305#true} call ULTIMATE.init(); {50365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:37,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {50365#(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(12, 2); {50305#true} is VALID [2022-04-28 03:00:37,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-28 03:00:37,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-28 03:00:37,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-28 03:00:37,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {50305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {50310#(= main_~i~0 0)} is VALID [2022-04-28 03:00:37,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {50310#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50310#(= main_~i~0 0)} is VALID [2022-04-28 03:00:37,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {50310#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:37,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {50311#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50311#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:37,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {50311#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:37,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {50312#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50312#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:37,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {50312#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:37,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {50313#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50313#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:37,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {50313#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:37,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {50314#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50314#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:37,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {50314#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:37,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {50315#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50315#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:37,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {50315#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:37,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {50316#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50316#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:37,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {50316#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:37,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {50317#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50317#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:37,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {50317#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:37,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {50318#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50318#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:37,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {50318#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:37,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {50319#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50319#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:37,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {50319#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:37,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {50320#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50320#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:37,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {50320#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:37,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {50321#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50321#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:37,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {50321#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:37,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {50322#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50322#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:37,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {50322#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:37,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {50323#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50323#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:37,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {50323#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:37,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {50324#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50324#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:37,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {50324#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:37,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {50325#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50325#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:37,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {50325#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50326#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:37,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {50326#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50326#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:37,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {50326#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50327#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:37,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {50327#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50327#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:37,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {50327#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50328#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:37,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {50328#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50328#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:37,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {50328#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50329#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:37,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {50329#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50329#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:37,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {50329#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50330#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:37,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {50330#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50330#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:37,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {50330#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50331#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:37,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {50331#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50331#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:37,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {50331#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50332#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:37,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {50332#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50332#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:37,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {50332#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50333#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:37,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {50333#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50333#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:37,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {50333#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50334#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:37,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {50334#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50334#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:37,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {50334#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50335#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:37,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {50335#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50335#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:37,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {50335#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50336#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:37,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {50336#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50336#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:37,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {50336#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50337#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:37,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {50337#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50337#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:37,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {50337#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50338#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:37,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {50338#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50338#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:37,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {50338#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50339#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:37,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {50339#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50339#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:37,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {50339#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50340#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:37,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {50340#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50340#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:37,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {50340#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50341#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:37,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {50341#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50341#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:37,667 INFO L290 TraceCheckUtils]: 69: Hoare triple {50341#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50342#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:37,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {50342#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50342#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:37,668 INFO L290 TraceCheckUtils]: 71: Hoare triple {50342#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50343#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:37,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {50343#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50343#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:37,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {50343#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50344#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:37,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {50344#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50344#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:37,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {50344#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50345#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:37,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {50345#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50345#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:37,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {50345#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50346#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:37,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {50346#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50346#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:37,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {50346#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50347#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:37,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {50347#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50347#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:37,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {50347#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50348#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:37,672 INFO L290 TraceCheckUtils]: 82: Hoare triple {50348#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50348#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:37,672 INFO L290 TraceCheckUtils]: 83: Hoare triple {50348#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50349#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:37,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {50349#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50349#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:37,673 INFO L290 TraceCheckUtils]: 85: Hoare triple {50349#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50350#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:37,673 INFO L290 TraceCheckUtils]: 86: Hoare triple {50350#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50350#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:37,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {50350#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50351#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:37,673 INFO L290 TraceCheckUtils]: 88: Hoare triple {50351#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50351#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:37,674 INFO L290 TraceCheckUtils]: 89: Hoare triple {50351#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50352#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:37,674 INFO L290 TraceCheckUtils]: 90: Hoare triple {50352#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50352#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:37,674 INFO L290 TraceCheckUtils]: 91: Hoare triple {50352#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50353#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:37,675 INFO L290 TraceCheckUtils]: 92: Hoare triple {50353#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50353#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:37,675 INFO L290 TraceCheckUtils]: 93: Hoare triple {50353#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50354#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:37,676 INFO L290 TraceCheckUtils]: 94: Hoare triple {50354#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50354#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:37,676 INFO L290 TraceCheckUtils]: 95: Hoare triple {50354#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50355#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:37,676 INFO L290 TraceCheckUtils]: 96: Hoare triple {50355#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50355#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:37,677 INFO L290 TraceCheckUtils]: 97: Hoare triple {50355#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50356#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:37,677 INFO L290 TraceCheckUtils]: 98: Hoare triple {50356#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50356#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:37,677 INFO L290 TraceCheckUtils]: 99: Hoare triple {50356#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50357#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:37,678 INFO L290 TraceCheckUtils]: 100: Hoare triple {50357#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50357#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:37,678 INFO L290 TraceCheckUtils]: 101: Hoare triple {50357#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50358#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:37,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {50358#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50358#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:37,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {50358#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50359#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:37,679 INFO L290 TraceCheckUtils]: 104: Hoare triple {50359#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50359#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:37,680 INFO L290 TraceCheckUtils]: 105: Hoare triple {50359#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50360#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:37,680 INFO L290 TraceCheckUtils]: 106: Hoare triple {50360#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50360#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:37,680 INFO L290 TraceCheckUtils]: 107: Hoare triple {50360#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50361#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:37,681 INFO L290 TraceCheckUtils]: 108: Hoare triple {50361#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50361#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:37,681 INFO L290 TraceCheckUtils]: 109: Hoare triple {50361#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50362#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:37,681 INFO L290 TraceCheckUtils]: 110: Hoare triple {50362#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50362#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:37,682 INFO L290 TraceCheckUtils]: 111: Hoare triple {50362#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50363#(<= main_~i~0 53)} is VALID [2022-04-28 03:00:37,682 INFO L290 TraceCheckUtils]: 112: Hoare triple {50363#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50363#(<= main_~i~0 53)} is VALID [2022-04-28 03:00:37,682 INFO L290 TraceCheckUtils]: 113: Hoare triple {50363#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50364#(<= main_~i~0 54)} is VALID [2022-04-28 03:00:37,683 INFO L290 TraceCheckUtils]: 114: Hoare triple {50364#(<= main_~i~0 54)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L290 TraceCheckUtils]: 115: Hoare triple {50306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L272 TraceCheckUtils]: 116: Hoare triple {50306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-28 03:00:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:37,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439156436] [2022-04-28 03:00:37,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439156436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:37,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753376197] [2022-04-28 03:00:37,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:37,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:37,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:37,687 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:37,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 03:01:27,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2022-04-28 03:01:27,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:27,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 03:01:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:28,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:28,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {50305#true} call ULTIMATE.init(); {50305#true} is VALID [2022-04-28 03:01:28,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {50305#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(12, 2); {50305#true} is VALID [2022-04-28 03:01:28,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-28 03:01:28,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-28 03:01:28,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-28 03:01:28,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {50305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {50384#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:28,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {50384#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50384#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:28,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {50384#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:28,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {50311#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50311#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:28,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {50311#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:28,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {50312#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50312#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:28,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {50312#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:28,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {50313#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50313#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:28,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {50313#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:28,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {50314#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50314#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:28,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {50314#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:28,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {50315#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50315#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:28,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {50315#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:28,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {50316#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50316#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:28,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {50316#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:28,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {50317#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50317#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:28,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {50317#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:28,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {50318#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50318#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:28,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {50318#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:28,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {50319#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50319#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:28,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {50319#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:28,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {50320#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50320#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:28,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {50320#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:28,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {50321#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50321#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:28,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {50321#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:28,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {50322#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50322#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:28,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {50322#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:28,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {50323#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50323#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:28,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {50323#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:28,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {50324#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50324#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:28,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {50324#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:28,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {50325#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50325#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:28,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {50325#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50326#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:28,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {50326#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50326#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:28,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {50326#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50327#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:28,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {50327#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50327#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:28,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {50327#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50328#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:28,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {50328#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50328#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:28,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {50328#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50329#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:28,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {50329#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50329#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:28,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {50329#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50330#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:28,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {50330#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50330#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:28,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {50330#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50331#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:28,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {50331#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50331#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:28,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {50331#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50332#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:28,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {50332#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50332#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:28,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {50332#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50333#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:28,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {50333#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50333#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:28,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {50333#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50334#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:28,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {50334#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50334#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:28,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {50334#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50335#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:28,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {50335#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50335#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:28,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {50335#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50336#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:28,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {50336#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50336#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:28,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {50336#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50337#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:28,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {50337#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50337#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:28,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {50337#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50338#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:28,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {50338#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50338#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:28,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {50338#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50339#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:28,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {50339#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50339#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:28,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {50339#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50340#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:28,677 INFO L290 TraceCheckUtils]: 66: Hoare triple {50340#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50340#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:28,677 INFO L290 TraceCheckUtils]: 67: Hoare triple {50340#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50341#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:28,678 INFO L290 TraceCheckUtils]: 68: Hoare triple {50341#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50341#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:28,678 INFO L290 TraceCheckUtils]: 69: Hoare triple {50341#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50342#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:28,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {50342#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50342#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:28,679 INFO L290 TraceCheckUtils]: 71: Hoare triple {50342#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50343#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:28,679 INFO L290 TraceCheckUtils]: 72: Hoare triple {50343#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50343#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:28,679 INFO L290 TraceCheckUtils]: 73: Hoare triple {50343#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50344#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:28,679 INFO L290 TraceCheckUtils]: 74: Hoare triple {50344#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50344#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:28,680 INFO L290 TraceCheckUtils]: 75: Hoare triple {50344#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50345#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:28,680 INFO L290 TraceCheckUtils]: 76: Hoare triple {50345#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50345#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:28,680 INFO L290 TraceCheckUtils]: 77: Hoare triple {50345#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50346#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:28,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {50346#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50346#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:28,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {50346#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50347#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:28,681 INFO L290 TraceCheckUtils]: 80: Hoare triple {50347#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50347#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:28,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {50347#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50348#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:28,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {50348#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50348#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:28,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {50348#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50349#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:28,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {50349#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50349#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:28,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {50349#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50350#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:28,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {50350#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50350#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:28,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {50350#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50351#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:28,684 INFO L290 TraceCheckUtils]: 88: Hoare triple {50351#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50351#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:28,684 INFO L290 TraceCheckUtils]: 89: Hoare triple {50351#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50352#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:28,684 INFO L290 TraceCheckUtils]: 90: Hoare triple {50352#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50352#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:28,685 INFO L290 TraceCheckUtils]: 91: Hoare triple {50352#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50353#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:28,685 INFO L290 TraceCheckUtils]: 92: Hoare triple {50353#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50353#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:28,685 INFO L290 TraceCheckUtils]: 93: Hoare triple {50353#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50354#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:28,685 INFO L290 TraceCheckUtils]: 94: Hoare triple {50354#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50354#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:28,686 INFO L290 TraceCheckUtils]: 95: Hoare triple {50354#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50355#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:28,686 INFO L290 TraceCheckUtils]: 96: Hoare triple {50355#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50355#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:28,686 INFO L290 TraceCheckUtils]: 97: Hoare triple {50355#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50356#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:28,687 INFO L290 TraceCheckUtils]: 98: Hoare triple {50356#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50356#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:28,687 INFO L290 TraceCheckUtils]: 99: Hoare triple {50356#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50357#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:28,687 INFO L290 TraceCheckUtils]: 100: Hoare triple {50357#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50357#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:28,687 INFO L290 TraceCheckUtils]: 101: Hoare triple {50357#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50358#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:28,688 INFO L290 TraceCheckUtils]: 102: Hoare triple {50358#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50358#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:28,688 INFO L290 TraceCheckUtils]: 103: Hoare triple {50358#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50359#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:28,688 INFO L290 TraceCheckUtils]: 104: Hoare triple {50359#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50359#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:28,689 INFO L290 TraceCheckUtils]: 105: Hoare triple {50359#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50360#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:28,689 INFO L290 TraceCheckUtils]: 106: Hoare triple {50360#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50360#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:28,689 INFO L290 TraceCheckUtils]: 107: Hoare triple {50360#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50361#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:28,689 INFO L290 TraceCheckUtils]: 108: Hoare triple {50361#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50361#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:28,690 INFO L290 TraceCheckUtils]: 109: Hoare triple {50361#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50362#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:28,690 INFO L290 TraceCheckUtils]: 110: Hoare triple {50362#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50362#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:28,691 INFO L290 TraceCheckUtils]: 111: Hoare triple {50362#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50363#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:28,691 INFO L290 TraceCheckUtils]: 112: Hoare triple {50363#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50363#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:28,691 INFO L290 TraceCheckUtils]: 113: Hoare triple {50363#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50364#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:28,691 INFO L290 TraceCheckUtils]: 114: Hoare triple {50364#(<= main_~i~0 54)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L290 TraceCheckUtils]: 115: Hoare triple {50306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L272 TraceCheckUtils]: 116: Hoare triple {50306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-28 03:01:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:28,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:31,879 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-28 03:01:31,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-28 03:01:31,879 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-28 03:01:31,879 INFO L272 TraceCheckUtils]: 116: Hoare triple {50306#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {50306#false} is VALID [2022-04-28 03:01:31,879 INFO L290 TraceCheckUtils]: 115: Hoare triple {50306#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {50306#false} is VALID [2022-04-28 03:01:31,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {50742#(< main_~i~0 2048)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-28 03:01:31,880 INFO L290 TraceCheckUtils]: 113: Hoare triple {50746#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50742#(< main_~i~0 2048)} is VALID [2022-04-28 03:01:31,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {50746#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50746#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:31,880 INFO L290 TraceCheckUtils]: 111: Hoare triple {50753#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50746#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:31,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {50753#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50753#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:31,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {50760#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50753#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:31,881 INFO L290 TraceCheckUtils]: 108: Hoare triple {50760#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50760#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:31,881 INFO L290 TraceCheckUtils]: 107: Hoare triple {50767#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50760#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:31,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {50767#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50767#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:31,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {50774#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50767#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:31,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {50774#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50774#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:31,883 INFO L290 TraceCheckUtils]: 103: Hoare triple {50781#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50774#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:31,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {50781#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50781#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:31,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {50788#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50781#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:31,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {50788#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50788#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:31,884 INFO L290 TraceCheckUtils]: 99: Hoare triple {50795#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50788#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:31,884 INFO L290 TraceCheckUtils]: 98: Hoare triple {50795#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50795#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:31,884 INFO L290 TraceCheckUtils]: 97: Hoare triple {50802#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50795#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:31,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {50802#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50802#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:31,885 INFO L290 TraceCheckUtils]: 95: Hoare triple {50809#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50802#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:31,885 INFO L290 TraceCheckUtils]: 94: Hoare triple {50809#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50809#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:31,885 INFO L290 TraceCheckUtils]: 93: Hoare triple {50816#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50809#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:31,886 INFO L290 TraceCheckUtils]: 92: Hoare triple {50816#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50816#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:31,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {50823#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50816#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:31,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {50823#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50823#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:31,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {50830#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50823#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:31,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {50830#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50830#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:31,887 INFO L290 TraceCheckUtils]: 87: Hoare triple {50837#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50830#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:31,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {50837#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50837#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:31,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {50844#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50837#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:31,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {50844#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50844#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:31,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {50851#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:31,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {50851#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50851#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:31,889 INFO L290 TraceCheckUtils]: 81: Hoare triple {50858#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:31,889 INFO L290 TraceCheckUtils]: 80: Hoare triple {50858#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50858#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:31,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {50865#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:31,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {50865#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50865#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:31,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:31,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50872#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:31,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {50879#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:31,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {50879#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50879#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:31,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {50886#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50879#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:31,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {50886#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50886#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:31,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {50893#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50886#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:31,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {50893#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50893#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:31,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {50900#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50893#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:31,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {50900#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50900#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:31,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {50907#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50900#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:31,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {50907#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50907#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:31,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {50914#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50907#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:31,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {50914#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50914#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:31,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {50921#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50914#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:31,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {50921#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50921#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:31,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {50928#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50921#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:31,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {50928#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50928#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:31,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {50935#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50928#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:31,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {50935#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50935#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:31,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {50942#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50935#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:31,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {50942#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50942#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:31,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {50949#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50942#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:31,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {50949#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50949#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:31,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {50956#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50949#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:31,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {50956#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50956#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:31,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {50963#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50956#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:31,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {50963#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50963#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:31,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {50970#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50963#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:31,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {50970#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50970#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:31,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {50977#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50970#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:31,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {50977#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50977#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:31,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {50984#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50977#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:31,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {50984#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50984#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:31,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {50991#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50984#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:31,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {50991#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50991#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:31,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {50998#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50991#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:31,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {50998#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {50998#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:31,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {51005#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50998#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:31,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {51005#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51005#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:31,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {51012#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51005#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:31,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {51012#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51012#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:31,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {51019#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51012#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:31,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {51019#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51019#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:31,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {51026#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51019#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:31,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {51026#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51026#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:31,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {51033#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51026#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:31,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {51033#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51033#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:31,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {51040#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51033#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:31,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {51040#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51040#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:31,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {51047#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51040#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:31,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {51047#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51047#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:31,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {51054#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51047#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:31,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {51054#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51054#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:31,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {51061#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51054#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:31,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {51061#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51061#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:31,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {51068#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51061#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:31,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {51068#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51068#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:31,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {51075#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51068#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:31,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {51075#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51075#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:31,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {51082#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51075#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:31,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {51082#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51082#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:31,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {51089#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51082#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:31,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {51089#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51089#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:31,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {51096#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51089#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:31,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {51096#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51096#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:31,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {51103#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51096#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:31,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {51103#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51103#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:31,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {51110#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51103#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:31,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {51110#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51110#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:31,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {51117#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51110#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:31,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {51117#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {51117#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:31,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {50305#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {51117#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:31,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-28 03:01:31,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-28 03:01:31,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-28 03:01:31,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {50305#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(12, 2); {50305#true} is VALID [2022-04-28 03:01:31,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {50305#true} call ULTIMATE.init(); {50305#true} is VALID [2022-04-28 03:01:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:31,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753376197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:31,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-28 03:01:31,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137488237] [2022-04-28 03:01:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137488237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:31,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:01:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174911371] [2022-04-28 03:01:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-28 03:01:31,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:31,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:31,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:31,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:01:31,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:31,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:01:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:01:31,986 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,116 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-28 03:01:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:01:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-28 03:01:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 130 transitions. [2022-04-28 03:01:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 130 transitions. [2022-04-28 03:01:34,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 130 transitions. [2022-04-28 03:01:34,207 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 03:01:34,208 INFO L225 Difference]: With dead ends: 130 [2022-04-28 03:01:34,208 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 03:01:34,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-28 03:01:34,210 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:34,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 29 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:01:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 03:01:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-28 03:01:34,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:34,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,806 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,806 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,807 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-28 03:01:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-28 03:01:34,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:34,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:34,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:01:34,807 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:01:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,808 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-28 03:01:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-28 03:01:34,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:34,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:34,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:34,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2022-04-28 03:01:34,809 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2022-04-28 03:01:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:34,809 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2022-04-28 03:01:34,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.0) internal successors, (116), 57 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:34,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 123 transitions. [2022-04-28 03:01:34,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2022-04-28 03:01:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 03:01:34,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:34,953 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:34,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:35,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:35,154 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -680289656, now seen corresponding path program 109 times [2022-04-28 03:01:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1775236783] [2022-04-28 03:01:35,156 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:35,156 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:35,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash -680289656, now seen corresponding path program 110 times [2022-04-28 03:01:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:35,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056343605] [2022-04-28 03:01:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:36,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {52066#(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(12, 2); {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {52005#true} call ULTIMATE.init(); {52066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:36,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {52066#(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(12, 2); {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-28 03:01:36,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-28 03:01:36,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {52005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {52010#(= main_~i~0 0)} is VALID [2022-04-28 03:01:36,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {52010#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52010#(= main_~i~0 0)} is VALID [2022-04-28 03:01:36,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {52010#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52011#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:36,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {52011#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52011#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:36,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {52011#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52012#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:36,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {52012#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52012#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:36,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {52012#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52013#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:36,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {52013#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52013#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:36,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {52013#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52014#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:36,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {52014#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52014#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:36,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {52014#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52015#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:36,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {52015#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52015#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:36,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {52015#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52016#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:36,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {52016#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52016#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:36,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {52016#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52017#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:36,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {52017#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52017#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:36,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {52017#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52018#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:36,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {52018#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52018#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:36,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {52018#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52019#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:36,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {52019#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52019#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:36,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {52019#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52020#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:36,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {52020#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52020#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:36,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {52020#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52021#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:36,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {52021#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52021#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:36,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {52021#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52022#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:36,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {52022#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52022#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:36,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {52022#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52023#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:36,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {52023#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52023#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:36,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {52023#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52024#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:36,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {52024#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52024#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:36,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {52024#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52025#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:36,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {52025#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52025#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:36,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {52025#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52026#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:36,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {52026#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52026#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:36,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {52026#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52027#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:36,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {52027#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52027#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:36,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {52027#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52028#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:36,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {52028#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52028#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:36,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {52028#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52029#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:36,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {52029#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52029#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:36,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {52029#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52030#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:36,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {52030#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52030#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:36,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {52030#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52031#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:36,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {52031#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52031#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:36,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {52031#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52032#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:36,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {52032#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52032#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:36,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {52032#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52033#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:36,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {52033#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52033#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:36,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {52033#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52034#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:36,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {52034#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52034#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:36,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {52034#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52035#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:36,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {52035#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52035#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:36,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {52035#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52036#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:36,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {52036#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52036#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:36,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {52036#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52037#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:36,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {52037#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52037#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:36,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {52037#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52038#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:36,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {52038#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52038#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:36,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {52038#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52039#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:36,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {52039#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52039#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:36,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {52039#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52040#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:36,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {52040#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52040#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:36,297 INFO L290 TraceCheckUtils]: 67: Hoare triple {52040#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52041#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:36,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {52041#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52041#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:36,298 INFO L290 TraceCheckUtils]: 69: Hoare triple {52041#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52042#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:36,298 INFO L290 TraceCheckUtils]: 70: Hoare triple {52042#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52042#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:36,298 INFO L290 TraceCheckUtils]: 71: Hoare triple {52042#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52043#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:36,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {52043#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52043#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:36,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {52043#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52044#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:36,299 INFO L290 TraceCheckUtils]: 74: Hoare triple {52044#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52044#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:36,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {52044#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52045#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:36,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {52045#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52045#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:36,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {52045#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52046#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:36,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {52046#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52046#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:36,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {52046#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52047#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:36,301 INFO L290 TraceCheckUtils]: 80: Hoare triple {52047#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52047#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:36,301 INFO L290 TraceCheckUtils]: 81: Hoare triple {52047#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52048#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:36,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {52048#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52048#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:36,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {52048#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52049#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:36,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {52049#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52049#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:36,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {52049#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52050#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:36,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {52050#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52050#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:36,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {52050#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52051#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:36,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {52051#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52051#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:36,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {52051#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52052#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:36,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {52052#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52052#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:36,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {52052#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52053#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:36,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {52053#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52053#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:36,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {52053#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52054#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:36,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {52054#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52054#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:36,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {52054#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52055#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:36,306 INFO L290 TraceCheckUtils]: 96: Hoare triple {52055#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52055#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:36,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {52055#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52056#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:36,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {52056#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52056#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:36,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {52056#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52057#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:36,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {52057#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52057#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:36,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {52057#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52058#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:36,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {52058#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52058#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:36,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {52058#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52059#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:36,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {52059#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52059#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:36,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {52059#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52060#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:36,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {52060#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52060#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:36,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {52060#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52061#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:36,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {52061#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52061#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:36,310 INFO L290 TraceCheckUtils]: 109: Hoare triple {52061#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52062#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:36,310 INFO L290 TraceCheckUtils]: 110: Hoare triple {52062#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52062#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:36,310 INFO L290 TraceCheckUtils]: 111: Hoare triple {52062#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52063#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:36,310 INFO L290 TraceCheckUtils]: 112: Hoare triple {52063#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52063#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:36,311 INFO L290 TraceCheckUtils]: 113: Hoare triple {52063#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52064#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:36,311 INFO L290 TraceCheckUtils]: 114: Hoare triple {52064#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52064#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:36,311 INFO L290 TraceCheckUtils]: 115: Hoare triple {52064#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52065#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:36,312 INFO L290 TraceCheckUtils]: 116: Hoare triple {52065#(<= main_~i~0 55)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L290 TraceCheckUtils]: 117: Hoare triple {52006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L272 TraceCheckUtils]: 118: Hoare triple {52006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-28 03:01:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:36,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056343605] [2022-04-28 03:01:36,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056343605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:36,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965195792] [2022-04-28 03:01:36,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:36,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:36,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:36,314 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:36,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 03:01:36,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:36,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:36,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 03:01:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:36,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:37,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {52005#true} call ULTIMATE.init(); {52005#true} is VALID [2022-04-28 03:01:37,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {52005#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(12, 2); {52005#true} is VALID [2022-04-28 03:01:37,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-28 03:01:37,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-28 03:01:37,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-28 03:01:37,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {52005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {52085#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:37,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {52085#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52085#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:37,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {52085#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52011#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:37,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {52011#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52011#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:37,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {52011#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52012#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:37,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {52012#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52012#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:37,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {52012#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52013#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:37,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {52013#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52013#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:37,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {52013#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52014#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:37,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {52014#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52014#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:37,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {52014#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52015#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:37,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {52015#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52015#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:37,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {52015#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52016#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:37,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {52016#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52016#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:37,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {52016#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52017#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:37,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {52017#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52017#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:37,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {52017#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52018#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:37,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {52018#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52018#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:37,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {52018#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52019#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:37,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {52019#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52019#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:37,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {52019#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52020#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:37,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {52020#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52020#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:37,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {52020#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52021#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:37,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {52021#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52021#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:37,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {52021#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52022#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:37,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {52022#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52022#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:37,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {52022#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52023#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:37,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {52023#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52023#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:37,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {52023#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52024#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:37,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {52024#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52024#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:37,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {52024#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52025#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:37,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {52025#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52025#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:37,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {52025#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52026#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:37,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {52026#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52026#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:37,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {52026#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52027#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:37,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {52027#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52027#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:37,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {52027#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52028#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:37,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {52028#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52028#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:37,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {52028#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52029#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:37,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {52029#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52029#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:37,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {52029#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52030#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:37,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {52030#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52030#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:37,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {52030#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52031#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:37,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {52031#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52031#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:37,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {52031#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52032#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:37,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {52032#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52032#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:37,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {52032#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52033#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:37,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {52033#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52033#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:37,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {52033#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52034#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:37,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {52034#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52034#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:37,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {52034#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52035#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:37,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {52035#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52035#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:37,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {52035#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52036#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:37,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {52036#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52036#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:37,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {52036#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52037#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:37,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {52037#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52037#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:37,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {52037#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52038#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:37,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {52038#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52038#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:37,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {52038#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52039#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:37,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {52039#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52039#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:37,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {52039#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52040#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:37,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {52040#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52040#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:37,371 INFO L290 TraceCheckUtils]: 67: Hoare triple {52040#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52041#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:37,372 INFO L290 TraceCheckUtils]: 68: Hoare triple {52041#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52041#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:37,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {52041#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52042#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:37,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {52042#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52042#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:37,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {52042#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52043#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:37,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {52043#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52043#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:37,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {52043#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52044#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:37,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {52044#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52044#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:37,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {52044#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52045#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:37,374 INFO L290 TraceCheckUtils]: 76: Hoare triple {52045#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52045#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:37,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {52045#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52046#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:37,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {52046#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52046#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:37,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {52046#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52047#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:37,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {52047#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52047#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:37,375 INFO L290 TraceCheckUtils]: 81: Hoare triple {52047#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52048#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:37,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {52048#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52048#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:37,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {52048#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52049#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:37,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {52049#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52049#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:37,377 INFO L290 TraceCheckUtils]: 85: Hoare triple {52049#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52050#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:37,377 INFO L290 TraceCheckUtils]: 86: Hoare triple {52050#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52050#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:37,377 INFO L290 TraceCheckUtils]: 87: Hoare triple {52050#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52051#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:37,377 INFO L290 TraceCheckUtils]: 88: Hoare triple {52051#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52051#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:37,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {52051#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52052#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:37,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {52052#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52052#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:37,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {52052#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52053#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:37,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {52053#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52053#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:37,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {52053#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52054#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:37,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {52054#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52054#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:37,379 INFO L290 TraceCheckUtils]: 95: Hoare triple {52054#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52055#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:37,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {52055#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52055#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:37,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {52055#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52056#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:37,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {52056#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52056#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:37,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {52056#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52057#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:37,381 INFO L290 TraceCheckUtils]: 100: Hoare triple {52057#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52057#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:37,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {52057#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52058#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:37,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {52058#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52058#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:37,382 INFO L290 TraceCheckUtils]: 103: Hoare triple {52058#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52059#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:37,383 INFO L290 TraceCheckUtils]: 104: Hoare triple {52059#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52059#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:37,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {52059#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52060#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:37,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {52060#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52060#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:37,384 INFO L290 TraceCheckUtils]: 107: Hoare triple {52060#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52061#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:37,384 INFO L290 TraceCheckUtils]: 108: Hoare triple {52061#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52061#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:37,384 INFO L290 TraceCheckUtils]: 109: Hoare triple {52061#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52062#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:37,384 INFO L290 TraceCheckUtils]: 110: Hoare triple {52062#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52062#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:37,385 INFO L290 TraceCheckUtils]: 111: Hoare triple {52062#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52063#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:37,385 INFO L290 TraceCheckUtils]: 112: Hoare triple {52063#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52063#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:37,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {52063#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52064#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:37,386 INFO L290 TraceCheckUtils]: 114: Hoare triple {52064#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52064#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:37,386 INFO L290 TraceCheckUtils]: 115: Hoare triple {52064#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52065#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:37,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {52065#(<= main_~i~0 55)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-28 03:01:37,386 INFO L290 TraceCheckUtils]: 117: Hoare triple {52006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {52006#false} is VALID [2022-04-28 03:01:37,387 INFO L272 TraceCheckUtils]: 118: Hoare triple {52006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {52006#false} is VALID [2022-04-28 03:01:37,387 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-28 03:01:37,387 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-28 03:01:37,387 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-28 03:01:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:37,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:40,730 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-28 03:01:40,730 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-28 03:01:40,730 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-28 03:01:40,730 INFO L272 TraceCheckUtils]: 118: Hoare triple {52006#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {52006#false} is VALID [2022-04-28 03:01:40,730 INFO L290 TraceCheckUtils]: 117: Hoare triple {52006#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {52006#false} is VALID [2022-04-28 03:01:40,730 INFO L290 TraceCheckUtils]: 116: Hoare triple {52449#(< main_~i~0 2048)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-28 03:01:40,731 INFO L290 TraceCheckUtils]: 115: Hoare triple {52453#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52449#(< main_~i~0 2048)} is VALID [2022-04-28 03:01:40,731 INFO L290 TraceCheckUtils]: 114: Hoare triple {52453#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52453#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:40,731 INFO L290 TraceCheckUtils]: 113: Hoare triple {52460#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52453#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:40,732 INFO L290 TraceCheckUtils]: 112: Hoare triple {52460#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52460#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:40,732 INFO L290 TraceCheckUtils]: 111: Hoare triple {52467#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52460#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:40,732 INFO L290 TraceCheckUtils]: 110: Hoare triple {52467#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52467#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:40,732 INFO L290 TraceCheckUtils]: 109: Hoare triple {52474#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52467#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:40,733 INFO L290 TraceCheckUtils]: 108: Hoare triple {52474#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52474#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:40,733 INFO L290 TraceCheckUtils]: 107: Hoare triple {52481#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52474#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:40,733 INFO L290 TraceCheckUtils]: 106: Hoare triple {52481#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52481#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:40,734 INFO L290 TraceCheckUtils]: 105: Hoare triple {52488#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52481#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:40,734 INFO L290 TraceCheckUtils]: 104: Hoare triple {52488#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52488#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:40,734 INFO L290 TraceCheckUtils]: 103: Hoare triple {52495#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52488#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:40,734 INFO L290 TraceCheckUtils]: 102: Hoare triple {52495#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52495#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:40,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {52502#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52495#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:40,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {52502#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52502#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:40,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {52509#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52502#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:40,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {52509#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52509#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:40,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {52516#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52509#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:40,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {52516#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52516#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:40,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {52523#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52516#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:40,737 INFO L290 TraceCheckUtils]: 94: Hoare triple {52523#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52523#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:40,737 INFO L290 TraceCheckUtils]: 93: Hoare triple {52530#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52523#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:40,737 INFO L290 TraceCheckUtils]: 92: Hoare triple {52530#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52530#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:40,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {52537#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52530#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:40,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {52537#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52537#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:40,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {52544#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52537#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:40,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {52544#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52544#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:40,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {52551#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52544#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:40,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {52551#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52551#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:40,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {52558#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52551#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:40,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {52558#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52558#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:40,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {52565#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52558#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:40,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {52565#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52565#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:40,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {52572#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52565#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:40,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {52572#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52572#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:40,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {52579#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52572#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:40,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {52579#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52579#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:40,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {52586#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52579#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:40,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {52586#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52586#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:40,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {52593#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52586#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:40,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {52593#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52593#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:40,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {52600#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52593#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:40,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {52600#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52600#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:40,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {52607#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52600#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:40,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {52607#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52607#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:40,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {52614#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52607#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:40,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {52614#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52614#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:40,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {52621#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52614#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:40,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {52621#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52621#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:40,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {52628#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52621#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:40,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {52628#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52628#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:40,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {52635#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52628#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:40,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {52635#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52635#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:40,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {52642#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52635#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:40,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {52642#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52642#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:40,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {52649#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52642#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:40,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {52649#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52649#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:40,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {52656#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52649#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:40,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {52656#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52656#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:40,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {52663#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52656#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:40,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {52663#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52663#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:40,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {52670#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52663#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:40,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {52670#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52670#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:40,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {52677#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52670#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:40,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {52677#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52677#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:40,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {52684#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52677#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:40,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {52684#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52684#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:40,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {52691#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52684#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:40,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {52691#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52691#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:40,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {52698#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52691#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:40,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {52698#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52698#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:40,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {52705#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52698#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:40,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {52705#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52705#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:40,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {52712#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52705#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:40,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {52712#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52712#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:40,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {52719#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52712#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:40,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {52719#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52719#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:40,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {52726#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52719#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:40,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {52726#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52726#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:40,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {52733#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52726#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:40,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {52733#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52733#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:40,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {52740#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52733#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:40,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {52740#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52740#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:40,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {52747#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52740#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:40,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {52747#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52747#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:40,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {52754#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52747#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:40,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {52754#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52754#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:40,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {52761#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52754#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:40,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {52761#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52761#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:40,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {52768#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52761#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:40,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {52768#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52768#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:40,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {52775#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52768#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:40,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {52775#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52775#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:40,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {52782#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52775#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:40,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {52782#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52782#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:40,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {52789#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52782#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:40,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {52789#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52789#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:40,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {52796#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52789#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:40,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {52796#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52796#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:40,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {52803#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52796#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:40,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {52803#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52803#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:40,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {52810#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52803#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:40,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {52810#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52810#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:40,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {52817#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52810#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:40,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {52817#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52817#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:40,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {52824#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52817#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:40,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {52824#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52824#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:40,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {52831#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52824#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:40,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {52831#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {52831#(< main_~i~0 1993)} is VALID [2022-04-28 03:01:40,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {52005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {52831#(< main_~i~0 1993)} is VALID [2022-04-28 03:01:40,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-28 03:01:40,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-28 03:01:40,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-28 03:01:40,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {52005#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(12, 2); {52005#true} is VALID [2022-04-28 03:01:40,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {52005#true} call ULTIMATE.init(); {52005#true} is VALID [2022-04-28 03:01:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:40,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965195792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:40,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:40,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-28 03:01:40,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1775236783] [2022-04-28 03:01:40,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1775236783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:40,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:40,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:01:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589584049] [2022-04-28 03:01:40,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 03:01:40,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:40,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:40,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:01:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:01:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:01:40,841 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,011 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-28 03:01:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:01:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 03:01:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 132 transitions. [2022-04-28 03:01:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 132 transitions. [2022-04-28 03:01:43,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 132 transitions. [2022-04-28 03:01:43,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:43,106 INFO L225 Difference]: With dead ends: 132 [2022-04-28 03:01:43,106 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 03:01:43,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:01:43,108 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:43,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 49 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:01:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 03:01:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-04-28 03:01:43,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:43,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,724 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,724 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,725 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-28 03:01:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2022-04-28 03:01:43,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:43,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:43,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-28 03:01:43,725 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-28 03:01:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,726 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-28 03:01:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2022-04-28 03:01:43,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:43,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:43,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:43,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2022-04-28 03:01:43,727 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2022-04-28 03:01:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:43,727 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2022-04-28 03:01:43,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0) internal successors, (118), 58 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:43,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 125 transitions. [2022-04-28 03:01:43,876 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 03:01:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2022-04-28 03:01:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 03:01:43,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:43,877 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:43,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:44,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:44,077 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417814, now seen corresponding path program 111 times [2022-04-28 03:01:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:44,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40564657] [2022-04-28 03:01:44,079 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:44,079 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:44,079 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417814, now seen corresponding path program 112 times [2022-04-28 03:01:44,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:44,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384307803] [2022-04-28 03:01:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {53795#(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(12, 2); {53733#true} is VALID [2022-04-28 03:01:45,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-28 03:01:45,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-28 03:01:45,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {53733#true} call ULTIMATE.init(); {53795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:45,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {53795#(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(12, 2); {53733#true} is VALID [2022-04-28 03:01:45,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-28 03:01:45,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-28 03:01:45,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-28 03:01:45,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {53733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {53738#(= main_~i~0 0)} is VALID [2022-04-28 03:01:45,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {53738#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53738#(= main_~i~0 0)} is VALID [2022-04-28 03:01:45,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {53738#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53739#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:45,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {53739#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53739#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:45,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {53739#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53740#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:45,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {53740#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53740#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:45,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {53740#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53741#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:45,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {53741#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53741#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:45,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {53741#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53742#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:45,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {53742#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53742#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:45,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {53742#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53743#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:45,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {53743#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53743#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:45,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {53743#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53744#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:45,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {53744#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53744#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:45,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {53744#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53745#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:45,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {53745#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53745#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:45,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {53745#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53746#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:45,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {53746#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53746#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:45,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {53746#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53747#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:45,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {53747#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53747#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:45,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {53747#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53748#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:45,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {53748#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53748#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:45,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {53748#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53749#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:45,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {53749#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53749#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:45,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {53749#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53750#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:45,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {53750#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53750#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:45,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {53750#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53751#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:45,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {53751#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53751#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:45,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {53751#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53752#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:45,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {53752#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53752#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:45,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {53752#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53753#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:45,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {53753#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53753#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:45,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {53753#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53754#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:45,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {53754#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53754#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:45,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {53754#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53755#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:45,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {53755#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53755#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:45,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {53755#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53756#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:45,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {53756#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53756#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:45,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {53756#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53757#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:45,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {53757#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53757#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:45,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {53757#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53758#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:45,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {53758#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53758#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:45,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {53758#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53759#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:45,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {53759#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53759#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:45,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {53759#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53760#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:45,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {53760#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53760#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:45,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {53760#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53761#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:45,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {53761#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53761#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:45,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {53761#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53762#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:45,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {53762#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53762#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:45,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {53762#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53763#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:45,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {53763#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53763#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:45,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {53763#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53764#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:45,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {53764#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53764#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:45,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {53764#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53765#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:45,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {53765#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53765#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:45,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {53765#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53766#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:45,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {53766#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53766#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:45,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {53766#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53767#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:45,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {53767#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53767#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:45,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {53767#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53768#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:45,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {53768#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53768#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:45,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {53768#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53769#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:45,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {53769#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53769#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:45,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {53769#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53770#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:45,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {53770#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53770#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:45,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {53770#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53771#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:45,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {53771#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53771#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:45,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {53771#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53772#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:45,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {53772#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53772#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:45,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {53772#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53773#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:45,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {53773#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53773#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:45,216 INFO L290 TraceCheckUtils]: 77: Hoare triple {53773#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53774#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:45,216 INFO L290 TraceCheckUtils]: 78: Hoare triple {53774#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53774#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:45,216 INFO L290 TraceCheckUtils]: 79: Hoare triple {53774#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53775#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:45,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {53775#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53775#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:45,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {53775#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53776#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:45,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {53776#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53776#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:45,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {53776#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53777#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:45,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {53777#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53777#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:45,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {53777#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53778#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:45,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {53778#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53778#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:45,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {53778#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53779#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:45,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {53779#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53779#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:45,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {53779#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53780#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:45,219 INFO L290 TraceCheckUtils]: 90: Hoare triple {53780#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53780#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:45,220 INFO L290 TraceCheckUtils]: 91: Hoare triple {53780#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53781#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:45,220 INFO L290 TraceCheckUtils]: 92: Hoare triple {53781#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53781#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:45,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {53781#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53782#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:45,220 INFO L290 TraceCheckUtils]: 94: Hoare triple {53782#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53782#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:45,221 INFO L290 TraceCheckUtils]: 95: Hoare triple {53782#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53783#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:45,221 INFO L290 TraceCheckUtils]: 96: Hoare triple {53783#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53783#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:45,221 INFO L290 TraceCheckUtils]: 97: Hoare triple {53783#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53784#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:45,221 INFO L290 TraceCheckUtils]: 98: Hoare triple {53784#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53784#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:45,222 INFO L290 TraceCheckUtils]: 99: Hoare triple {53784#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53785#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:45,222 INFO L290 TraceCheckUtils]: 100: Hoare triple {53785#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53785#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:45,222 INFO L290 TraceCheckUtils]: 101: Hoare triple {53785#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53786#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:45,223 INFO L290 TraceCheckUtils]: 102: Hoare triple {53786#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53786#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:45,223 INFO L290 TraceCheckUtils]: 103: Hoare triple {53786#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53787#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:45,223 INFO L290 TraceCheckUtils]: 104: Hoare triple {53787#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53787#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:45,223 INFO L290 TraceCheckUtils]: 105: Hoare triple {53787#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53788#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:45,224 INFO L290 TraceCheckUtils]: 106: Hoare triple {53788#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53788#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:45,224 INFO L290 TraceCheckUtils]: 107: Hoare triple {53788#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53789#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:45,224 INFO L290 TraceCheckUtils]: 108: Hoare triple {53789#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53789#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:45,225 INFO L290 TraceCheckUtils]: 109: Hoare triple {53789#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53790#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:45,225 INFO L290 TraceCheckUtils]: 110: Hoare triple {53790#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53790#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:45,225 INFO L290 TraceCheckUtils]: 111: Hoare triple {53790#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53791#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:45,225 INFO L290 TraceCheckUtils]: 112: Hoare triple {53791#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53791#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:45,226 INFO L290 TraceCheckUtils]: 113: Hoare triple {53791#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53792#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:45,226 INFO L290 TraceCheckUtils]: 114: Hoare triple {53792#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53792#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:45,226 INFO L290 TraceCheckUtils]: 115: Hoare triple {53792#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53793#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:45,226 INFO L290 TraceCheckUtils]: 116: Hoare triple {53793#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53793#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 117: Hoare triple {53793#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53794#(<= main_~i~0 56)} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 118: Hoare triple {53794#(<= main_~i~0 56)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 119: Hoare triple {53734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {53734#false} is VALID [2022-04-28 03:01:45,227 INFO L272 TraceCheckUtils]: 120: Hoare triple {53734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {53734#false} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-28 03:01:45,227 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-28 03:01:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:45,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:45,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384307803] [2022-04-28 03:01:45,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384307803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:45,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515796138] [2022-04-28 03:01:45,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:45,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:45,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:45,230 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:45,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 03:01:45,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:45,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:45,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 03:01:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:46,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {53733#true} call ULTIMATE.init(); {53733#true} is VALID [2022-04-28 03:01:46,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {53733#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(12, 2); {53733#true} is VALID [2022-04-28 03:01:46,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-28 03:01:46,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-28 03:01:46,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-28 03:01:46,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {53733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {53814#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:46,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {53814#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53814#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:46,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {53814#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53739#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:46,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {53739#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53739#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:46,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {53739#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53740#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:46,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {53740#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53740#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:46,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {53740#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53741#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:46,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {53741#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53741#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:46,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {53741#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53742#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:46,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {53742#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53742#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:46,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {53742#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53743#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:46,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {53743#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53743#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:46,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {53743#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53744#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:46,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {53744#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53744#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:46,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {53744#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53745#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:46,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {53745#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53745#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:46,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {53745#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53746#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:46,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {53746#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53746#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:46,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {53746#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53747#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:46,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {53747#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53747#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:46,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {53747#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53748#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:46,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {53748#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53748#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:46,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {53748#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53749#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:46,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {53749#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53749#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:46,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {53749#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53750#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:46,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {53750#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53750#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:46,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {53750#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53751#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:46,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {53751#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53751#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:46,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {53751#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53752#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:46,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {53752#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53752#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:46,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {53752#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53753#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:46,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {53753#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53753#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:46,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {53753#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53754#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:46,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {53754#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53754#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:46,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {53754#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53755#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:46,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {53755#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53755#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:46,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {53755#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53756#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:46,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {53756#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53756#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:46,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {53756#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53757#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:46,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {53757#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53757#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:46,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {53757#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53758#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:46,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {53758#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53758#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:46,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {53758#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53759#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:46,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {53759#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53759#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:46,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {53759#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53760#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:46,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {53760#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53760#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:46,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {53760#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53761#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:46,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {53761#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53761#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:46,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {53761#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53762#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:46,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {53762#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53762#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:46,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {53762#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53763#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:46,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {53763#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53763#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:46,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {53763#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53764#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:46,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {53764#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53764#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:46,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {53764#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53765#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:46,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {53765#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53765#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:46,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {53765#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53766#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:46,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {53766#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53766#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:46,291 INFO L290 TraceCheckUtils]: 63: Hoare triple {53766#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53767#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:46,291 INFO L290 TraceCheckUtils]: 64: Hoare triple {53767#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53767#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:46,291 INFO L290 TraceCheckUtils]: 65: Hoare triple {53767#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53768#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:46,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {53768#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53768#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:46,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {53768#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53769#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:46,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {53769#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53769#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:46,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {53769#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53770#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:46,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {53770#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53770#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:46,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {53770#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53771#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:46,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {53771#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53771#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:46,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {53771#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53772#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:46,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {53772#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53772#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:46,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {53772#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53773#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:46,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {53773#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53773#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:46,295 INFO L290 TraceCheckUtils]: 77: Hoare triple {53773#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53774#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:46,295 INFO L290 TraceCheckUtils]: 78: Hoare triple {53774#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53774#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:46,295 INFO L290 TraceCheckUtils]: 79: Hoare triple {53774#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53775#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:46,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {53775#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53775#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:46,296 INFO L290 TraceCheckUtils]: 81: Hoare triple {53775#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53776#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:46,296 INFO L290 TraceCheckUtils]: 82: Hoare triple {53776#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53776#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:46,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {53776#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53777#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:46,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {53777#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53777#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:46,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {53777#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53778#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:46,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {53778#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53778#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:46,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {53778#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53779#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:46,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {53779#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53779#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:46,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {53779#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53780#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:46,299 INFO L290 TraceCheckUtils]: 90: Hoare triple {53780#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53780#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:46,299 INFO L290 TraceCheckUtils]: 91: Hoare triple {53780#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53781#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:46,299 INFO L290 TraceCheckUtils]: 92: Hoare triple {53781#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53781#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:46,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {53781#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53782#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:46,300 INFO L290 TraceCheckUtils]: 94: Hoare triple {53782#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53782#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:46,300 INFO L290 TraceCheckUtils]: 95: Hoare triple {53782#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53783#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:46,300 INFO L290 TraceCheckUtils]: 96: Hoare triple {53783#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53783#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:46,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {53783#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53784#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:46,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {53784#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53784#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:46,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {53784#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53785#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:46,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {53785#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53785#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:46,302 INFO L290 TraceCheckUtils]: 101: Hoare triple {53785#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53786#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:46,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {53786#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53786#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:46,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {53786#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53787#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:46,303 INFO L290 TraceCheckUtils]: 104: Hoare triple {53787#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53787#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:46,303 INFO L290 TraceCheckUtils]: 105: Hoare triple {53787#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53788#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:46,303 INFO L290 TraceCheckUtils]: 106: Hoare triple {53788#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53788#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:46,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {53788#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53789#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:46,304 INFO L290 TraceCheckUtils]: 108: Hoare triple {53789#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53789#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:46,304 INFO L290 TraceCheckUtils]: 109: Hoare triple {53789#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53790#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:46,305 INFO L290 TraceCheckUtils]: 110: Hoare triple {53790#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53790#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:46,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {53790#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53791#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:46,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {53791#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53791#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:46,306 INFO L290 TraceCheckUtils]: 113: Hoare triple {53791#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53792#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:46,306 INFO L290 TraceCheckUtils]: 114: Hoare triple {53792#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53792#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:46,306 INFO L290 TraceCheckUtils]: 115: Hoare triple {53792#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53793#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:46,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {53793#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {53793#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 117: Hoare triple {53793#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53794#(<= main_~i~0 56)} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 118: Hoare triple {53794#(<= main_~i~0 56)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {53734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {53734#false} is VALID [2022-04-28 03:01:46,307 INFO L272 TraceCheckUtils]: 120: Hoare triple {53734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {53734#false} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-28 03:01:46,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-28 03:01:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:46,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:49,718 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-28 03:01:49,718 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-28 03:01:49,718 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-28 03:01:49,718 INFO L272 TraceCheckUtils]: 120: Hoare triple {53734#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {53734#false} is VALID [2022-04-28 03:01:49,718 INFO L290 TraceCheckUtils]: 119: Hoare triple {53734#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {53734#false} is VALID [2022-04-28 03:01:49,718 INFO L290 TraceCheckUtils]: 118: Hoare triple {54184#(< main_~i~0 2048)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-28 03:01:49,719 INFO L290 TraceCheckUtils]: 117: Hoare triple {54188#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54184#(< main_~i~0 2048)} is VALID [2022-04-28 03:01:49,719 INFO L290 TraceCheckUtils]: 116: Hoare triple {54188#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54188#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:49,719 INFO L290 TraceCheckUtils]: 115: Hoare triple {54195#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54188#(< main_~i~0 2047)} is VALID [2022-04-28 03:01:49,720 INFO L290 TraceCheckUtils]: 114: Hoare triple {54195#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54195#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:49,720 INFO L290 TraceCheckUtils]: 113: Hoare triple {54202#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54195#(< main_~i~0 2046)} is VALID [2022-04-28 03:01:49,720 INFO L290 TraceCheckUtils]: 112: Hoare triple {54202#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54202#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:49,721 INFO L290 TraceCheckUtils]: 111: Hoare triple {54209#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54202#(< main_~i~0 2045)} is VALID [2022-04-28 03:01:49,721 INFO L290 TraceCheckUtils]: 110: Hoare triple {54209#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54209#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:49,721 INFO L290 TraceCheckUtils]: 109: Hoare triple {54216#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54209#(< main_~i~0 2044)} is VALID [2022-04-28 03:01:49,721 INFO L290 TraceCheckUtils]: 108: Hoare triple {54216#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54216#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:49,722 INFO L290 TraceCheckUtils]: 107: Hoare triple {54223#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54216#(< main_~i~0 2043)} is VALID [2022-04-28 03:01:49,722 INFO L290 TraceCheckUtils]: 106: Hoare triple {54223#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54223#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:49,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {54230#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54223#(< main_~i~0 2042)} is VALID [2022-04-28 03:01:49,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {54230#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54230#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:49,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {54237#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54230#(< main_~i~0 2041)} is VALID [2022-04-28 03:01:49,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {54237#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54237#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:49,723 INFO L290 TraceCheckUtils]: 101: Hoare triple {54244#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54237#(< main_~i~0 2040)} is VALID [2022-04-28 03:01:49,724 INFO L290 TraceCheckUtils]: 100: Hoare triple {54244#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54244#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:49,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {54251#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54244#(< main_~i~0 2039)} is VALID [2022-04-28 03:01:49,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {54251#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54251#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:49,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {54258#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54251#(< main_~i~0 2038)} is VALID [2022-04-28 03:01:49,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {54258#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54258#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:49,725 INFO L290 TraceCheckUtils]: 95: Hoare triple {54265#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54258#(< main_~i~0 2037)} is VALID [2022-04-28 03:01:49,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {54265#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54265#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:49,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {54272#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54265#(< main_~i~0 2036)} is VALID [2022-04-28 03:01:49,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {54272#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54272#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:49,726 INFO L290 TraceCheckUtils]: 91: Hoare triple {54279#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54272#(< main_~i~0 2035)} is VALID [2022-04-28 03:01:49,726 INFO L290 TraceCheckUtils]: 90: Hoare triple {54279#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54279#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:49,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {54286#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54279#(< main_~i~0 2034)} is VALID [2022-04-28 03:01:49,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {54286#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54286#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:49,728 INFO L290 TraceCheckUtils]: 87: Hoare triple {54293#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54286#(< main_~i~0 2033)} is VALID [2022-04-28 03:01:49,728 INFO L290 TraceCheckUtils]: 86: Hoare triple {54293#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54293#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:49,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {54300#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54293#(< main_~i~0 2032)} is VALID [2022-04-28 03:01:49,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {54300#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54300#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:49,729 INFO L290 TraceCheckUtils]: 83: Hoare triple {54307#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54300#(< main_~i~0 2031)} is VALID [2022-04-28 03:01:49,729 INFO L290 TraceCheckUtils]: 82: Hoare triple {54307#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54307#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:49,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {54314#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54307#(< main_~i~0 2030)} is VALID [2022-04-28 03:01:49,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {54314#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54314#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:49,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {54321#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54314#(< main_~i~0 2029)} is VALID [2022-04-28 03:01:49,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {54321#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54321#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:49,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {54328#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54321#(< main_~i~0 2028)} is VALID [2022-04-28 03:01:49,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {54328#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54328#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:49,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {54335#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54328#(< main_~i~0 2027)} is VALID [2022-04-28 03:01:49,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {54335#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54335#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:49,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {54342#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54335#(< main_~i~0 2026)} is VALID [2022-04-28 03:01:49,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {54342#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54342#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:49,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {54349#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54342#(< main_~i~0 2025)} is VALID [2022-04-28 03:01:49,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {54349#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54349#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:49,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {54356#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54349#(< main_~i~0 2024)} is VALID [2022-04-28 03:01:49,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {54356#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54356#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:49,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {54363#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54356#(< main_~i~0 2023)} is VALID [2022-04-28 03:01:49,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {54363#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54363#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:49,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {54370#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54363#(< main_~i~0 2022)} is VALID [2022-04-28 03:01:49,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {54370#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54370#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:49,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {54377#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54370#(< main_~i~0 2021)} is VALID [2022-04-28 03:01:49,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {54377#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54377#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:49,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {54384#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54377#(< main_~i~0 2020)} is VALID [2022-04-28 03:01:49,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {54384#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54384#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:49,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {54391#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54384#(< main_~i~0 2019)} is VALID [2022-04-28 03:01:49,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {54391#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54391#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:49,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {54398#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54391#(< main_~i~0 2018)} is VALID [2022-04-28 03:01:49,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {54398#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54398#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:49,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {54405#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54398#(< main_~i~0 2017)} is VALID [2022-04-28 03:01:49,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {54405#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54405#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:49,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {54412#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54405#(< main_~i~0 2016)} is VALID [2022-04-28 03:01:49,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {54412#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54412#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:49,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {54419#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54412#(< main_~i~0 2015)} is VALID [2022-04-28 03:01:49,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {54419#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54419#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:49,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {54426#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54419#(< main_~i~0 2014)} is VALID [2022-04-28 03:01:49,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {54426#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54426#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:49,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {54433#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54426#(< main_~i~0 2013)} is VALID [2022-04-28 03:01:49,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {54433#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54433#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:49,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {54440#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54433#(< main_~i~0 2012)} is VALID [2022-04-28 03:01:49,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {54440#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54440#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:49,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {54447#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54440#(< main_~i~0 2011)} is VALID [2022-04-28 03:01:49,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {54447#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54447#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:49,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {54454#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54447#(< main_~i~0 2010)} is VALID [2022-04-28 03:01:49,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {54454#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54454#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:49,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {54461#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54454#(< main_~i~0 2009)} is VALID [2022-04-28 03:01:49,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {54461#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54461#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:49,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {54468#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54461#(< main_~i~0 2008)} is VALID [2022-04-28 03:01:49,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {54468#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54468#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:49,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {54475#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54468#(< main_~i~0 2007)} is VALID [2022-04-28 03:01:49,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {54475#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54475#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:49,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {54482#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54475#(< main_~i~0 2006)} is VALID [2022-04-28 03:01:49,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {54482#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54482#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:49,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {54489#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54482#(< main_~i~0 2005)} is VALID [2022-04-28 03:01:49,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {54489#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54489#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:49,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {54496#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54489#(< main_~i~0 2004)} is VALID [2022-04-28 03:01:49,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {54496#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54496#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:49,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {54503#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54496#(< main_~i~0 2003)} is VALID [2022-04-28 03:01:49,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {54503#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54503#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:49,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {54510#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54503#(< main_~i~0 2002)} is VALID [2022-04-28 03:01:49,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {54510#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54510#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:49,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {54517#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54510#(< main_~i~0 2001)} is VALID [2022-04-28 03:01:49,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {54517#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54517#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:49,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {54524#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54517#(< main_~i~0 2000)} is VALID [2022-04-28 03:01:49,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {54524#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54524#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:49,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {54531#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54524#(< main_~i~0 1999)} is VALID [2022-04-28 03:01:49,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {54531#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54531#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:49,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {54538#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54531#(< main_~i~0 1998)} is VALID [2022-04-28 03:01:49,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {54538#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54538#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:49,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {54545#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54538#(< main_~i~0 1997)} is VALID [2022-04-28 03:01:49,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {54545#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54545#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:49,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {54552#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54545#(< main_~i~0 1996)} is VALID [2022-04-28 03:01:49,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {54552#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54552#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:49,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {54559#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54552#(< main_~i~0 1995)} is VALID [2022-04-28 03:01:49,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {54559#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54559#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:49,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {54566#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54559#(< main_~i~0 1994)} is VALID [2022-04-28 03:01:49,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {54566#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54566#(< main_~i~0 1993)} is VALID [2022-04-28 03:01:49,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {54573#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54566#(< main_~i~0 1993)} is VALID [2022-04-28 03:01:49,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {54573#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {54573#(< main_~i~0 1992)} is VALID [2022-04-28 03:01:49,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {53733#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {54573#(< main_~i~0 1992)} is VALID [2022-04-28 03:01:49,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-28 03:01:49,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-28 03:01:49,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-28 03:01:49,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {53733#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(12, 2); {53733#true} is VALID [2022-04-28 03:01:49,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {53733#true} call ULTIMATE.init(); {53733#true} is VALID [2022-04-28 03:01:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515796138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:49,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:49,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-28 03:01:49,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40564657] [2022-04-28 03:01:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40564657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:49,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:49,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:01:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175859381] [2022-04-28 03:01:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:49,753 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 03:01:49,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:49,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:49,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:49,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:01:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:01:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6788, Invalid=7018, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:01:49,829 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,126 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-28 03:01:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:01:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 03:01:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 134 transitions. [2022-04-28 03:01:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 134 transitions. [2022-04-28 03:01:52,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 134 transitions. [2022-04-28 03:01:52,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:52,222 INFO L225 Difference]: With dead ends: 134 [2022-04-28 03:01:52,222 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 03:01:52,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13458, Invalid=16992, Unknown=0, NotChecked=0, Total=30450 [2022-04-28 03:01:52,225 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 122 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:52,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 39 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:01:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 03:01:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-04-28 03:01:52,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:52,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,852 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,852 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,853 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-28 03:01:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2022-04-28 03:01:52,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:52,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:52,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-28 03:01:52,854 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-28 03:01:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,855 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-28 03:01:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2022-04-28 03:01:52,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:52,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:52,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:52,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0081967213114753) internal successors, (123), 122 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2022-04-28 03:01:52,857 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2022-04-28 03:01:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:52,857 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2022-04-28 03:01:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 127 transitions. [2022-04-28 03:01:53,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2022-04-28 03:01:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 03:01:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:53,017 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:53,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:53,218 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1615753652, now seen corresponding path program 113 times [2022-04-28 03:01:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269847581] [2022-04-28 03:01:53,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:53,221 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:53,221 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1615753652, now seen corresponding path program 114 times [2022-04-28 03:01:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:53,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402965155] [2022-04-28 03:01:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:54,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {55552#(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(12, 2); {55489#true} is VALID [2022-04-28 03:01:54,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-28 03:01:54,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-28 03:01:54,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {55489#true} call ULTIMATE.init(); {55552#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:54,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {55552#(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(12, 2); {55489#true} is VALID [2022-04-28 03:01:54,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-28 03:01:54,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-28 03:01:54,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-28 03:01:54,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {55489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {55494#(= main_~i~0 0)} is VALID [2022-04-28 03:01:54,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {55494#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55494#(= main_~i~0 0)} is VALID [2022-04-28 03:01:54,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {55494#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55495#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:54,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {55495#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55495#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:54,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {55495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55496#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:54,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {55496#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55496#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:54,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {55496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55497#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:54,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {55497#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55497#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:54,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {55497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55498#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:54,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {55498#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55498#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:54,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {55498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55499#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:54,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {55499#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55499#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:54,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {55499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55500#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:54,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {55500#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55500#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:54,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {55500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55501#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:54,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {55501#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55501#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:54,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {55501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55502#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:54,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {55502#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55502#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:54,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {55502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55503#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:54,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {55503#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55503#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:54,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {55503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55504#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:54,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {55504#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55504#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:54,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {55504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55505#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:54,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {55505#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55505#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:54,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {55505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55506#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:54,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {55506#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55506#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:54,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {55506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55507#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:54,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {55507#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55507#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:54,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {55507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55508#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:54,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {55508#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55508#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:54,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {55508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55509#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:54,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {55509#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55509#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:54,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {55509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55510#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:54,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {55510#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55510#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:54,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {55510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55511#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:54,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {55511#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55511#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:54,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {55511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55512#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:54,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {55512#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55512#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:54,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {55512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55513#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:54,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {55513#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55513#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:54,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {55513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55514#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:54,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {55514#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55514#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:54,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {55514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55515#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:54,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {55515#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55515#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:54,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {55515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55516#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:54,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {55516#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55516#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:54,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {55516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55517#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:54,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {55517#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55517#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:54,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {55517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55518#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:54,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {55518#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55518#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:54,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {55518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55519#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:54,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {55519#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55519#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:54,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {55519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55520#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:54,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {55520#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55520#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:54,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {55520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55521#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:54,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {55521#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55521#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:54,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {55521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55522#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:54,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {55522#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55522#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:54,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {55522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55523#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:54,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {55523#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55523#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:54,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {55523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55524#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:54,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {55524#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55524#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:54,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {55524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55525#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:54,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {55525#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55525#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:54,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {55525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55526#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:54,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {55526#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55526#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:54,446 INFO L290 TraceCheckUtils]: 71: Hoare triple {55526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55527#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:54,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {55527#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55527#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:54,447 INFO L290 TraceCheckUtils]: 73: Hoare triple {55527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55528#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:54,447 INFO L290 TraceCheckUtils]: 74: Hoare triple {55528#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55528#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:54,447 INFO L290 TraceCheckUtils]: 75: Hoare triple {55528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55529#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:54,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {55529#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55529#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:54,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {55529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55530#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:54,448 INFO L290 TraceCheckUtils]: 78: Hoare triple {55530#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55530#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:54,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {55530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55531#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:54,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {55531#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55531#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:54,459 INFO L290 TraceCheckUtils]: 81: Hoare triple {55531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55532#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:54,459 INFO L290 TraceCheckUtils]: 82: Hoare triple {55532#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55532#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:54,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {55532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55533#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:54,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {55533#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55533#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:54,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {55533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55534#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:54,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {55534#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55534#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:54,460 INFO L290 TraceCheckUtils]: 87: Hoare triple {55534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55535#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:54,460 INFO L290 TraceCheckUtils]: 88: Hoare triple {55535#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55535#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:54,461 INFO L290 TraceCheckUtils]: 89: Hoare triple {55535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55536#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:54,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {55536#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55536#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:54,461 INFO L290 TraceCheckUtils]: 91: Hoare triple {55536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55537#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:54,462 INFO L290 TraceCheckUtils]: 92: Hoare triple {55537#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55537#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:54,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {55537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55538#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:54,462 INFO L290 TraceCheckUtils]: 94: Hoare triple {55538#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55538#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:54,463 INFO L290 TraceCheckUtils]: 95: Hoare triple {55538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55539#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:54,463 INFO L290 TraceCheckUtils]: 96: Hoare triple {55539#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55539#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:54,463 INFO L290 TraceCheckUtils]: 97: Hoare triple {55539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55540#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:54,463 INFO L290 TraceCheckUtils]: 98: Hoare triple {55540#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55540#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:54,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {55540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55541#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:54,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {55541#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55541#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:54,464 INFO L290 TraceCheckUtils]: 101: Hoare triple {55541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55542#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:54,464 INFO L290 TraceCheckUtils]: 102: Hoare triple {55542#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55542#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:54,465 INFO L290 TraceCheckUtils]: 103: Hoare triple {55542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55543#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:54,465 INFO L290 TraceCheckUtils]: 104: Hoare triple {55543#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55543#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:54,465 INFO L290 TraceCheckUtils]: 105: Hoare triple {55543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55544#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:54,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {55544#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55544#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:54,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {55544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55545#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:54,466 INFO L290 TraceCheckUtils]: 108: Hoare triple {55545#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55545#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:54,466 INFO L290 TraceCheckUtils]: 109: Hoare triple {55545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55546#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:54,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {55546#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55546#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:54,467 INFO L290 TraceCheckUtils]: 111: Hoare triple {55546#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55547#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:54,467 INFO L290 TraceCheckUtils]: 112: Hoare triple {55547#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55547#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:54,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {55547#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55548#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:54,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {55548#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55548#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:54,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {55548#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55549#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:54,468 INFO L290 TraceCheckUtils]: 116: Hoare triple {55549#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55549#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:54,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {55549#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55550#(<= main_~i~0 56)} is VALID [2022-04-28 03:01:54,469 INFO L290 TraceCheckUtils]: 118: Hoare triple {55550#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55550#(<= main_~i~0 56)} is VALID [2022-04-28 03:01:54,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {55550#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55551#(<= main_~i~0 57)} is VALID [2022-04-28 03:01:54,470 INFO L290 TraceCheckUtils]: 120: Hoare triple {55551#(<= main_~i~0 57)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L290 TraceCheckUtils]: 121: Hoare triple {55490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L272 TraceCheckUtils]: 122: Hoare triple {55490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-28 03:01:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402965155] [2022-04-28 03:01:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402965155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615101374] [2022-04-28 03:01:54,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:54,471 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:54,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 03:03:19,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2022-04-28 03:03:19,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:19,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 03:03:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:19,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:20,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {55489#true} call ULTIMATE.init(); {55489#true} is VALID [2022-04-28 03:03:20,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {55489#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(12, 2); {55489#true} is VALID [2022-04-28 03:03:20,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-28 03:03:20,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-28 03:03:20,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-28 03:03:20,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {55489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {55571#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:20,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {55571#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55571#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:20,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {55571#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55495#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:20,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {55495#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55495#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:20,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {55495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55496#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:20,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {55496#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55496#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:20,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {55496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55497#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:20,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {55497#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55497#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:20,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {55497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55498#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:20,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {55498#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55498#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:20,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {55498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55499#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:20,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {55499#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55499#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:20,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {55499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55500#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:20,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {55500#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55500#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:20,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {55500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55501#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:20,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {55501#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55501#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:20,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {55501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55502#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:20,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {55502#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55502#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:20,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {55502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55503#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:20,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {55503#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55503#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:20,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {55503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55504#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:20,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {55504#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55504#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:20,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {55504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55505#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:20,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {55505#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55505#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:20,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {55505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55506#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:20,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {55506#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55506#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:20,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {55506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55507#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:20,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {55507#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55507#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:20,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {55507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55508#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:20,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {55508#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55508#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:20,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {55508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55509#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:20,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {55509#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55509#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:20,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {55509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55510#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:20,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {55510#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55510#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:20,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {55510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55511#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:20,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {55511#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55511#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:20,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {55511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55512#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:20,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {55512#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55512#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:20,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {55512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55513#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:20,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {55513#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55513#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:20,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {55513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55514#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:20,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {55514#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55514#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:20,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {55514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55515#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:20,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {55515#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55515#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:20,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {55515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55516#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:20,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {55516#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55516#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:20,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {55516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55517#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:20,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {55517#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55517#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:20,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {55517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55518#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:20,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {55518#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55518#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:20,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {55518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55519#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:20,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {55519#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55519#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:20,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {55519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55520#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:20,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {55520#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55520#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:20,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {55520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55521#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:20,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {55521#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55521#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:20,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {55521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55522#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:20,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {55522#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55522#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:20,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {55522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55523#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:20,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {55523#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55523#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:20,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {55523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55524#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:20,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {55524#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55524#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:20,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {55524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55525#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:20,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {55525#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55525#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:20,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {55525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55526#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:20,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {55526#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55526#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:20,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {55526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55527#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:20,325 INFO L290 TraceCheckUtils]: 72: Hoare triple {55527#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55527#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:20,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {55527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55528#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:20,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {55528#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55528#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:20,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {55528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55529#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:20,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {55529#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55529#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:20,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {55529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55530#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:20,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {55530#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55530#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:20,327 INFO L290 TraceCheckUtils]: 79: Hoare triple {55530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55531#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:20,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {55531#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55531#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:20,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {55531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55532#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:20,328 INFO L290 TraceCheckUtils]: 82: Hoare triple {55532#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55532#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:20,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {55532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55533#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:20,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {55533#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55533#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:20,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {55533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55534#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:20,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {55534#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55534#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:20,329 INFO L290 TraceCheckUtils]: 87: Hoare triple {55534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55535#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:20,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {55535#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55535#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:20,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {55535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55536#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:20,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {55536#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55536#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:20,330 INFO L290 TraceCheckUtils]: 91: Hoare triple {55536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55537#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:20,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {55537#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55537#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:20,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {55537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55538#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:20,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {55538#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55538#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:20,331 INFO L290 TraceCheckUtils]: 95: Hoare triple {55538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55539#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:20,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {55539#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55539#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:20,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {55539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55540#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:20,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {55540#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55540#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:20,332 INFO L290 TraceCheckUtils]: 99: Hoare triple {55540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55541#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:20,333 INFO L290 TraceCheckUtils]: 100: Hoare triple {55541#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55541#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:20,333 INFO L290 TraceCheckUtils]: 101: Hoare triple {55541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55542#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:20,333 INFO L290 TraceCheckUtils]: 102: Hoare triple {55542#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55542#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:20,333 INFO L290 TraceCheckUtils]: 103: Hoare triple {55542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55543#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:20,334 INFO L290 TraceCheckUtils]: 104: Hoare triple {55543#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55543#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:20,334 INFO L290 TraceCheckUtils]: 105: Hoare triple {55543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55544#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:20,334 INFO L290 TraceCheckUtils]: 106: Hoare triple {55544#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55544#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:20,335 INFO L290 TraceCheckUtils]: 107: Hoare triple {55544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55545#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:20,335 INFO L290 TraceCheckUtils]: 108: Hoare triple {55545#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55545#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:20,335 INFO L290 TraceCheckUtils]: 109: Hoare triple {55545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55546#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:20,335 INFO L290 TraceCheckUtils]: 110: Hoare triple {55546#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55546#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:20,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {55546#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55547#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:20,336 INFO L290 TraceCheckUtils]: 112: Hoare triple {55547#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55547#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:20,336 INFO L290 TraceCheckUtils]: 113: Hoare triple {55547#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55548#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:20,336 INFO L290 TraceCheckUtils]: 114: Hoare triple {55548#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55548#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:20,337 INFO L290 TraceCheckUtils]: 115: Hoare triple {55548#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55549#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:20,337 INFO L290 TraceCheckUtils]: 116: Hoare triple {55549#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55549#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:20,337 INFO L290 TraceCheckUtils]: 117: Hoare triple {55549#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55550#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 118: Hoare triple {55550#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55550#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {55550#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55551#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 120: Hoare triple {55551#(<= main_~i~0 57)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 121: Hoare triple {55490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {55490#false} is VALID [2022-04-28 03:03:20,338 INFO L272 TraceCheckUtils]: 122: Hoare triple {55490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {55490#false} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-28 03:03:20,338 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-28 03:03:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:20,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:23,799 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-28 03:03:23,799 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-28 03:03:23,799 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-28 03:03:23,799 INFO L272 TraceCheckUtils]: 122: Hoare triple {55490#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {55490#false} is VALID [2022-04-28 03:03:23,799 INFO L290 TraceCheckUtils]: 121: Hoare triple {55490#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {55490#false} is VALID [2022-04-28 03:03:23,799 INFO L290 TraceCheckUtils]: 120: Hoare triple {55947#(< main_~i~0 2048)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-28 03:03:23,800 INFO L290 TraceCheckUtils]: 119: Hoare triple {55951#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55947#(< main_~i~0 2048)} is VALID [2022-04-28 03:03:23,800 INFO L290 TraceCheckUtils]: 118: Hoare triple {55951#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55951#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:23,800 INFO L290 TraceCheckUtils]: 117: Hoare triple {55958#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55951#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:23,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {55958#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55958#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:23,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {55965#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55958#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:23,801 INFO L290 TraceCheckUtils]: 114: Hoare triple {55965#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55965#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:23,802 INFO L290 TraceCheckUtils]: 113: Hoare triple {55972#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55965#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:23,802 INFO L290 TraceCheckUtils]: 112: Hoare triple {55972#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55972#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:23,802 INFO L290 TraceCheckUtils]: 111: Hoare triple {55979#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55972#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:23,802 INFO L290 TraceCheckUtils]: 110: Hoare triple {55979#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55979#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:23,803 INFO L290 TraceCheckUtils]: 109: Hoare triple {55986#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55979#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:23,803 INFO L290 TraceCheckUtils]: 108: Hoare triple {55986#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55986#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:23,803 INFO L290 TraceCheckUtils]: 107: Hoare triple {55993#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55986#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:23,803 INFO L290 TraceCheckUtils]: 106: Hoare triple {55993#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {55993#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:23,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {56000#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55993#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:23,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {56000#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56000#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:23,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {56007#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56000#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:23,805 INFO L290 TraceCheckUtils]: 102: Hoare triple {56007#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56007#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:23,805 INFO L290 TraceCheckUtils]: 101: Hoare triple {56014#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56007#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:23,805 INFO L290 TraceCheckUtils]: 100: Hoare triple {56014#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56014#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:23,806 INFO L290 TraceCheckUtils]: 99: Hoare triple {56021#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56014#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:23,806 INFO L290 TraceCheckUtils]: 98: Hoare triple {56021#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56021#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:23,806 INFO L290 TraceCheckUtils]: 97: Hoare triple {56028#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56021#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:23,806 INFO L290 TraceCheckUtils]: 96: Hoare triple {56028#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56028#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:23,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {56035#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56028#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:23,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {56035#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56035#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:23,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {56042#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56035#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:23,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {56042#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56042#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:23,808 INFO L290 TraceCheckUtils]: 91: Hoare triple {56049#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56042#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:23,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {56049#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56049#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:23,808 INFO L290 TraceCheckUtils]: 89: Hoare triple {56056#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56049#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:23,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {56056#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56056#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:23,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {56063#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56056#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:23,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {56063#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56063#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:23,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {56070#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56063#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:23,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {56070#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56070#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:23,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {56077#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56070#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:23,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {56077#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56077#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:23,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {56084#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56077#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:23,811 INFO L290 TraceCheckUtils]: 80: Hoare triple {56084#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56084#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:23,811 INFO L290 TraceCheckUtils]: 79: Hoare triple {56091#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56084#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:23,811 INFO L290 TraceCheckUtils]: 78: Hoare triple {56091#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56091#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:23,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {56098#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56091#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:23,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {56098#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56098#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:23,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {56105#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56098#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:23,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {56105#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56105#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:23,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {56112#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56105#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:23,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {56112#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56112#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:23,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {56119#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56112#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:23,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {56119#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56119#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:23,814 INFO L290 TraceCheckUtils]: 69: Hoare triple {56126#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56119#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:23,814 INFO L290 TraceCheckUtils]: 68: Hoare triple {56126#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56126#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:23,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {56133#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56126#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:23,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {56133#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56133#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:23,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {56140#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56133#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:23,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {56140#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56140#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:23,816 INFO L290 TraceCheckUtils]: 63: Hoare triple {56147#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56140#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:23,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {56147#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56147#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:23,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {56154#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56147#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:23,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {56154#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56154#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:23,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {56161#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56154#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:23,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {56161#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56161#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:23,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {56168#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56161#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:23,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {56168#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56168#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:23,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {56175#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56168#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:23,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {56175#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56175#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:23,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {56182#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56175#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:23,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {56182#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56182#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:23,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {56189#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56182#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:23,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {56189#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56189#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:23,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {56196#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56189#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:23,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {56196#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56196#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:23,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {56203#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56196#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:23,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {56203#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56203#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:23,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {56210#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56203#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:23,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {56210#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56210#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:23,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {56217#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56210#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:23,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {56217#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56217#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:23,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {56224#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56217#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:23,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {56224#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56224#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:23,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {56231#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56224#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:23,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {56231#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56231#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:23,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {56238#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56231#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:23,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {56238#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56238#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:23,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {56245#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56238#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:23,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {56245#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56245#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:23,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {56252#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56245#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:23,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {56252#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56252#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:23,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {56259#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56252#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:23,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {56259#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56259#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:23,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {56266#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56259#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:23,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {56266#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56266#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:23,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {56273#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56266#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:23,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {56273#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56273#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:23,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {56280#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56273#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:23,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {56280#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56280#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:23,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {56287#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56280#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:23,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {56287#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56287#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:23,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {56294#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56287#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:23,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {56294#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56294#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:23,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {56301#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56294#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:23,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {56301#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56301#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:23,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {56308#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56301#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:23,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {56308#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56308#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:23,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {56315#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56308#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:23,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {56315#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56315#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:23,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {56322#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56315#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:23,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {56322#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56322#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:23,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {56329#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56322#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:23,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {56329#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56329#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:23,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {56336#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56329#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:23,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {56336#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56336#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:23,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {56343#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56336#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:23,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {56343#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {56343#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:23,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {55489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {56343#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:23,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-28 03:03:23,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-28 03:03:23,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-28 03:03:23,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {55489#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(12, 2); {55489#true} is VALID [2022-04-28 03:03:23,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {55489#true} call ULTIMATE.init(); {55489#true} is VALID [2022-04-28 03:03:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:23,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615101374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:23,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:23,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-28 03:03:23,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:23,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269847581] [2022-04-28 03:03:23,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269847581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:23,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:23,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:03:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152894422] [2022-04-28 03:03:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:23,834 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-28 03:03:23,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:23,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:23,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:03:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:03:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 03:03:23,909 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:26,232 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-28 03:03:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:03:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-28 03:03:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 136 transitions. [2022-04-28 03:03:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 136 transitions. [2022-04-28 03:03:26,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 136 transitions. [2022-04-28 03:03:26,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:26,332 INFO L225 Difference]: With dead ends: 136 [2022-04-28 03:03:26,332 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 03:03:26,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 03:03:26,334 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:26,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 34 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:03:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 03:03:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-28 03:03:26,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:26,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,971 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,971 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:26,972 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-28 03:03:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2022-04-28 03:03:26,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:26,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:26,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 03:03:26,972 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 03:03:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:26,973 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-28 03:03:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2022-04-28 03:03:26,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:26,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:26,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:26,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0080645161290323) internal successors, (125), 124 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2022-04-28 03:03:26,975 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2022-04-28 03:03:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:26,975 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2022-04-28 03:03:26,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0) internal successors, (122), 60 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 129 transitions. [2022-04-28 03:03:27,133 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 03:03:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2022-04-28 03:03:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 03:03:27,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:27,133 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:27,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:27,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 03:03:27,334 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1164814190, now seen corresponding path program 115 times [2022-04-28 03:03:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:27,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624068991] [2022-04-28 03:03:27,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:27,336 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:27,336 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1164814190, now seen corresponding path program 116 times [2022-04-28 03:03:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:27,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676851304] [2022-04-28 03:03:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:28,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {57337#(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(12, 2); {57273#true} is VALID [2022-04-28 03:03:28,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-28 03:03:28,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-28 03:03:28,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {57273#true} call ULTIMATE.init(); {57337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:28,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {57337#(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(12, 2); {57273#true} is VALID [2022-04-28 03:03:28,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-28 03:03:28,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-28 03:03:28,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-28 03:03:28,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {57273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {57278#(= main_~i~0 0)} is VALID [2022-04-28 03:03:28,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {57278#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57278#(= main_~i~0 0)} is VALID [2022-04-28 03:03:28,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {57278#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57279#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:28,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {57279#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57279#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:28,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {57279#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57280#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:28,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {57280#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57280#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:28,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {57280#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57281#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:28,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {57281#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57281#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:28,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {57281#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57282#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:28,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {57282#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57282#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:28,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {57282#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57283#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:28,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {57283#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57283#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:28,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {57283#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57284#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:28,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {57284#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57284#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:28,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {57284#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57285#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:28,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {57285#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57285#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:28,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {57285#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57286#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:28,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {57286#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57286#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:28,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {57286#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57287#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:28,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {57287#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57287#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:28,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {57287#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57288#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:28,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {57288#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57288#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:28,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {57288#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57289#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:28,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57289#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:28,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57290#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:28,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {57290#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57290#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:28,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {57290#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57291#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:28,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {57291#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57291#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:28,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {57291#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57292#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:28,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {57292#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57292#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:28,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {57292#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57293#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:28,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {57293#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57293#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:28,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {57293#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57294#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:28,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {57294#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57294#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:28,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {57294#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57295#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:28,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {57295#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57295#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:28,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {57295#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57296#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:28,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {57296#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57296#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:28,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {57296#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57297#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:28,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {57297#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57297#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:28,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {57297#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57298#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:28,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {57298#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57298#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:28,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {57298#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57299#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:28,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {57299#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57299#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:28,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {57299#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57300#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:28,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {57300#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57300#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:28,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {57300#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57301#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:28,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {57301#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57301#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:28,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {57301#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57302#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:28,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {57302#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57302#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:28,529 INFO L290 TraceCheckUtils]: 55: Hoare triple {57302#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57303#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:28,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {57303#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57303#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:28,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {57303#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57304#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:28,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {57304#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57304#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:28,530 INFO L290 TraceCheckUtils]: 59: Hoare triple {57304#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57305#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:28,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {57305#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57305#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:28,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {57305#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57306#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:28,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {57306#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57306#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:28,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {57306#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57307#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:28,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {57307#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57307#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:28,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {57307#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57308#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:28,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {57308#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57308#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:28,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {57308#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57309#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:28,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {57309#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57309#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:28,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {57309#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57310#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:28,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {57310#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57310#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:28,534 INFO L290 TraceCheckUtils]: 71: Hoare triple {57310#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57311#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:28,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {57311#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57311#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:28,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {57311#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57312#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:28,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {57312#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57312#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:28,535 INFO L290 TraceCheckUtils]: 75: Hoare triple {57312#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57313#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:28,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {57313#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57313#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:28,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {57313#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57314#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:28,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {57314#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57314#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:28,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {57314#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57315#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:28,536 INFO L290 TraceCheckUtils]: 80: Hoare triple {57315#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57315#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:28,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {57315#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57316#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:28,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {57316#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57316#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:28,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {57316#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57317#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:28,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {57317#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57317#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:28,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {57317#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57318#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:28,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {57318#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57318#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:28,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {57318#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57319#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:28,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {57319#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57319#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:28,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {57319#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57320#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:28,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {57320#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57320#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:28,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {57320#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57321#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:28,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {57321#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57321#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:28,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {57321#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57322#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:28,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {57322#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57322#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:28,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {57322#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57323#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:28,541 INFO L290 TraceCheckUtils]: 96: Hoare triple {57323#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57323#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:28,541 INFO L290 TraceCheckUtils]: 97: Hoare triple {57323#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57324#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:28,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {57324#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57324#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:28,542 INFO L290 TraceCheckUtils]: 99: Hoare triple {57324#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57325#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:28,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {57325#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57325#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:28,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {57325#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57326#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:28,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {57326#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57326#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:28,543 INFO L290 TraceCheckUtils]: 103: Hoare triple {57326#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57327#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:28,543 INFO L290 TraceCheckUtils]: 104: Hoare triple {57327#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57327#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:28,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {57327#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57328#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:28,544 INFO L290 TraceCheckUtils]: 106: Hoare triple {57328#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57328#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:28,544 INFO L290 TraceCheckUtils]: 107: Hoare triple {57328#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57329#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:28,544 INFO L290 TraceCheckUtils]: 108: Hoare triple {57329#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57329#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:28,544 INFO L290 TraceCheckUtils]: 109: Hoare triple {57329#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57330#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:28,545 INFO L290 TraceCheckUtils]: 110: Hoare triple {57330#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57330#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:28,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {57330#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57331#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:28,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {57331#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57331#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:28,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {57331#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57332#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:28,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {57332#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57332#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:28,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {57332#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57333#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:28,546 INFO L290 TraceCheckUtils]: 116: Hoare triple {57333#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57333#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:28,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {57333#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57334#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:28,547 INFO L290 TraceCheckUtils]: 118: Hoare triple {57334#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57334#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:28,547 INFO L290 TraceCheckUtils]: 119: Hoare triple {57334#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57335#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:28,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {57335#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57335#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 121: Hoare triple {57335#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57336#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {57336#(<= main_~i~0 58)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {57274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {57274#false} is VALID [2022-04-28 03:03:28,548 INFO L272 TraceCheckUtils]: 124: Hoare triple {57274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {57274#false} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-28 03:03:28,548 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-28 03:03:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676851304] [2022-04-28 03:03:28,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676851304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520007807] [2022-04-28 03:03:28,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:28,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:28,550 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:28,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 03:03:28,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:28,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:28,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 03:03:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:28,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:29,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {57273#true} call ULTIMATE.init(); {57273#true} is VALID [2022-04-28 03:03:29,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {57273#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(12, 2); {57273#true} is VALID [2022-04-28 03:03:29,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-28 03:03:29,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-28 03:03:29,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-28 03:03:29,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {57273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {57356#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:29,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {57356#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57356#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:29,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {57356#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57279#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:29,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {57279#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57279#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:29,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {57279#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57280#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:29,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {57280#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57280#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:29,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {57280#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57281#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:29,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {57281#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57281#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:29,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {57281#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57282#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:29,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {57282#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57282#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:29,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {57282#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57283#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:29,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {57283#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57283#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:29,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {57283#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57284#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:29,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {57284#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57284#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:29,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {57284#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57285#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:29,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {57285#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57285#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:29,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {57285#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57286#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:29,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {57286#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57286#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:29,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {57286#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57287#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:29,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {57287#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57287#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:29,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {57287#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57288#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:29,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {57288#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57288#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:29,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {57288#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57289#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:29,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57289#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:29,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57290#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:29,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {57290#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57290#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:29,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {57290#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57291#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:29,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {57291#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57291#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:29,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {57291#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57292#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:29,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {57292#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57292#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:29,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {57292#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57293#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:29,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {57293#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57293#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:29,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {57293#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57294#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:29,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {57294#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57294#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:29,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {57294#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57295#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:29,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {57295#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57295#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:29,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {57295#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57296#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:29,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {57296#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57296#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:29,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {57296#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57297#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:29,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {57297#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57297#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:29,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {57297#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57298#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:29,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {57298#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57298#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:29,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {57298#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57299#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:29,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {57299#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57299#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:29,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {57299#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57300#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:29,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {57300#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57300#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:29,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {57300#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57301#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:29,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {57301#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57301#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:29,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {57301#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57302#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:29,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {57302#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57302#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:29,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {57302#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57303#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:29,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {57303#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57303#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:29,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {57303#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57304#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:29,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {57304#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57304#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:29,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {57304#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57305#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:29,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {57305#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57305#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:29,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {57305#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57306#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:29,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {57306#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57306#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:29,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {57306#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57307#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:29,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {57307#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57307#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:29,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {57307#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57308#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:29,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {57308#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57308#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:29,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {57308#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57309#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:29,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {57309#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57309#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:29,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {57309#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57310#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:29,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {57310#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57310#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:29,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {57310#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57311#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:29,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {57311#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57311#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:29,652 INFO L290 TraceCheckUtils]: 73: Hoare triple {57311#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57312#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:29,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {57312#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57312#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:29,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {57312#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57313#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:29,653 INFO L290 TraceCheckUtils]: 76: Hoare triple {57313#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57313#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:29,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {57313#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57314#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:29,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {57314#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57314#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:29,654 INFO L290 TraceCheckUtils]: 79: Hoare triple {57314#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57315#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:29,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {57315#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57315#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:29,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {57315#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57316#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:29,655 INFO L290 TraceCheckUtils]: 82: Hoare triple {57316#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57316#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:29,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {57316#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57317#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:29,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {57317#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57317#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:29,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {57317#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57318#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:29,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {57318#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57318#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:29,656 INFO L290 TraceCheckUtils]: 87: Hoare triple {57318#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57319#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:29,657 INFO L290 TraceCheckUtils]: 88: Hoare triple {57319#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57319#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:29,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {57319#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57320#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:29,657 INFO L290 TraceCheckUtils]: 90: Hoare triple {57320#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57320#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:29,657 INFO L290 TraceCheckUtils]: 91: Hoare triple {57320#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57321#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:29,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {57321#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57321#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:29,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {57321#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57322#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:29,658 INFO L290 TraceCheckUtils]: 94: Hoare triple {57322#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57322#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:29,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {57322#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57323#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:29,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {57323#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57323#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:29,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {57323#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57324#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:29,659 INFO L290 TraceCheckUtils]: 98: Hoare triple {57324#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57324#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:29,660 INFO L290 TraceCheckUtils]: 99: Hoare triple {57324#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57325#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:29,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {57325#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57325#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:29,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {57325#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57326#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:29,661 INFO L290 TraceCheckUtils]: 102: Hoare triple {57326#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57326#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:29,661 INFO L290 TraceCheckUtils]: 103: Hoare triple {57326#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57327#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:29,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {57327#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57327#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:29,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {57327#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57328#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:29,662 INFO L290 TraceCheckUtils]: 106: Hoare triple {57328#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57328#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:29,662 INFO L290 TraceCheckUtils]: 107: Hoare triple {57328#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57329#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:29,662 INFO L290 TraceCheckUtils]: 108: Hoare triple {57329#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57329#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:29,663 INFO L290 TraceCheckUtils]: 109: Hoare triple {57329#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57330#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:29,663 INFO L290 TraceCheckUtils]: 110: Hoare triple {57330#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57330#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:29,663 INFO L290 TraceCheckUtils]: 111: Hoare triple {57330#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57331#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:29,663 INFO L290 TraceCheckUtils]: 112: Hoare triple {57331#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57331#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:29,664 INFO L290 TraceCheckUtils]: 113: Hoare triple {57331#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57332#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:29,664 INFO L290 TraceCheckUtils]: 114: Hoare triple {57332#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57332#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:29,664 INFO L290 TraceCheckUtils]: 115: Hoare triple {57332#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57333#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:29,664 INFO L290 TraceCheckUtils]: 116: Hoare triple {57333#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57333#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:29,665 INFO L290 TraceCheckUtils]: 117: Hoare triple {57333#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57334#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:29,665 INFO L290 TraceCheckUtils]: 118: Hoare triple {57334#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57334#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:29,665 INFO L290 TraceCheckUtils]: 119: Hoare triple {57334#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57335#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 120: Hoare triple {57335#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57335#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 121: Hoare triple {57335#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57336#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 122: Hoare triple {57336#(<= main_~i~0 58)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 123: Hoare triple {57274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {57274#false} is VALID [2022-04-28 03:03:29,666 INFO L272 TraceCheckUtils]: 124: Hoare triple {57274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {57274#false} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-28 03:03:29,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-28 03:03:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:29,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:33,227 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L272 TraceCheckUtils]: 124: Hoare triple {57274#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L290 TraceCheckUtils]: 123: Hoare triple {57274#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L290 TraceCheckUtils]: 122: Hoare triple {57738#(< main_~i~0 2048)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-28 03:03:33,228 INFO L290 TraceCheckUtils]: 121: Hoare triple {57742#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57738#(< main_~i~0 2048)} is VALID [2022-04-28 03:03:33,229 INFO L290 TraceCheckUtils]: 120: Hoare triple {57742#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57742#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:33,229 INFO L290 TraceCheckUtils]: 119: Hoare triple {57749#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57742#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:33,229 INFO L290 TraceCheckUtils]: 118: Hoare triple {57749#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57749#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:33,230 INFO L290 TraceCheckUtils]: 117: Hoare triple {57756#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57749#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:33,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {57756#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57756#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:33,230 INFO L290 TraceCheckUtils]: 115: Hoare triple {57763#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57756#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:33,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {57763#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57763#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:33,231 INFO L290 TraceCheckUtils]: 113: Hoare triple {57770#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57763#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:33,231 INFO L290 TraceCheckUtils]: 112: Hoare triple {57770#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57770#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:33,231 INFO L290 TraceCheckUtils]: 111: Hoare triple {57777#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57770#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:33,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {57777#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57777#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:33,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {57784#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57777#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:33,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {57784#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57784#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:33,233 INFO L290 TraceCheckUtils]: 107: Hoare triple {57791#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57784#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:33,233 INFO L290 TraceCheckUtils]: 106: Hoare triple {57791#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57791#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:33,233 INFO L290 TraceCheckUtils]: 105: Hoare triple {57798#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57791#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:33,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {57798#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57798#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:33,234 INFO L290 TraceCheckUtils]: 103: Hoare triple {57805#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57798#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:33,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {57805#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57805#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:33,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {57812#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57805#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:33,234 INFO L290 TraceCheckUtils]: 100: Hoare triple {57812#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57812#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:33,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {57819#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57812#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:33,235 INFO L290 TraceCheckUtils]: 98: Hoare triple {57819#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57819#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:33,235 INFO L290 TraceCheckUtils]: 97: Hoare triple {57826#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57819#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:33,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {57826#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57826#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:33,236 INFO L290 TraceCheckUtils]: 95: Hoare triple {57833#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57826#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:33,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {57833#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57833#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:33,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {57840#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57833#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:33,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {57840#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57840#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:33,237 INFO L290 TraceCheckUtils]: 91: Hoare triple {57847#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57840#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:33,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {57847#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57847#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:33,238 INFO L290 TraceCheckUtils]: 89: Hoare triple {57854#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57847#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:33,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {57854#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57854#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:33,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {57861#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57854#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:33,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {57861#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57861#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:33,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {57868#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57861#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:33,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {57868#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57868#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:33,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {57875#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57868#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:33,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {57875#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57875#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:33,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {57882#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57875#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:33,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {57882#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57882#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:33,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {57889#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57882#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:33,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {57889#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57889#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:33,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {57896#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57889#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:33,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {57896#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57896#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:33,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {57903#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57896#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:33,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {57903#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57903#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:33,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {57910#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57903#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:33,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {57910#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57910#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:33,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {57917#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57910#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:33,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {57917#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57917#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:33,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {57924#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57917#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:33,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {57924#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57924#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:33,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {57931#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57924#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:33,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {57931#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57931#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:33,245 INFO L290 TraceCheckUtils]: 65: Hoare triple {57938#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57931#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:33,245 INFO L290 TraceCheckUtils]: 64: Hoare triple {57938#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57938#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:33,245 INFO L290 TraceCheckUtils]: 63: Hoare triple {57945#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57938#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:33,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {57945#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57945#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:33,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {57952#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57945#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:33,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {57952#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57952#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:33,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {57959#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57952#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:33,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {57959#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57959#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:33,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {57966#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57959#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:33,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {57966#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57966#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:33,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {57973#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57966#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:33,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {57973#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57973#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:33,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {57980#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57973#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:33,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {57980#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57980#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:33,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {57987#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57980#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:33,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {57987#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57987#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:33,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {57994#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57987#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:33,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {57994#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {57994#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:33,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {58001#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57994#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:33,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {58001#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58001#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:33,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {58008#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58001#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:33,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {58008#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58008#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:33,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {58015#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58008#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:33,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {58015#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58015#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:33,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {58022#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58015#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:33,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {58022#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58022#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:33,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {58029#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58022#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:33,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {58029#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58029#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:33,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {58036#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58029#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:33,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {58036#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58036#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:33,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {58043#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58036#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:33,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {58043#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58043#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:33,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {58050#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58043#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:33,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {58050#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58050#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:33,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {58057#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58050#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:33,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {58057#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58057#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:33,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {58064#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58057#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:33,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {58064#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58064#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:33,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {58071#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58064#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:33,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {58071#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58071#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:33,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {58078#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58071#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:33,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {58078#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58078#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:33,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {58085#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58078#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:33,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {58085#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58085#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:33,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {58092#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58085#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:33,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {58092#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58092#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:33,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {58099#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58092#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:33,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {58099#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58099#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:33,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {58106#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58099#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:33,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {58106#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58106#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:33,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {58113#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58106#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:33,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {58113#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58113#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:33,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {58120#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58113#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:33,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {58120#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58120#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:33,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {58127#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58120#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:33,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {58127#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58127#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:33,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {58134#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58127#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:33,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {58134#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58134#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:33,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {58141#(< main_~i~0 1990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58134#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:33,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {58141#(< main_~i~0 1990)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {58141#(< main_~i~0 1990)} is VALID [2022-04-28 03:03:33,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {57273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {58141#(< main_~i~0 1990)} is VALID [2022-04-28 03:03:33,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-28 03:03:33,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-28 03:03:33,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-28 03:03:33,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {57273#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(12, 2); {57273#true} is VALID [2022-04-28 03:03:33,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {57273#true} call ULTIMATE.init(); {57273#true} is VALID [2022-04-28 03:03:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520007807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:33,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-28 03:03:33,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:33,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624068991] [2022-04-28 03:03:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624068991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:33,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:03:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082513615] [2022-04-28 03:03:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-28 03:03:33,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:33,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:33,338 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 03:03:33,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:03:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:03:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:03:33,340 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:35,658 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-28 03:03:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 03:03:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-28 03:03:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 138 transitions. [2022-04-28 03:03:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 138 transitions. [2022-04-28 03:03:35,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 138 transitions. [2022-04-28 03:03:35,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:35,753 INFO L225 Difference]: With dead ends: 138 [2022-04-28 03:03:35,753 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 03:03:35,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:03:35,756 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:35,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 29 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:03:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 03:03:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-04-28 03:03:36,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:36,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:36,459 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:36,459 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:36,460 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-28 03:03:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2022-04-28 03:03:36,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:36,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:36,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states. [2022-04-28 03:03:36,460 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states. [2022-04-28 03:03:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:36,461 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-28 03:03:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2022-04-28 03:03:36,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:36,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:36,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:36,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2022-04-28 03:03:36,462 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2022-04-28 03:03:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:36,463 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2022-04-28 03:03:36,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 61 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:36,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 131 transitions. [2022-04-28 03:03:36,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2022-04-28 03:03:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 03:03:36,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:36,636 INFO L195 NwaCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:36,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:36,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 03:03:36,836 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1820852240, now seen corresponding path program 117 times [2022-04-28 03:03:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:36,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598358261] [2022-04-28 03:03:36,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:36,839 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:36,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1820852240, now seen corresponding path program 118 times [2022-04-28 03:03:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:36,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230583589] [2022-04-28 03:03:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:38,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {59150#(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(12, 2); {59085#true} is VALID [2022-04-28 03:03:38,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-28 03:03:38,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-28 03:03:38,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {59085#true} call ULTIMATE.init(); {59150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:38,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {59150#(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(12, 2); {59085#true} is VALID [2022-04-28 03:03:38,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-28 03:03:38,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-28 03:03:38,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-28 03:03:38,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {59085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {59090#(= main_~i~0 0)} is VALID [2022-04-28 03:03:38,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {59090#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59090#(= main_~i~0 0)} is VALID [2022-04-28 03:03:38,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {59090#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:38,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {59091#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59091#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:38,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {59091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:38,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {59092#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59092#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:38,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {59092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:38,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {59093#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59093#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:38,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {59093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:38,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {59094#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59094#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:38,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {59094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:38,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {59095#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59095#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:38,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {59095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:38,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {59096#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59096#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:38,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {59096#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:38,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {59097#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59097#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:38,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {59097#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59098#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:38,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {59098#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59098#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:38,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {59098#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59099#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:38,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {59099#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59099#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:38,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {59099#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59100#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:38,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {59100#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59100#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:38,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {59100#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59101#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:38,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {59101#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59101#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:38,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {59101#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59102#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:38,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {59102#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59102#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:38,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {59102#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59103#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:38,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {59103#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59103#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:38,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {59103#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59104#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:38,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {59104#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59104#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:38,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {59104#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59105#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:38,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {59105#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59105#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:38,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {59105#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59106#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:38,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {59106#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59106#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:38,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {59106#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59107#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:38,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {59107#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59107#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:38,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {59107#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59108#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:38,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {59108#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59108#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:38,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {59108#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59109#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:38,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {59109#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59109#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:38,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {59109#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59110#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:38,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {59110#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59110#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:38,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {59110#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59111#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:38,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {59111#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59111#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:38,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {59111#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59112#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:38,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {59112#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59112#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:38,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {59112#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59113#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:38,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {59113#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59113#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:38,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {59113#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59114#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:38,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {59114#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59114#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:38,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {59114#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59115#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:38,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {59115#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59115#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:38,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {59115#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59116#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:38,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {59116#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59116#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:38,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {59116#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59117#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:38,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {59117#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59117#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:38,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {59117#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59118#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:38,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {59118#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59118#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:38,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {59118#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59119#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:38,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {59119#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59119#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:38,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {59119#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59120#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:38,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {59120#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59120#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:38,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {59120#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59121#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:38,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {59121#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59121#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:38,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {59121#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59122#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:38,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {59122#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59122#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:38,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {59122#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59123#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:38,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {59123#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59123#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:38,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {59123#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59124#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:38,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {59124#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59124#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:38,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {59124#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59125#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:38,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {59125#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59125#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:38,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {59125#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59126#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:38,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {59126#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59126#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:38,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {59126#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59127#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:38,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {59127#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59127#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:38,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {59127#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59128#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:38,174 INFO L290 TraceCheckUtils]: 82: Hoare triple {59128#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59128#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:38,174 INFO L290 TraceCheckUtils]: 83: Hoare triple {59128#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59129#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:38,174 INFO L290 TraceCheckUtils]: 84: Hoare triple {59129#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59129#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:38,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {59129#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59130#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:38,175 INFO L290 TraceCheckUtils]: 86: Hoare triple {59130#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59130#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:38,175 INFO L290 TraceCheckUtils]: 87: Hoare triple {59130#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59131#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:38,175 INFO L290 TraceCheckUtils]: 88: Hoare triple {59131#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59131#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:38,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {59131#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59132#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:38,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {59132#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59132#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:38,176 INFO L290 TraceCheckUtils]: 91: Hoare triple {59132#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59133#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:38,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {59133#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59133#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:38,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {59133#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59134#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:38,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {59134#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59134#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:38,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {59134#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59135#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:38,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {59135#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59135#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:38,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {59135#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59136#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:38,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {59136#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59136#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:38,178 INFO L290 TraceCheckUtils]: 99: Hoare triple {59136#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59137#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:38,179 INFO L290 TraceCheckUtils]: 100: Hoare triple {59137#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59137#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:38,179 INFO L290 TraceCheckUtils]: 101: Hoare triple {59137#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59138#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:38,179 INFO L290 TraceCheckUtils]: 102: Hoare triple {59138#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59138#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:38,180 INFO L290 TraceCheckUtils]: 103: Hoare triple {59138#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59139#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:38,180 INFO L290 TraceCheckUtils]: 104: Hoare triple {59139#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59139#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:38,180 INFO L290 TraceCheckUtils]: 105: Hoare triple {59139#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59140#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:38,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {59140#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59140#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:38,181 INFO L290 TraceCheckUtils]: 107: Hoare triple {59140#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59141#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:38,181 INFO L290 TraceCheckUtils]: 108: Hoare triple {59141#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59141#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:38,181 INFO L290 TraceCheckUtils]: 109: Hoare triple {59141#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59142#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:38,181 INFO L290 TraceCheckUtils]: 110: Hoare triple {59142#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59142#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:38,182 INFO L290 TraceCheckUtils]: 111: Hoare triple {59142#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59143#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:38,182 INFO L290 TraceCheckUtils]: 112: Hoare triple {59143#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59143#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:38,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {59143#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59144#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:38,183 INFO L290 TraceCheckUtils]: 114: Hoare triple {59144#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59144#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:38,183 INFO L290 TraceCheckUtils]: 115: Hoare triple {59144#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59145#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:38,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {59145#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59145#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:38,183 INFO L290 TraceCheckUtils]: 117: Hoare triple {59145#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59146#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:38,184 INFO L290 TraceCheckUtils]: 118: Hoare triple {59146#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59146#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:38,184 INFO L290 TraceCheckUtils]: 119: Hoare triple {59146#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59147#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:38,184 INFO L290 TraceCheckUtils]: 120: Hoare triple {59147#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59147#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:38,184 INFO L290 TraceCheckUtils]: 121: Hoare triple {59147#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59148#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:38,185 INFO L290 TraceCheckUtils]: 122: Hoare triple {59148#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59148#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:38,185 INFO L290 TraceCheckUtils]: 123: Hoare triple {59148#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59149#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:38,185 INFO L290 TraceCheckUtils]: 124: Hoare triple {59149#(<= main_~i~0 59)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-28 03:03:38,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {59086#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {59086#false} is VALID [2022-04-28 03:03:38,185 INFO L272 TraceCheckUtils]: 126: Hoare triple {59086#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {59086#false} is VALID [2022-04-28 03:03:38,186 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-28 03:03:38,186 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-28 03:03:38,186 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-28 03:03:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:38,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230583589] [2022-04-28 03:03:38,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230583589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:38,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926218011] [2022-04-28 03:03:38,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:38,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:38,187 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:38,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 03:03:38,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:38,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:38,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 03:03:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:38,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:39,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {59085#true} call ULTIMATE.init(); {59085#true} is VALID [2022-04-28 03:03:39,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {59085#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(12, 2); {59085#true} is VALID [2022-04-28 03:03:39,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-28 03:03:39,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-28 03:03:39,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-28 03:03:39,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {59085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {59169#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:39,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {59169#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59169#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:39,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {59169#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:39,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {59091#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59091#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:39,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {59091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:39,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {59092#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59092#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:39,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {59092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:39,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {59093#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59093#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:39,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {59093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:39,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {59094#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59094#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:39,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {59094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:39,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {59095#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59095#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:39,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {59095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:39,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {59096#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59096#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:39,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {59096#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:39,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {59097#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59097#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:39,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {59097#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59098#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:39,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {59098#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59098#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:39,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {59098#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59099#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:39,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {59099#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59099#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:39,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {59099#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59100#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:39,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {59100#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59100#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:39,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {59100#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59101#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:39,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {59101#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59101#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:39,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {59101#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59102#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:39,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {59102#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59102#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:39,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {59102#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59103#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:39,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {59103#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59103#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:39,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {59103#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59104#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:39,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {59104#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59104#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:39,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {59104#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59105#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:39,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {59105#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59105#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:39,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {59105#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59106#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:39,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {59106#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59106#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:39,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {59106#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59107#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:39,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {59107#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59107#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:39,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {59107#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59108#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:39,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {59108#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59108#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:39,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {59108#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59109#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:39,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {59109#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59109#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:39,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {59109#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59110#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:39,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {59110#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59110#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:39,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {59110#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59111#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:39,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {59111#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59111#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:39,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {59111#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59112#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:39,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {59112#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59112#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:39,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {59112#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59113#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:39,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {59113#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59113#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:39,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {59113#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59114#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:39,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {59114#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59114#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:39,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {59114#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59115#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:39,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {59115#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59115#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:39,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {59115#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59116#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:39,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {59116#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59116#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:39,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {59116#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59117#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:39,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {59117#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59117#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:39,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {59117#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59118#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:39,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {59118#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59118#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:39,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {59118#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59119#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:39,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {59119#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59119#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:39,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {59119#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59120#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:39,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {59120#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59120#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:39,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {59120#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59121#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:39,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {59121#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59121#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:39,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {59121#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59122#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:39,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {59122#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59122#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:39,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {59122#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59123#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:39,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {59123#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59123#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:39,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {59123#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59124#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:39,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {59124#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59124#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:39,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {59124#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59125#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:39,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {59125#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59125#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:39,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {59125#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59126#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:39,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {59126#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59126#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:39,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {59126#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59127#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:39,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {59127#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59127#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:39,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {59127#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59128#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:39,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {59128#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59128#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:39,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {59128#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59129#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:39,307 INFO L290 TraceCheckUtils]: 84: Hoare triple {59129#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59129#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:39,307 INFO L290 TraceCheckUtils]: 85: Hoare triple {59129#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59130#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:39,308 INFO L290 TraceCheckUtils]: 86: Hoare triple {59130#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59130#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:39,308 INFO L290 TraceCheckUtils]: 87: Hoare triple {59130#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59131#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:39,308 INFO L290 TraceCheckUtils]: 88: Hoare triple {59131#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59131#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:39,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {59131#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59132#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:39,309 INFO L290 TraceCheckUtils]: 90: Hoare triple {59132#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59132#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:39,309 INFO L290 TraceCheckUtils]: 91: Hoare triple {59132#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59133#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:39,309 INFO L290 TraceCheckUtils]: 92: Hoare triple {59133#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59133#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:39,310 INFO L290 TraceCheckUtils]: 93: Hoare triple {59133#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59134#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:39,310 INFO L290 TraceCheckUtils]: 94: Hoare triple {59134#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59134#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:39,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {59134#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59135#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:39,310 INFO L290 TraceCheckUtils]: 96: Hoare triple {59135#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59135#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:39,311 INFO L290 TraceCheckUtils]: 97: Hoare triple {59135#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59136#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:39,311 INFO L290 TraceCheckUtils]: 98: Hoare triple {59136#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59136#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:39,311 INFO L290 TraceCheckUtils]: 99: Hoare triple {59136#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59137#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:39,311 INFO L290 TraceCheckUtils]: 100: Hoare triple {59137#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59137#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:39,312 INFO L290 TraceCheckUtils]: 101: Hoare triple {59137#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59138#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:39,312 INFO L290 TraceCheckUtils]: 102: Hoare triple {59138#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59138#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:39,312 INFO L290 TraceCheckUtils]: 103: Hoare triple {59138#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59139#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:39,313 INFO L290 TraceCheckUtils]: 104: Hoare triple {59139#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59139#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:39,313 INFO L290 TraceCheckUtils]: 105: Hoare triple {59139#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59140#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:39,313 INFO L290 TraceCheckUtils]: 106: Hoare triple {59140#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59140#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:39,313 INFO L290 TraceCheckUtils]: 107: Hoare triple {59140#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59141#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:39,314 INFO L290 TraceCheckUtils]: 108: Hoare triple {59141#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59141#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:39,314 INFO L290 TraceCheckUtils]: 109: Hoare triple {59141#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59142#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:39,314 INFO L290 TraceCheckUtils]: 110: Hoare triple {59142#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59142#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:39,315 INFO L290 TraceCheckUtils]: 111: Hoare triple {59142#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59143#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:39,315 INFO L290 TraceCheckUtils]: 112: Hoare triple {59143#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59143#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:39,315 INFO L290 TraceCheckUtils]: 113: Hoare triple {59143#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59144#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:39,315 INFO L290 TraceCheckUtils]: 114: Hoare triple {59144#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59144#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:39,316 INFO L290 TraceCheckUtils]: 115: Hoare triple {59144#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59145#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:39,316 INFO L290 TraceCheckUtils]: 116: Hoare triple {59145#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59145#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:39,316 INFO L290 TraceCheckUtils]: 117: Hoare triple {59145#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59146#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:39,317 INFO L290 TraceCheckUtils]: 118: Hoare triple {59146#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59146#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:39,317 INFO L290 TraceCheckUtils]: 119: Hoare triple {59146#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59147#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:39,317 INFO L290 TraceCheckUtils]: 120: Hoare triple {59147#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59147#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:39,317 INFO L290 TraceCheckUtils]: 121: Hoare triple {59147#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59148#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:39,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {59148#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59148#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:39,318 INFO L290 TraceCheckUtils]: 123: Hoare triple {59148#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59149#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:39,318 INFO L290 TraceCheckUtils]: 124: Hoare triple {59149#(<= main_~i~0 59)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-28 03:03:39,318 INFO L290 TraceCheckUtils]: 125: Hoare triple {59086#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {59086#false} is VALID [2022-04-28 03:03:39,318 INFO L272 TraceCheckUtils]: 126: Hoare triple {59086#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {59086#false} is VALID [2022-04-28 03:03:39,319 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-28 03:03:39,319 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-28 03:03:39,319 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-28 03:03:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:39,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:43,029 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L272 TraceCheckUtils]: 126: Hoare triple {59086#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L290 TraceCheckUtils]: 125: Hoare triple {59086#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L290 TraceCheckUtils]: 124: Hoare triple {59557#(< main_~i~0 2048)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-28 03:03:43,030 INFO L290 TraceCheckUtils]: 123: Hoare triple {59561#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59557#(< main_~i~0 2048)} is VALID [2022-04-28 03:03:43,031 INFO L290 TraceCheckUtils]: 122: Hoare triple {59561#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59561#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:43,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {59568#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59561#(< main_~i~0 2047)} is VALID [2022-04-28 03:03:43,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {59568#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59568#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:43,032 INFO L290 TraceCheckUtils]: 119: Hoare triple {59575#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59568#(< main_~i~0 2046)} is VALID [2022-04-28 03:03:43,032 INFO L290 TraceCheckUtils]: 118: Hoare triple {59575#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59575#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:43,032 INFO L290 TraceCheckUtils]: 117: Hoare triple {59582#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59575#(< main_~i~0 2045)} is VALID [2022-04-28 03:03:43,033 INFO L290 TraceCheckUtils]: 116: Hoare triple {59582#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59582#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:43,033 INFO L290 TraceCheckUtils]: 115: Hoare triple {59589#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59582#(< main_~i~0 2044)} is VALID [2022-04-28 03:03:43,033 INFO L290 TraceCheckUtils]: 114: Hoare triple {59589#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59589#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:43,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {59596#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59589#(< main_~i~0 2043)} is VALID [2022-04-28 03:03:43,034 INFO L290 TraceCheckUtils]: 112: Hoare triple {59596#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59596#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:43,034 INFO L290 TraceCheckUtils]: 111: Hoare triple {59603#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59596#(< main_~i~0 2042)} is VALID [2022-04-28 03:03:43,034 INFO L290 TraceCheckUtils]: 110: Hoare triple {59603#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59603#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:43,035 INFO L290 TraceCheckUtils]: 109: Hoare triple {59610#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59603#(< main_~i~0 2041)} is VALID [2022-04-28 03:03:43,035 INFO L290 TraceCheckUtils]: 108: Hoare triple {59610#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59610#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:43,035 INFO L290 TraceCheckUtils]: 107: Hoare triple {59617#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59610#(< main_~i~0 2040)} is VALID [2022-04-28 03:03:43,035 INFO L290 TraceCheckUtils]: 106: Hoare triple {59617#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59617#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:43,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {59624#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59617#(< main_~i~0 2039)} is VALID [2022-04-28 03:03:43,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {59624#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59624#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:43,036 INFO L290 TraceCheckUtils]: 103: Hoare triple {59631#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59624#(< main_~i~0 2038)} is VALID [2022-04-28 03:03:43,037 INFO L290 TraceCheckUtils]: 102: Hoare triple {59631#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59631#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:43,037 INFO L290 TraceCheckUtils]: 101: Hoare triple {59638#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59631#(< main_~i~0 2037)} is VALID [2022-04-28 03:03:43,037 INFO L290 TraceCheckUtils]: 100: Hoare triple {59638#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59638#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:43,038 INFO L290 TraceCheckUtils]: 99: Hoare triple {59645#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59638#(< main_~i~0 2036)} is VALID [2022-04-28 03:03:43,038 INFO L290 TraceCheckUtils]: 98: Hoare triple {59645#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59645#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:43,038 INFO L290 TraceCheckUtils]: 97: Hoare triple {59652#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59645#(< main_~i~0 2035)} is VALID [2022-04-28 03:03:43,039 INFO L290 TraceCheckUtils]: 96: Hoare triple {59652#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59652#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:43,039 INFO L290 TraceCheckUtils]: 95: Hoare triple {59659#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59652#(< main_~i~0 2034)} is VALID [2022-04-28 03:03:43,039 INFO L290 TraceCheckUtils]: 94: Hoare triple {59659#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59659#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:43,040 INFO L290 TraceCheckUtils]: 93: Hoare triple {59666#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59659#(< main_~i~0 2033)} is VALID [2022-04-28 03:03:43,040 INFO L290 TraceCheckUtils]: 92: Hoare triple {59666#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59666#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:43,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {59673#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59666#(< main_~i~0 2032)} is VALID [2022-04-28 03:03:43,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {59673#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59673#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:43,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {59680#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59673#(< main_~i~0 2031)} is VALID [2022-04-28 03:03:43,044 INFO L290 TraceCheckUtils]: 88: Hoare triple {59680#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59680#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:43,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {59687#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59680#(< main_~i~0 2030)} is VALID [2022-04-28 03:03:43,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {59687#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59687#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:43,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {59694#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59687#(< main_~i~0 2029)} is VALID [2022-04-28 03:03:43,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {59694#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59694#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:43,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {59701#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59694#(< main_~i~0 2028)} is VALID [2022-04-28 03:03:43,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {59701#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59701#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:43,047 INFO L290 TraceCheckUtils]: 81: Hoare triple {59708#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59701#(< main_~i~0 2027)} is VALID [2022-04-28 03:03:43,047 INFO L290 TraceCheckUtils]: 80: Hoare triple {59708#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59708#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:43,047 INFO L290 TraceCheckUtils]: 79: Hoare triple {59715#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59708#(< main_~i~0 2026)} is VALID [2022-04-28 03:03:43,048 INFO L290 TraceCheckUtils]: 78: Hoare triple {59715#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59715#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:43,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {59722#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59715#(< main_~i~0 2025)} is VALID [2022-04-28 03:03:43,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {59722#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59722#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:43,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {59729#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59722#(< main_~i~0 2024)} is VALID [2022-04-28 03:03:43,049 INFO L290 TraceCheckUtils]: 74: Hoare triple {59729#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59729#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:43,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {59736#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59729#(< main_~i~0 2023)} is VALID [2022-04-28 03:03:43,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {59736#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59736#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:43,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {59743#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59736#(< main_~i~0 2022)} is VALID [2022-04-28 03:03:43,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {59743#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59743#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:43,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {59750#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59743#(< main_~i~0 2021)} is VALID [2022-04-28 03:03:43,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {59750#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59750#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:43,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {59757#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59750#(< main_~i~0 2020)} is VALID [2022-04-28 03:03:43,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {59757#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59757#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:43,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {59764#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59757#(< main_~i~0 2019)} is VALID [2022-04-28 03:03:43,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {59764#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59764#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:43,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {59771#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59764#(< main_~i~0 2018)} is VALID [2022-04-28 03:03:43,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {59771#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59771#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:43,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {59778#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59771#(< main_~i~0 2017)} is VALID [2022-04-28 03:03:43,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {59778#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59778#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:43,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {59785#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59778#(< main_~i~0 2016)} is VALID [2022-04-28 03:03:43,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {59785#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59785#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:43,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {59792#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59785#(< main_~i~0 2015)} is VALID [2022-04-28 03:03:43,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {59792#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59792#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:43,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {59799#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59792#(< main_~i~0 2014)} is VALID [2022-04-28 03:03:43,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {59799#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59799#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:43,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {59806#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59799#(< main_~i~0 2013)} is VALID [2022-04-28 03:03:43,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {59806#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59806#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:43,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {59813#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59806#(< main_~i~0 2012)} is VALID [2022-04-28 03:03:43,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {59813#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59813#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:43,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {59820#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59813#(< main_~i~0 2011)} is VALID [2022-04-28 03:03:43,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {59820#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59820#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:43,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {59827#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59820#(< main_~i~0 2010)} is VALID [2022-04-28 03:03:43,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {59827#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59827#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:43,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {59834#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59827#(< main_~i~0 2009)} is VALID [2022-04-28 03:03:43,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {59834#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59834#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:43,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {59841#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59834#(< main_~i~0 2008)} is VALID [2022-04-28 03:03:43,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {59841#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59841#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:43,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {59848#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59841#(< main_~i~0 2007)} is VALID [2022-04-28 03:03:43,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {59848#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59848#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:43,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {59855#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59848#(< main_~i~0 2006)} is VALID [2022-04-28 03:03:43,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {59855#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59855#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:43,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {59862#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59855#(< main_~i~0 2005)} is VALID [2022-04-28 03:03:43,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {59862#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59862#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:43,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {59869#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59862#(< main_~i~0 2004)} is VALID [2022-04-28 03:03:43,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {59869#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59869#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:43,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {59876#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59869#(< main_~i~0 2003)} is VALID [2022-04-28 03:03:43,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {59876#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59876#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:43,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {59883#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59876#(< main_~i~0 2002)} is VALID [2022-04-28 03:03:43,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {59883#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59883#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:43,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {59890#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59883#(< main_~i~0 2001)} is VALID [2022-04-28 03:03:43,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {59890#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59890#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:43,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {59897#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59890#(< main_~i~0 2000)} is VALID [2022-04-28 03:03:43,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {59897#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59897#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:43,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {59904#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59897#(< main_~i~0 1999)} is VALID [2022-04-28 03:03:43,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {59904#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59904#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:43,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {59911#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59904#(< main_~i~0 1998)} is VALID [2022-04-28 03:03:43,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {59911#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59911#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:43,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {59918#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59911#(< main_~i~0 1997)} is VALID [2022-04-28 03:03:43,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {59918#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59918#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:43,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {59925#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59918#(< main_~i~0 1996)} is VALID [2022-04-28 03:03:43,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {59925#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59925#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:43,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {59932#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59925#(< main_~i~0 1995)} is VALID [2022-04-28 03:03:43,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {59932#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59932#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:43,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {59939#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59932#(< main_~i~0 1994)} is VALID [2022-04-28 03:03:43,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {59939#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59939#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:43,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {59946#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59939#(< main_~i~0 1993)} is VALID [2022-04-28 03:03:43,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {59946#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59946#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:43,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {59953#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59946#(< main_~i~0 1992)} is VALID [2022-04-28 03:03:43,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {59953#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59953#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:43,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {59960#(< main_~i~0 1990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59953#(< main_~i~0 1991)} is VALID [2022-04-28 03:03:43,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {59960#(< main_~i~0 1990)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59960#(< main_~i~0 1990)} is VALID [2022-04-28 03:03:43,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {59967#(< main_~i~0 1989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59960#(< main_~i~0 1990)} is VALID [2022-04-28 03:03:43,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {59967#(< main_~i~0 1989)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {59967#(< main_~i~0 1989)} is VALID [2022-04-28 03:03:43,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {59085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {59967#(< main_~i~0 1989)} is VALID [2022-04-28 03:03:43,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-28 03:03:43,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-28 03:03:43,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-28 03:03:43,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {59085#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(12, 2); {59085#true} is VALID [2022-04-28 03:03:43,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {59085#true} call ULTIMATE.init(); {59085#true} is VALID [2022-04-28 03:03:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926218011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:43,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-28 03:03:43,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:43,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598358261] [2022-04-28 03:03:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598358261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:43,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:03:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905535665] [2022-04-28 03:03:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-28 03:03:43,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:43,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:43,154 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 03:03:43,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:03:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:03:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7505, Invalid=7747, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:03:43,156 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:45,617 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-28 03:03:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:03:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-28 03:03:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 140 transitions. [2022-04-28 03:03:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 140 transitions. [2022-04-28 03:03:45,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 140 transitions. [2022-04-28 03:03:45,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:45,713 INFO L225 Difference]: With dead ends: 140 [2022-04-28 03:03:45,714 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 03:03:45,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=14886, Invalid=18786, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:03:45,716 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:45,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 39 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:03:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 03:03:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-28 03:03:46,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:46,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,409 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,409 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:46,410 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-28 03:03:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2022-04-28 03:03:46,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:46,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:46,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 03:03:46,411 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 03:03:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:46,412 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-28 03:03:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2022-04-28 03:03:46,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:46,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:46,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:46,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2022-04-28 03:03:46,413 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2022-04-28 03:03:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:46,413 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2022-04-28 03:03:46,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0) internal successors, (126), 62 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 133 transitions. [2022-04-28 03:03:46,576 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 03:03:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2022-04-28 03:03:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 03:03:46,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:46,577 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:46,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-28 03:03:46,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:46,777 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 913225778, now seen corresponding path program 119 times [2022-04-28 03:03:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [718554332] [2022-04-28 03:03:46,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:46,779 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:46,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 913225778, now seen corresponding path program 120 times [2022-04-28 03:03:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:46,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687537946] [2022-04-28 03:03:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:48,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:48,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {60991#(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(12, 2); {60925#true} is VALID [2022-04-28 03:03:48,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-28 03:03:48,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-28 03:03:48,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {60925#true} call ULTIMATE.init(); {60991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:48,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {60991#(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(12, 2); {60925#true} is VALID [2022-04-28 03:03:48,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-28 03:03:48,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-28 03:03:48,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-28 03:03:48,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {60925#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {60930#(= main_~i~0 0)} is VALID [2022-04-28 03:03:48,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {60930#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60930#(= main_~i~0 0)} is VALID [2022-04-28 03:03:48,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {60930#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60931#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:48,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {60931#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60931#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:48,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {60931#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60932#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:48,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {60932#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60932#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:48,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {60932#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60933#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:48,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {60933#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60933#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:48,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {60933#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60934#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:48,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {60934#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60934#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:48,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {60934#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60935#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:48,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {60935#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60935#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:48,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {60935#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60936#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:48,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {60936#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60936#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:48,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {60936#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60937#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:48,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {60937#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60937#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:48,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {60937#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60938#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:48,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {60938#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60938#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:48,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {60938#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60939#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:48,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {60939#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60939#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:48,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {60939#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60940#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:48,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {60940#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60940#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:48,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {60940#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60941#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:48,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {60941#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60941#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:48,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {60941#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60942#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:48,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {60942#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60942#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:48,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {60942#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60943#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:48,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {60943#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60943#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:48,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {60943#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60944#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:48,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {60944#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60944#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:48,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {60944#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60945#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:48,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {60945#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60945#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:48,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {60945#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60946#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:48,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {60946#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60946#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:48,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {60946#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60947#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:48,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {60947#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60947#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:48,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {60947#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60948#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:48,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {60948#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60948#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:48,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {60948#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60949#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:48,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {60949#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60949#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:48,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {60949#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60950#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:48,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {60950#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60950#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:48,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {60950#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60951#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:48,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {60951#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60951#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:48,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {60951#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60952#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:48,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {60952#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60952#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:48,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {60952#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60953#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:48,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {60953#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60953#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:48,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {60953#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60954#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:48,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {60954#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60954#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:48,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {60954#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60955#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:48,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {60955#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60955#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:48,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {60955#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60956#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:48,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {60956#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60956#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:48,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {60956#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60957#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:48,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {60957#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60957#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:48,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {60957#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60958#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:48,034 INFO L290 TraceCheckUtils]: 62: Hoare triple {60958#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60958#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:48,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {60958#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60959#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:48,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {60959#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60959#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:48,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {60959#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60960#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:48,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {60960#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60960#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:48,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {60960#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60961#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:48,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {60961#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60961#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:48,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {60961#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60962#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:48,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {60962#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60962#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:48,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {60962#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60963#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:48,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {60963#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60963#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:48,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {60963#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60964#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:48,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {60964#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60964#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:48,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {60964#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60965#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:48,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {60965#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60965#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:48,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {60965#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60966#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:48,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {60966#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60966#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:48,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {60966#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60967#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:48,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {60967#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60967#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:48,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {60967#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60968#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:48,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {60968#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60968#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:48,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {60968#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60969#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:48,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {60969#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60969#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:48,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {60969#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60970#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:48,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {60970#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60970#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:48,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {60970#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60971#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:48,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {60971#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60971#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:48,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {60971#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60972#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:48,042 INFO L290 TraceCheckUtils]: 90: Hoare triple {60972#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60972#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:48,042 INFO L290 TraceCheckUtils]: 91: Hoare triple {60972#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60973#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:48,043 INFO L290 TraceCheckUtils]: 92: Hoare triple {60973#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60973#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:48,043 INFO L290 TraceCheckUtils]: 93: Hoare triple {60973#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60974#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:48,043 INFO L290 TraceCheckUtils]: 94: Hoare triple {60974#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60974#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:48,043 INFO L290 TraceCheckUtils]: 95: Hoare triple {60974#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60975#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:48,044 INFO L290 TraceCheckUtils]: 96: Hoare triple {60975#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60975#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:48,044 INFO L290 TraceCheckUtils]: 97: Hoare triple {60975#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60976#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:48,044 INFO L290 TraceCheckUtils]: 98: Hoare triple {60976#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60976#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:48,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {60976#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60977#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:48,045 INFO L290 TraceCheckUtils]: 100: Hoare triple {60977#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60977#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:48,045 INFO L290 TraceCheckUtils]: 101: Hoare triple {60977#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60978#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:48,045 INFO L290 TraceCheckUtils]: 102: Hoare triple {60978#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60978#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:48,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {60978#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60979#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:48,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {60979#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60979#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:48,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {60979#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60980#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:48,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {60980#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60980#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:48,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {60980#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60981#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:48,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {60981#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60981#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:48,047 INFO L290 TraceCheckUtils]: 109: Hoare triple {60981#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60982#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:48,048 INFO L290 TraceCheckUtils]: 110: Hoare triple {60982#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60982#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:48,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {60982#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60983#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:48,048 INFO L290 TraceCheckUtils]: 112: Hoare triple {60983#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60983#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:48,049 INFO L290 TraceCheckUtils]: 113: Hoare triple {60983#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60984#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:48,049 INFO L290 TraceCheckUtils]: 114: Hoare triple {60984#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60984#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:48,049 INFO L290 TraceCheckUtils]: 115: Hoare triple {60984#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60985#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:48,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {60985#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60985#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:48,050 INFO L290 TraceCheckUtils]: 117: Hoare triple {60985#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60986#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:48,050 INFO L290 TraceCheckUtils]: 118: Hoare triple {60986#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60986#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:48,050 INFO L290 TraceCheckUtils]: 119: Hoare triple {60986#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60987#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:48,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {60987#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60987#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:48,051 INFO L290 TraceCheckUtils]: 121: Hoare triple {60987#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60988#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:48,051 INFO L290 TraceCheckUtils]: 122: Hoare triple {60988#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60988#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:48,052 INFO L290 TraceCheckUtils]: 123: Hoare triple {60988#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60989#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:48,052 INFO L290 TraceCheckUtils]: 124: Hoare triple {60989#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60989#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:48,053 INFO L290 TraceCheckUtils]: 125: Hoare triple {60989#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60990#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:48,053 INFO L290 TraceCheckUtils]: 126: Hoare triple {60990#(<= main_~i~0 60)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 127: Hoare triple {60926#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L272 TraceCheckUtils]: 128: Hoare triple {60926#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-28 03:03:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:48,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687537946] [2022-04-28 03:03:48,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687537946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716992274] [2022-04-28 03:03:48,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:48,056 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:48,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 03:05:39,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2022-04-28 03:05:39,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:40,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-28 03:05:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:40,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:40,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {60925#true} call ULTIMATE.init(); {60925#true} is VALID [2022-04-28 03:05:40,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {60925#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(12, 2); {60925#true} is VALID [2022-04-28 03:05:40,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-28 03:05:40,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-28 03:05:40,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-28 03:05:40,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {60925#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {61010#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:40,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {61010#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61010#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:40,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {61010#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60931#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:40,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {60931#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60931#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:40,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {60931#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60932#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:40,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {60932#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60932#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:40,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {60932#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60933#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:40,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {60933#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60933#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:40,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {60933#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60934#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:40,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {60934#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60934#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:40,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {60934#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60935#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:40,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {60935#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60935#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:40,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {60935#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60936#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:40,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {60936#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60936#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:40,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {60936#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60937#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:40,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {60937#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60937#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:40,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {60937#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60938#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:40,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {60938#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60938#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:40,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {60938#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60939#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:40,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {60939#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60939#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:40,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {60939#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60940#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:40,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {60940#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60940#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:40,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {60940#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60941#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:40,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {60941#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60941#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:40,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {60941#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60942#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:40,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {60942#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60942#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:40,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {60942#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60943#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:40,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {60943#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60943#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:40,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {60943#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60944#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:40,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {60944#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60944#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:40,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {60944#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60945#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:40,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {60945#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60945#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:40,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {60945#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60946#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:40,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {60946#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60946#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:40,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {60946#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60947#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:40,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {60947#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60947#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:40,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {60947#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60948#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:40,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {60948#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60948#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:40,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {60948#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60949#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:40,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {60949#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60949#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:40,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {60949#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60950#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:40,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {60950#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60950#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:40,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {60950#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60951#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:40,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {60951#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60951#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:40,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {60951#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60952#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:40,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {60952#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60952#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:40,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {60952#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60953#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:40,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {60953#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60953#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:40,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {60953#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60954#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:40,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {60954#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60954#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:40,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {60954#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60955#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:40,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {60955#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60955#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:40,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {60955#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60956#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:40,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {60956#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60956#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:40,739 INFO L290 TraceCheckUtils]: 59: Hoare triple {60956#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60957#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:40,740 INFO L290 TraceCheckUtils]: 60: Hoare triple {60957#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60957#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:40,740 INFO L290 TraceCheckUtils]: 61: Hoare triple {60957#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60958#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:40,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {60958#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60958#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:40,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {60958#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60959#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:40,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {60959#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60959#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:40,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {60959#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60960#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:40,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {60960#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60960#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:40,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {60960#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60961#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:40,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {60961#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60961#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:40,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {60961#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60962#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:40,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {60962#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60962#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:40,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {60962#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60963#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:40,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {60963#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60963#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:40,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {60963#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60964#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:40,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {60964#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60964#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:40,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {60964#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60965#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:40,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {60965#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60965#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:40,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {60965#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60966#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:40,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {60966#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60966#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:40,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {60966#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60967#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:40,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {60967#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60967#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:40,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {60967#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60968#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:40,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {60968#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60968#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:40,746 INFO L290 TraceCheckUtils]: 83: Hoare triple {60968#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60969#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:40,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {60969#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60969#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:40,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {60969#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60970#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:40,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {60970#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60970#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:40,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {60970#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60971#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:40,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {60971#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60971#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:40,748 INFO L290 TraceCheckUtils]: 89: Hoare triple {60971#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60972#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:40,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {60972#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60972#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:40,748 INFO L290 TraceCheckUtils]: 91: Hoare triple {60972#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60973#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:40,749 INFO L290 TraceCheckUtils]: 92: Hoare triple {60973#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60973#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:40,749 INFO L290 TraceCheckUtils]: 93: Hoare triple {60973#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60974#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:40,749 INFO L290 TraceCheckUtils]: 94: Hoare triple {60974#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60974#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:40,749 INFO L290 TraceCheckUtils]: 95: Hoare triple {60974#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60975#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:40,750 INFO L290 TraceCheckUtils]: 96: Hoare triple {60975#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60975#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:40,750 INFO L290 TraceCheckUtils]: 97: Hoare triple {60975#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60976#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:40,750 INFO L290 TraceCheckUtils]: 98: Hoare triple {60976#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60976#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:40,750 INFO L290 TraceCheckUtils]: 99: Hoare triple {60976#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60977#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:40,751 INFO L290 TraceCheckUtils]: 100: Hoare triple {60977#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60977#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:40,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {60977#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60978#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:40,751 INFO L290 TraceCheckUtils]: 102: Hoare triple {60978#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60978#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:40,752 INFO L290 TraceCheckUtils]: 103: Hoare triple {60978#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60979#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:40,752 INFO L290 TraceCheckUtils]: 104: Hoare triple {60979#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60979#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:40,752 INFO L290 TraceCheckUtils]: 105: Hoare triple {60979#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60980#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:40,752 INFO L290 TraceCheckUtils]: 106: Hoare triple {60980#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60980#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:40,753 INFO L290 TraceCheckUtils]: 107: Hoare triple {60980#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60981#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:40,753 INFO L290 TraceCheckUtils]: 108: Hoare triple {60981#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60981#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:40,753 INFO L290 TraceCheckUtils]: 109: Hoare triple {60981#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60982#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:40,753 INFO L290 TraceCheckUtils]: 110: Hoare triple {60982#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60982#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:40,754 INFO L290 TraceCheckUtils]: 111: Hoare triple {60982#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60983#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:40,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {60983#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60983#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:40,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {60983#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60984#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:40,755 INFO L290 TraceCheckUtils]: 114: Hoare triple {60984#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60984#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:40,755 INFO L290 TraceCheckUtils]: 115: Hoare triple {60984#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60985#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:40,755 INFO L290 TraceCheckUtils]: 116: Hoare triple {60985#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60985#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:40,755 INFO L290 TraceCheckUtils]: 117: Hoare triple {60985#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60986#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:40,756 INFO L290 TraceCheckUtils]: 118: Hoare triple {60986#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60986#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:40,756 INFO L290 TraceCheckUtils]: 119: Hoare triple {60986#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60987#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:40,756 INFO L290 TraceCheckUtils]: 120: Hoare triple {60987#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60987#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:40,757 INFO L290 TraceCheckUtils]: 121: Hoare triple {60987#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60988#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:40,757 INFO L290 TraceCheckUtils]: 122: Hoare triple {60988#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60988#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:40,757 INFO L290 TraceCheckUtils]: 123: Hoare triple {60988#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60989#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:40,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {60989#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {60989#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 125: Hoare triple {60989#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60990#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 126: Hoare triple {60990#(<= main_~i~0 60)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 127: Hoare triple {60926#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {60926#false} is VALID [2022-04-28 03:05:40,758 INFO L272 TraceCheckUtils]: 128: Hoare triple {60926#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {60926#false} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-28 03:05:40,758 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-28 03:05:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:40,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:44,483 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-28 03:05:44,483 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-28 03:05:44,483 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-28 03:05:44,483 INFO L272 TraceCheckUtils]: 128: Hoare triple {60926#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {60926#false} is VALID [2022-04-28 03:05:44,483 INFO L290 TraceCheckUtils]: 127: Hoare triple {60926#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {60926#false} is VALID [2022-04-28 03:05:44,483 INFO L290 TraceCheckUtils]: 126: Hoare triple {61404#(< main_~i~0 2048)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-28 03:05:44,484 INFO L290 TraceCheckUtils]: 125: Hoare triple {61408#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61404#(< main_~i~0 2048)} is VALID [2022-04-28 03:05:44,484 INFO L290 TraceCheckUtils]: 124: Hoare triple {61408#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61408#(< main_~i~0 2047)} is VALID [2022-04-28 03:05:44,484 INFO L290 TraceCheckUtils]: 123: Hoare triple {61415#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61408#(< main_~i~0 2047)} is VALID [2022-04-28 03:05:44,485 INFO L290 TraceCheckUtils]: 122: Hoare triple {61415#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61415#(< main_~i~0 2046)} is VALID [2022-04-28 03:05:44,485 INFO L290 TraceCheckUtils]: 121: Hoare triple {61422#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61415#(< main_~i~0 2046)} is VALID [2022-04-28 03:05:44,485 INFO L290 TraceCheckUtils]: 120: Hoare triple {61422#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61422#(< main_~i~0 2045)} is VALID [2022-04-28 03:05:44,486 INFO L290 TraceCheckUtils]: 119: Hoare triple {61429#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61422#(< main_~i~0 2045)} is VALID [2022-04-28 03:05:44,486 INFO L290 TraceCheckUtils]: 118: Hoare triple {61429#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61429#(< main_~i~0 2044)} is VALID [2022-04-28 03:05:44,486 INFO L290 TraceCheckUtils]: 117: Hoare triple {61436#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61429#(< main_~i~0 2044)} is VALID [2022-04-28 03:05:44,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {61436#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61436#(< main_~i~0 2043)} is VALID [2022-04-28 03:05:44,487 INFO L290 TraceCheckUtils]: 115: Hoare triple {61443#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61436#(< main_~i~0 2043)} is VALID [2022-04-28 03:05:44,487 INFO L290 TraceCheckUtils]: 114: Hoare triple {61443#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61443#(< main_~i~0 2042)} is VALID [2022-04-28 03:05:44,487 INFO L290 TraceCheckUtils]: 113: Hoare triple {61450#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61443#(< main_~i~0 2042)} is VALID [2022-04-28 03:05:44,488 INFO L290 TraceCheckUtils]: 112: Hoare triple {61450#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61450#(< main_~i~0 2041)} is VALID [2022-04-28 03:05:44,488 INFO L290 TraceCheckUtils]: 111: Hoare triple {61457#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61450#(< main_~i~0 2041)} is VALID [2022-04-28 03:05:44,488 INFO L290 TraceCheckUtils]: 110: Hoare triple {61457#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61457#(< main_~i~0 2040)} is VALID [2022-04-28 03:05:44,488 INFO L290 TraceCheckUtils]: 109: Hoare triple {61464#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61457#(< main_~i~0 2040)} is VALID [2022-04-28 03:05:44,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {61464#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61464#(< main_~i~0 2039)} is VALID [2022-04-28 03:05:44,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {61471#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61464#(< main_~i~0 2039)} is VALID [2022-04-28 03:05:44,489 INFO L290 TraceCheckUtils]: 106: Hoare triple {61471#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61471#(< main_~i~0 2038)} is VALID [2022-04-28 03:05:44,490 INFO L290 TraceCheckUtils]: 105: Hoare triple {61478#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61471#(< main_~i~0 2038)} is VALID [2022-04-28 03:05:44,490 INFO L290 TraceCheckUtils]: 104: Hoare triple {61478#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61478#(< main_~i~0 2037)} is VALID [2022-04-28 03:05:44,490 INFO L290 TraceCheckUtils]: 103: Hoare triple {61485#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61478#(< main_~i~0 2037)} is VALID [2022-04-28 03:05:44,490 INFO L290 TraceCheckUtils]: 102: Hoare triple {61485#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61485#(< main_~i~0 2036)} is VALID [2022-04-28 03:05:44,491 INFO L290 TraceCheckUtils]: 101: Hoare triple {61492#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61485#(< main_~i~0 2036)} is VALID [2022-04-28 03:05:44,491 INFO L290 TraceCheckUtils]: 100: Hoare triple {61492#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61492#(< main_~i~0 2035)} is VALID [2022-04-28 03:05:44,491 INFO L290 TraceCheckUtils]: 99: Hoare triple {61499#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61492#(< main_~i~0 2035)} is VALID [2022-04-28 03:05:44,492 INFO L290 TraceCheckUtils]: 98: Hoare triple {61499#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61499#(< main_~i~0 2034)} is VALID [2022-04-28 03:05:44,492 INFO L290 TraceCheckUtils]: 97: Hoare triple {61506#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61499#(< main_~i~0 2034)} is VALID [2022-04-28 03:05:44,492 INFO L290 TraceCheckUtils]: 96: Hoare triple {61506#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61506#(< main_~i~0 2033)} is VALID [2022-04-28 03:05:44,492 INFO L290 TraceCheckUtils]: 95: Hoare triple {61513#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61506#(< main_~i~0 2033)} is VALID [2022-04-28 03:05:44,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {61513#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61513#(< main_~i~0 2032)} is VALID [2022-04-28 03:05:44,493 INFO L290 TraceCheckUtils]: 93: Hoare triple {61520#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61513#(< main_~i~0 2032)} is VALID [2022-04-28 03:05:44,493 INFO L290 TraceCheckUtils]: 92: Hoare triple {61520#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61520#(< main_~i~0 2031)} is VALID [2022-04-28 03:05:44,494 INFO L290 TraceCheckUtils]: 91: Hoare triple {61527#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61520#(< main_~i~0 2031)} is VALID [2022-04-28 03:05:44,494 INFO L290 TraceCheckUtils]: 90: Hoare triple {61527#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61527#(< main_~i~0 2030)} is VALID [2022-04-28 03:05:44,494 INFO L290 TraceCheckUtils]: 89: Hoare triple {61534#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61527#(< main_~i~0 2030)} is VALID [2022-04-28 03:05:44,494 INFO L290 TraceCheckUtils]: 88: Hoare triple {61534#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61534#(< main_~i~0 2029)} is VALID [2022-04-28 03:05:44,495 INFO L290 TraceCheckUtils]: 87: Hoare triple {61541#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61534#(< main_~i~0 2029)} is VALID [2022-04-28 03:05:44,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {61541#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61541#(< main_~i~0 2028)} is VALID [2022-04-28 03:05:44,495 INFO L290 TraceCheckUtils]: 85: Hoare triple {61548#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61541#(< main_~i~0 2028)} is VALID [2022-04-28 03:05:44,495 INFO L290 TraceCheckUtils]: 84: Hoare triple {61548#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61548#(< main_~i~0 2027)} is VALID [2022-04-28 03:05:44,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {61555#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61548#(< main_~i~0 2027)} is VALID [2022-04-28 03:05:44,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {61555#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61555#(< main_~i~0 2026)} is VALID [2022-04-28 03:05:44,496 INFO L290 TraceCheckUtils]: 81: Hoare triple {61562#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61555#(< main_~i~0 2026)} is VALID [2022-04-28 03:05:44,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {61562#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61562#(< main_~i~0 2025)} is VALID [2022-04-28 03:05:44,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {61569#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61562#(< main_~i~0 2025)} is VALID [2022-04-28 03:05:44,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {61569#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61569#(< main_~i~0 2024)} is VALID [2022-04-28 03:05:44,498 INFO L290 TraceCheckUtils]: 77: Hoare triple {61576#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61569#(< main_~i~0 2024)} is VALID [2022-04-28 03:05:44,498 INFO L290 TraceCheckUtils]: 76: Hoare triple {61576#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61576#(< main_~i~0 2023)} is VALID [2022-04-28 03:05:44,498 INFO L290 TraceCheckUtils]: 75: Hoare triple {61583#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61576#(< main_~i~0 2023)} is VALID [2022-04-28 03:05:44,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {61583#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61583#(< main_~i~0 2022)} is VALID [2022-04-28 03:05:44,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {61590#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61583#(< main_~i~0 2022)} is VALID [2022-04-28 03:05:44,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {61590#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61590#(< main_~i~0 2021)} is VALID [2022-04-28 03:05:44,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {61597#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61590#(< main_~i~0 2021)} is VALID [2022-04-28 03:05:44,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {61597#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61597#(< main_~i~0 2020)} is VALID [2022-04-28 03:05:44,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {61604#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61597#(< main_~i~0 2020)} is VALID [2022-04-28 03:05:44,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {61604#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61604#(< main_~i~0 2019)} is VALID [2022-04-28 03:05:44,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {61611#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61604#(< main_~i~0 2019)} is VALID [2022-04-28 03:05:44,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {61611#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61611#(< main_~i~0 2018)} is VALID [2022-04-28 03:05:44,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {61618#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61611#(< main_~i~0 2018)} is VALID [2022-04-28 03:05:44,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {61618#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61618#(< main_~i~0 2017)} is VALID [2022-04-28 03:05:44,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {61625#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61618#(< main_~i~0 2017)} is VALID [2022-04-28 03:05:44,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {61625#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61625#(< main_~i~0 2016)} is VALID [2022-04-28 03:05:44,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {61632#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61625#(< main_~i~0 2016)} is VALID [2022-04-28 03:05:44,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {61632#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61632#(< main_~i~0 2015)} is VALID [2022-04-28 03:05:44,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {61639#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61632#(< main_~i~0 2015)} is VALID [2022-04-28 03:05:44,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {61639#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61639#(< main_~i~0 2014)} is VALID [2022-04-28 03:05:44,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {61646#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61639#(< main_~i~0 2014)} is VALID [2022-04-28 03:05:44,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {61646#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61646#(< main_~i~0 2013)} is VALID [2022-04-28 03:05:44,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {61653#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61646#(< main_~i~0 2013)} is VALID [2022-04-28 03:05:44,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {61653#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61653#(< main_~i~0 2012)} is VALID [2022-04-28 03:05:44,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {61660#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61653#(< main_~i~0 2012)} is VALID [2022-04-28 03:05:44,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {61660#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61660#(< main_~i~0 2011)} is VALID [2022-04-28 03:05:44,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {61667#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61660#(< main_~i~0 2011)} is VALID [2022-04-28 03:05:44,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {61667#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61667#(< main_~i~0 2010)} is VALID [2022-04-28 03:05:44,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {61674#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61667#(< main_~i~0 2010)} is VALID [2022-04-28 03:05:44,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {61674#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61674#(< main_~i~0 2009)} is VALID [2022-04-28 03:05:44,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {61681#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61674#(< main_~i~0 2009)} is VALID [2022-04-28 03:05:44,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {61681#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61681#(< main_~i~0 2008)} is VALID [2022-04-28 03:05:44,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {61688#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61681#(< main_~i~0 2008)} is VALID [2022-04-28 03:05:44,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {61688#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61688#(< main_~i~0 2007)} is VALID [2022-04-28 03:05:44,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {61695#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61688#(< main_~i~0 2007)} is VALID [2022-04-28 03:05:44,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {61695#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61695#(< main_~i~0 2006)} is VALID [2022-04-28 03:05:44,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {61702#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61695#(< main_~i~0 2006)} is VALID [2022-04-28 03:05:44,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {61702#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61702#(< main_~i~0 2005)} is VALID [2022-04-28 03:05:44,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {61709#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61702#(< main_~i~0 2005)} is VALID [2022-04-28 03:05:44,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {61709#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61709#(< main_~i~0 2004)} is VALID [2022-04-28 03:05:44,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {61716#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61709#(< main_~i~0 2004)} is VALID [2022-04-28 03:05:44,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {61716#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61716#(< main_~i~0 2003)} is VALID [2022-04-28 03:05:44,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {61723#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61716#(< main_~i~0 2003)} is VALID [2022-04-28 03:05:44,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {61723#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61723#(< main_~i~0 2002)} is VALID [2022-04-28 03:05:44,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {61730#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61723#(< main_~i~0 2002)} is VALID [2022-04-28 03:05:44,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {61730#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61730#(< main_~i~0 2001)} is VALID [2022-04-28 03:05:44,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {61737#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61730#(< main_~i~0 2001)} is VALID [2022-04-28 03:05:44,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {61737#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61737#(< main_~i~0 2000)} is VALID [2022-04-28 03:05:44,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {61744#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61737#(< main_~i~0 2000)} is VALID [2022-04-28 03:05:44,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {61744#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61744#(< main_~i~0 1999)} is VALID [2022-04-28 03:05:44,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {61751#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61744#(< main_~i~0 1999)} is VALID [2022-04-28 03:05:44,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {61751#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61751#(< main_~i~0 1998)} is VALID [2022-04-28 03:05:44,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {61758#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61751#(< main_~i~0 1998)} is VALID [2022-04-28 03:05:44,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {61758#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61758#(< main_~i~0 1997)} is VALID [2022-04-28 03:05:44,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {61765#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61758#(< main_~i~0 1997)} is VALID [2022-04-28 03:05:44,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {61765#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61765#(< main_~i~0 1996)} is VALID [2022-04-28 03:05:44,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {61772#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61765#(< main_~i~0 1996)} is VALID [2022-04-28 03:05:44,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {61772#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61772#(< main_~i~0 1995)} is VALID [2022-04-28 03:05:44,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {61779#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61772#(< main_~i~0 1995)} is VALID [2022-04-28 03:05:44,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {61779#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61779#(< main_~i~0 1994)} is VALID [2022-04-28 03:05:44,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {61786#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61779#(< main_~i~0 1994)} is VALID [2022-04-28 03:05:44,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {61786#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61786#(< main_~i~0 1993)} is VALID [2022-04-28 03:05:44,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {61793#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61786#(< main_~i~0 1993)} is VALID [2022-04-28 03:05:44,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {61793#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61793#(< main_~i~0 1992)} is VALID [2022-04-28 03:05:44,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {61800#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61793#(< main_~i~0 1992)} is VALID [2022-04-28 03:05:44,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {61800#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61800#(< main_~i~0 1991)} is VALID [2022-04-28 03:05:44,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {61807#(< main_~i~0 1990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61800#(< main_~i~0 1991)} is VALID [2022-04-28 03:05:44,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {61807#(< main_~i~0 1990)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61807#(< main_~i~0 1990)} is VALID [2022-04-28 03:05:44,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {61814#(< main_~i~0 1989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61807#(< main_~i~0 1990)} is VALID [2022-04-28 03:05:44,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {61814#(< main_~i~0 1989)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61814#(< main_~i~0 1989)} is VALID [2022-04-28 03:05:44,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {61821#(< main_~i~0 1988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61814#(< main_~i~0 1989)} is VALID [2022-04-28 03:05:44,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {61821#(< main_~i~0 1988)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {61821#(< main_~i~0 1988)} is VALID [2022-04-28 03:05:44,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {60925#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {61821#(< main_~i~0 1988)} is VALID [2022-04-28 03:05:44,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-28 03:05:44,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-28 03:05:44,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-28 03:05:44,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {60925#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(12, 2); {60925#true} is VALID [2022-04-28 03:05:44,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {60925#true} call ULTIMATE.init(); {60925#true} is VALID [2022-04-28 03:05:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:44,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716992274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:44,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-28 03:05:44,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:44,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [718554332] [2022-04-28 03:05:44,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [718554332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:44,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:05:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958606393] [2022-04-28 03:05:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 03:05:44,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:44,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:44,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:44,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:05:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:05:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-28 03:05:44,617 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:47,072 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2022-04-28 03:05:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:05:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 03:05:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 142 transitions. [2022-04-28 03:05:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 142 transitions. [2022-04-28 03:05:47,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 142 transitions. [2022-04-28 03:05:47,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:47,181 INFO L225 Difference]: With dead ends: 142 [2022-04-28 03:05:47,181 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 03:05:47,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-28 03:05:47,184 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:47,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 39 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:05:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 03:05:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-04-28 03:05:47,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:47,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,897 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,897 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:47,898 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-28 03:05:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2022-04-28 03:05:47,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:47,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:47,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-28 03:05:47,898 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-28 03:05:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:47,899 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-28 03:05:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2022-04-28 03:05:47,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:47,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:47,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:47,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2022-04-28 03:05:47,901 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2022-04-28 03:05:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:47,901 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2022-04-28 03:05:47,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.0) internal successors, (128), 63 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:47,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 135 transitions. [2022-04-28 03:05:48,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2022-04-28 03:05:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 03:05:48,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:48,064 INFO L195 NwaCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:48,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:48,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:48,267 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 562556884, now seen corresponding path program 121 times [2022-04-28 03:05:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690862840] [2022-04-28 03:05:48,269 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:05:48,270 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:05:48,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:05:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 562556884, now seen corresponding path program 122 times [2022-04-28 03:05:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:48,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989492788] [2022-04-28 03:05:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:49,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {62860#(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(12, 2); {62793#true} is VALID [2022-04-28 03:05:49,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {62793#true} call ULTIMATE.init(); {62860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:49,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {62860#(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(12, 2); {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-28 03:05:49,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {62793#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {62798#(= main_~i~0 0)} is VALID [2022-04-28 03:05:49,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {62798#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62798#(= main_~i~0 0)} is VALID [2022-04-28 03:05:49,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {62798#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62799#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:49,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {62799#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62799#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:49,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {62799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62800#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:49,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {62800#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62800#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:49,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {62800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62801#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:49,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {62801#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62801#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:49,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {62801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62802#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:49,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {62802#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62802#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:49,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {62802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62803#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:49,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {62803#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62803#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:49,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {62803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62804#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:49,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {62804#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62804#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:49,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {62804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62805#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:49,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {62805#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62805#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:49,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {62805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62806#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:49,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {62806#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62806#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {62806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62807#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:49,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {62807#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62807#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:49,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {62807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62808#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:49,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {62808#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62808#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:49,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {62808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62809#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:49,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {62809#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62809#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:49,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {62809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62810#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:49,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {62810#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62810#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:49,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {62810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62811#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:49,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {62811#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62811#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:49,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {62811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62812#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:49,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {62812#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62812#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:49,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {62812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62813#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:49,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {62813#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62813#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:49,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {62813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62814#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:49,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {62814#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62814#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:49,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {62814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62815#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:49,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {62815#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62815#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:49,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {62815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62816#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:49,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {62816#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62816#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:49,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {62816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62817#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:49,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {62817#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62817#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:49,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {62817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62818#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:49,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {62818#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62818#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:49,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {62818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62819#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:49,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {62819#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62819#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:49,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {62819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62820#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:49,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {62820#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62820#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:49,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {62820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62821#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:49,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {62821#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62821#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:49,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {62821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62822#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:49,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {62822#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62822#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:49,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {62822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62823#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:49,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {62823#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62823#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:49,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {62823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62824#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:49,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {62824#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62824#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:49,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {62824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62825#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:49,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {62825#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62825#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:49,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {62825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62826#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:49,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {62826#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62826#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:49,537 INFO L290 TraceCheckUtils]: 63: Hoare triple {62826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62827#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:49,537 INFO L290 TraceCheckUtils]: 64: Hoare triple {62827#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62827#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:49,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {62827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62828#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:49,538 INFO L290 TraceCheckUtils]: 66: Hoare triple {62828#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62828#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:49,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {62828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62829#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:49,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {62829#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62829#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:49,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {62829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62830#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:49,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {62830#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62830#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:49,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {62830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62831#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:49,540 INFO L290 TraceCheckUtils]: 72: Hoare triple {62831#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62831#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:49,540 INFO L290 TraceCheckUtils]: 73: Hoare triple {62831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62832#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:49,540 INFO L290 TraceCheckUtils]: 74: Hoare triple {62832#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62832#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:49,541 INFO L290 TraceCheckUtils]: 75: Hoare triple {62832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62833#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:49,541 INFO L290 TraceCheckUtils]: 76: Hoare triple {62833#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62833#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:49,541 INFO L290 TraceCheckUtils]: 77: Hoare triple {62833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62834#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:49,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {62834#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62834#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:49,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {62834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62835#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:49,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {62835#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62835#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:49,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {62835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62836#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:49,542 INFO L290 TraceCheckUtils]: 82: Hoare triple {62836#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62836#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:49,543 INFO L290 TraceCheckUtils]: 83: Hoare triple {62836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62837#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:49,543 INFO L290 TraceCheckUtils]: 84: Hoare triple {62837#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62837#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:49,543 INFO L290 TraceCheckUtils]: 85: Hoare triple {62837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62838#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:49,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {62838#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62838#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:49,544 INFO L290 TraceCheckUtils]: 87: Hoare triple {62838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62839#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:49,544 INFO L290 TraceCheckUtils]: 88: Hoare triple {62839#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62839#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:49,544 INFO L290 TraceCheckUtils]: 89: Hoare triple {62839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62840#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:49,545 INFO L290 TraceCheckUtils]: 90: Hoare triple {62840#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62840#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:49,545 INFO L290 TraceCheckUtils]: 91: Hoare triple {62840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62841#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:49,545 INFO L290 TraceCheckUtils]: 92: Hoare triple {62841#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62841#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:49,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {62841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62842#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:49,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {62842#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62842#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:49,546 INFO L290 TraceCheckUtils]: 95: Hoare triple {62842#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62843#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:49,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {62843#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62843#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:49,547 INFO L290 TraceCheckUtils]: 97: Hoare triple {62843#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62844#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:49,547 INFO L290 TraceCheckUtils]: 98: Hoare triple {62844#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62844#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:49,547 INFO L290 TraceCheckUtils]: 99: Hoare triple {62844#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62845#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:49,547 INFO L290 TraceCheckUtils]: 100: Hoare triple {62845#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62845#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:49,548 INFO L290 TraceCheckUtils]: 101: Hoare triple {62845#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62846#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:49,548 INFO L290 TraceCheckUtils]: 102: Hoare triple {62846#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62846#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:49,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {62846#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62847#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:49,549 INFO L290 TraceCheckUtils]: 104: Hoare triple {62847#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62847#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:49,549 INFO L290 TraceCheckUtils]: 105: Hoare triple {62847#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62848#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:49,549 INFO L290 TraceCheckUtils]: 106: Hoare triple {62848#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62848#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:49,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {62848#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62849#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:49,550 INFO L290 TraceCheckUtils]: 108: Hoare triple {62849#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62849#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:49,550 INFO L290 TraceCheckUtils]: 109: Hoare triple {62849#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62850#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:49,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {62850#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62850#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:49,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {62850#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62851#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:49,551 INFO L290 TraceCheckUtils]: 112: Hoare triple {62851#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62851#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:49,551 INFO L290 TraceCheckUtils]: 113: Hoare triple {62851#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62852#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:49,551 INFO L290 TraceCheckUtils]: 114: Hoare triple {62852#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62852#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:49,552 INFO L290 TraceCheckUtils]: 115: Hoare triple {62852#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62853#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:49,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {62853#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62853#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:49,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {62853#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62854#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:49,552 INFO L290 TraceCheckUtils]: 118: Hoare triple {62854#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62854#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:49,553 INFO L290 TraceCheckUtils]: 119: Hoare triple {62854#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62855#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:49,553 INFO L290 TraceCheckUtils]: 120: Hoare triple {62855#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62855#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:49,553 INFO L290 TraceCheckUtils]: 121: Hoare triple {62855#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62856#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:49,553 INFO L290 TraceCheckUtils]: 122: Hoare triple {62856#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62856#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:49,554 INFO L290 TraceCheckUtils]: 123: Hoare triple {62856#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62857#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:49,554 INFO L290 TraceCheckUtils]: 124: Hoare triple {62857#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62857#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:49,554 INFO L290 TraceCheckUtils]: 125: Hoare triple {62857#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62858#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 126: Hoare triple {62858#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62858#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 127: Hoare triple {62858#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62859#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 128: Hoare triple {62859#(<= main_~i~0 61)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 129: Hoare triple {62794#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {62794#false} is VALID [2022-04-28 03:05:49,555 INFO L272 TraceCheckUtils]: 130: Hoare triple {62794#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {62794#false} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-28 03:05:49,555 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-28 03:05:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989492788] [2022-04-28 03:05:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989492788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158613608] [2022-04-28 03:05:49,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:49,557 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 03:05:49,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:49,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:49,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 03:05:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:49,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:50,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {62793#true} call ULTIMATE.init(); {62793#true} is VALID [2022-04-28 03:05:50,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {62793#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(12, 2); {62793#true} is VALID [2022-04-28 03:05:50,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-28 03:05:50,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-28 03:05:50,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-28 03:05:50,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {62793#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {62879#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:50,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {62879#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62879#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:50,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {62879#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62799#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:50,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {62799#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62799#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:50,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {62799#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62800#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:50,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {62800#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62800#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:50,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {62800#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62801#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:50,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {62801#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62801#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:50,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {62801#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62802#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:50,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {62802#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62802#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:50,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {62802#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62803#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:50,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {62803#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62803#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:50,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {62803#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62804#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:50,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {62804#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62804#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:50,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {62804#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62805#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:50,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {62805#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62805#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:50,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {62805#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62806#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:50,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {62806#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62806#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:50,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {62806#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62807#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:50,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {62807#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62807#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:50,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {62807#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62808#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:50,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {62808#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62808#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:50,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {62808#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62809#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:50,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {62809#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62809#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:50,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {62809#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62810#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:50,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {62810#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62810#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:50,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {62810#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62811#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:50,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {62811#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62811#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:50,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {62811#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62812#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:50,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {62812#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62812#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:50,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {62812#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62813#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:50,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {62813#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62813#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:50,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {62813#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62814#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:50,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {62814#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62814#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:50,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {62814#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62815#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:50,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {62815#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62815#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:50,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {62815#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62816#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:50,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {62816#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62816#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:50,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {62816#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62817#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:50,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {62817#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62817#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:50,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {62817#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62818#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:50,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {62818#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62818#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:50,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {62818#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62819#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:50,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {62819#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62819#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:50,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {62819#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62820#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:50,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {62820#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62820#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:50,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {62820#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62821#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:50,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {62821#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62821#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:50,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {62821#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62822#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:50,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {62822#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62822#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:50,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {62822#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62823#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:50,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {62823#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62823#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:50,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {62823#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62824#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:50,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {62824#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62824#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:50,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {62824#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62825#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:50,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {62825#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62825#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:50,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {62825#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62826#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:50,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {62826#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62826#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:50,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {62826#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62827#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:50,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {62827#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62827#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:50,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {62827#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62828#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:50,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {62828#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62828#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:50,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {62828#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62829#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:50,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {62829#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62829#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:50,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {62829#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62830#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:50,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {62830#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62830#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:50,683 INFO L290 TraceCheckUtils]: 71: Hoare triple {62830#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62831#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:50,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {62831#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62831#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:50,683 INFO L290 TraceCheckUtils]: 73: Hoare triple {62831#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62832#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:50,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {62832#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62832#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:50,684 INFO L290 TraceCheckUtils]: 75: Hoare triple {62832#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62833#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:50,684 INFO L290 TraceCheckUtils]: 76: Hoare triple {62833#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62833#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:50,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {62833#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62834#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:50,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {62834#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62834#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:50,685 INFO L290 TraceCheckUtils]: 79: Hoare triple {62834#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62835#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:50,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {62835#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62835#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:50,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {62835#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62836#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:50,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {62836#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62836#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:50,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {62836#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62837#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:50,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {62837#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62837#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:50,687 INFO L290 TraceCheckUtils]: 85: Hoare triple {62837#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62838#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:50,687 INFO L290 TraceCheckUtils]: 86: Hoare triple {62838#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62838#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:50,687 INFO L290 TraceCheckUtils]: 87: Hoare triple {62838#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62839#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:50,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {62839#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62839#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:50,688 INFO L290 TraceCheckUtils]: 89: Hoare triple {62839#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62840#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:50,688 INFO L290 TraceCheckUtils]: 90: Hoare triple {62840#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62840#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:50,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {62840#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62841#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:50,689 INFO L290 TraceCheckUtils]: 92: Hoare triple {62841#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62841#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:50,689 INFO L290 TraceCheckUtils]: 93: Hoare triple {62841#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62842#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:50,689 INFO L290 TraceCheckUtils]: 94: Hoare triple {62842#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62842#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:50,690 INFO L290 TraceCheckUtils]: 95: Hoare triple {62842#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62843#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:50,690 INFO L290 TraceCheckUtils]: 96: Hoare triple {62843#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62843#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:50,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {62843#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62844#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:50,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {62844#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62844#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:50,691 INFO L290 TraceCheckUtils]: 99: Hoare triple {62844#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62845#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:50,691 INFO L290 TraceCheckUtils]: 100: Hoare triple {62845#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62845#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:50,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {62845#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62846#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:50,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {62846#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62846#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:50,692 INFO L290 TraceCheckUtils]: 103: Hoare triple {62846#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62847#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:50,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {62847#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62847#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:50,692 INFO L290 TraceCheckUtils]: 105: Hoare triple {62847#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62848#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:50,692 INFO L290 TraceCheckUtils]: 106: Hoare triple {62848#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62848#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:50,693 INFO L290 TraceCheckUtils]: 107: Hoare triple {62848#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62849#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:50,693 INFO L290 TraceCheckUtils]: 108: Hoare triple {62849#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62849#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:50,693 INFO L290 TraceCheckUtils]: 109: Hoare triple {62849#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62850#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:50,694 INFO L290 TraceCheckUtils]: 110: Hoare triple {62850#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62850#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:50,694 INFO L290 TraceCheckUtils]: 111: Hoare triple {62850#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62851#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:50,694 INFO L290 TraceCheckUtils]: 112: Hoare triple {62851#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62851#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:50,694 INFO L290 TraceCheckUtils]: 113: Hoare triple {62851#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62852#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:50,695 INFO L290 TraceCheckUtils]: 114: Hoare triple {62852#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62852#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:50,695 INFO L290 TraceCheckUtils]: 115: Hoare triple {62852#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62853#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:50,695 INFO L290 TraceCheckUtils]: 116: Hoare triple {62853#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62853#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:50,696 INFO L290 TraceCheckUtils]: 117: Hoare triple {62853#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62854#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:50,696 INFO L290 TraceCheckUtils]: 118: Hoare triple {62854#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62854#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:50,696 INFO L290 TraceCheckUtils]: 119: Hoare triple {62854#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62855#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:50,696 INFO L290 TraceCheckUtils]: 120: Hoare triple {62855#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62855#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:50,697 INFO L290 TraceCheckUtils]: 121: Hoare triple {62855#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62856#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:50,697 INFO L290 TraceCheckUtils]: 122: Hoare triple {62856#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62856#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:50,697 INFO L290 TraceCheckUtils]: 123: Hoare triple {62856#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62857#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:50,697 INFO L290 TraceCheckUtils]: 124: Hoare triple {62857#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62857#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:50,698 INFO L290 TraceCheckUtils]: 125: Hoare triple {62857#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62858#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:50,698 INFO L290 TraceCheckUtils]: 126: Hoare triple {62858#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {62858#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:50,698 INFO L290 TraceCheckUtils]: 127: Hoare triple {62858#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62859#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:50,699 INFO L290 TraceCheckUtils]: 128: Hoare triple {62859#(<= main_~i~0 61)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L290 TraceCheckUtils]: 129: Hoare triple {62794#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L272 TraceCheckUtils]: 130: Hoare triple {62794#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-28 03:05:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:50,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:54,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-28 03:05:54,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-28 03:05:54,548 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-28 03:05:54,548 INFO L272 TraceCheckUtils]: 130: Hoare triple {62794#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {62794#false} is VALID [2022-04-28 03:05:54,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {62794#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {62794#false} is VALID [2022-04-28 03:05:54,548 INFO L290 TraceCheckUtils]: 128: Hoare triple {63279#(< main_~i~0 2048)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-28 03:05:54,549 INFO L290 TraceCheckUtils]: 127: Hoare triple {63283#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63279#(< main_~i~0 2048)} is VALID [2022-04-28 03:05:54,549 INFO L290 TraceCheckUtils]: 126: Hoare triple {63283#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63283#(< main_~i~0 2047)} is VALID [2022-04-28 03:05:54,549 INFO L290 TraceCheckUtils]: 125: Hoare triple {63290#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63283#(< main_~i~0 2047)} is VALID [2022-04-28 03:05:54,550 INFO L290 TraceCheckUtils]: 124: Hoare triple {63290#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63290#(< main_~i~0 2046)} is VALID [2022-04-28 03:05:54,550 INFO L290 TraceCheckUtils]: 123: Hoare triple {63297#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63290#(< main_~i~0 2046)} is VALID [2022-04-28 03:05:54,550 INFO L290 TraceCheckUtils]: 122: Hoare triple {63297#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63297#(< main_~i~0 2045)} is VALID [2022-04-28 03:05:54,551 INFO L290 TraceCheckUtils]: 121: Hoare triple {63304#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63297#(< main_~i~0 2045)} is VALID [2022-04-28 03:05:54,551 INFO L290 TraceCheckUtils]: 120: Hoare triple {63304#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63304#(< main_~i~0 2044)} is VALID [2022-04-28 03:05:54,551 INFO L290 TraceCheckUtils]: 119: Hoare triple {63311#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63304#(< main_~i~0 2044)} is VALID [2022-04-28 03:05:54,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {63311#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63311#(< main_~i~0 2043)} is VALID [2022-04-28 03:05:54,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {63318#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63311#(< main_~i~0 2043)} is VALID [2022-04-28 03:05:54,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {63318#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63318#(< main_~i~0 2042)} is VALID [2022-04-28 03:05:54,552 INFO L290 TraceCheckUtils]: 115: Hoare triple {63325#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63318#(< main_~i~0 2042)} is VALID [2022-04-28 03:05:54,553 INFO L290 TraceCheckUtils]: 114: Hoare triple {63325#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63325#(< main_~i~0 2041)} is VALID [2022-04-28 03:05:54,553 INFO L290 TraceCheckUtils]: 113: Hoare triple {63332#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63325#(< main_~i~0 2041)} is VALID [2022-04-28 03:05:54,553 INFO L290 TraceCheckUtils]: 112: Hoare triple {63332#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63332#(< main_~i~0 2040)} is VALID [2022-04-28 03:05:54,553 INFO L290 TraceCheckUtils]: 111: Hoare triple {63339#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63332#(< main_~i~0 2040)} is VALID [2022-04-28 03:05:54,554 INFO L290 TraceCheckUtils]: 110: Hoare triple {63339#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63339#(< main_~i~0 2039)} is VALID [2022-04-28 03:05:54,554 INFO L290 TraceCheckUtils]: 109: Hoare triple {63346#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63339#(< main_~i~0 2039)} is VALID [2022-04-28 03:05:54,554 INFO L290 TraceCheckUtils]: 108: Hoare triple {63346#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63346#(< main_~i~0 2038)} is VALID [2022-04-28 03:05:54,554 INFO L290 TraceCheckUtils]: 107: Hoare triple {63353#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63346#(< main_~i~0 2038)} is VALID [2022-04-28 03:05:54,555 INFO L290 TraceCheckUtils]: 106: Hoare triple {63353#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63353#(< main_~i~0 2037)} is VALID [2022-04-28 03:05:54,555 INFO L290 TraceCheckUtils]: 105: Hoare triple {63360#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63353#(< main_~i~0 2037)} is VALID [2022-04-28 03:05:54,555 INFO L290 TraceCheckUtils]: 104: Hoare triple {63360#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63360#(< main_~i~0 2036)} is VALID [2022-04-28 03:05:54,556 INFO L290 TraceCheckUtils]: 103: Hoare triple {63367#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63360#(< main_~i~0 2036)} is VALID [2022-04-28 03:05:54,556 INFO L290 TraceCheckUtils]: 102: Hoare triple {63367#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63367#(< main_~i~0 2035)} is VALID [2022-04-28 03:05:54,556 INFO L290 TraceCheckUtils]: 101: Hoare triple {63374#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63367#(< main_~i~0 2035)} is VALID [2022-04-28 03:05:54,556 INFO L290 TraceCheckUtils]: 100: Hoare triple {63374#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63374#(< main_~i~0 2034)} is VALID [2022-04-28 03:05:54,557 INFO L290 TraceCheckUtils]: 99: Hoare triple {63381#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63374#(< main_~i~0 2034)} is VALID [2022-04-28 03:05:54,557 INFO L290 TraceCheckUtils]: 98: Hoare triple {63381#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63381#(< main_~i~0 2033)} is VALID [2022-04-28 03:05:54,557 INFO L290 TraceCheckUtils]: 97: Hoare triple {63388#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63381#(< main_~i~0 2033)} is VALID [2022-04-28 03:05:54,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {63388#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63388#(< main_~i~0 2032)} is VALID [2022-04-28 03:05:54,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {63395#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63388#(< main_~i~0 2032)} is VALID [2022-04-28 03:05:54,558 INFO L290 TraceCheckUtils]: 94: Hoare triple {63395#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63395#(< main_~i~0 2031)} is VALID [2022-04-28 03:05:54,558 INFO L290 TraceCheckUtils]: 93: Hoare triple {63402#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63395#(< main_~i~0 2031)} is VALID [2022-04-28 03:05:54,559 INFO L290 TraceCheckUtils]: 92: Hoare triple {63402#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63402#(< main_~i~0 2030)} is VALID [2022-04-28 03:05:54,559 INFO L290 TraceCheckUtils]: 91: Hoare triple {63409#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63402#(< main_~i~0 2030)} is VALID [2022-04-28 03:05:54,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {63409#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63409#(< main_~i~0 2029)} is VALID [2022-04-28 03:05:54,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {63416#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63409#(< main_~i~0 2029)} is VALID [2022-04-28 03:05:54,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {63416#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63416#(< main_~i~0 2028)} is VALID [2022-04-28 03:05:54,560 INFO L290 TraceCheckUtils]: 87: Hoare triple {63423#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63416#(< main_~i~0 2028)} is VALID [2022-04-28 03:05:54,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {63423#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63423#(< main_~i~0 2027)} is VALID [2022-04-28 03:05:54,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {63430#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63423#(< main_~i~0 2027)} is VALID [2022-04-28 03:05:54,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {63430#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63430#(< main_~i~0 2026)} is VALID [2022-04-28 03:05:54,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {63437#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63430#(< main_~i~0 2026)} is VALID [2022-04-28 03:05:54,561 INFO L290 TraceCheckUtils]: 82: Hoare triple {63437#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63437#(< main_~i~0 2025)} is VALID [2022-04-28 03:05:54,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {63444#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63437#(< main_~i~0 2025)} is VALID [2022-04-28 03:05:54,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {63444#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63444#(< main_~i~0 2024)} is VALID [2022-04-28 03:05:54,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {63451#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63444#(< main_~i~0 2024)} is VALID [2022-04-28 03:05:54,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {63451#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63451#(< main_~i~0 2023)} is VALID [2022-04-28 03:05:54,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {63458#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63451#(< main_~i~0 2023)} is VALID [2022-04-28 03:05:54,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {63458#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63458#(< main_~i~0 2022)} is VALID [2022-04-28 03:05:54,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {63465#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63458#(< main_~i~0 2022)} is VALID [2022-04-28 03:05:54,564 INFO L290 TraceCheckUtils]: 74: Hoare triple {63465#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63465#(< main_~i~0 2021)} is VALID [2022-04-28 03:05:54,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {63472#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63465#(< main_~i~0 2021)} is VALID [2022-04-28 03:05:54,564 INFO L290 TraceCheckUtils]: 72: Hoare triple {63472#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63472#(< main_~i~0 2020)} is VALID [2022-04-28 03:05:54,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {63479#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63472#(< main_~i~0 2020)} is VALID [2022-04-28 03:05:54,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {63479#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63479#(< main_~i~0 2019)} is VALID [2022-04-28 03:05:54,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {63486#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63479#(< main_~i~0 2019)} is VALID [2022-04-28 03:05:54,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {63486#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63486#(< main_~i~0 2018)} is VALID [2022-04-28 03:05:54,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {63493#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63486#(< main_~i~0 2018)} is VALID [2022-04-28 03:05:54,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {63493#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63493#(< main_~i~0 2017)} is VALID [2022-04-28 03:05:54,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {63500#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63493#(< main_~i~0 2017)} is VALID [2022-04-28 03:05:54,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {63500#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63500#(< main_~i~0 2016)} is VALID [2022-04-28 03:05:54,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {63507#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63500#(< main_~i~0 2016)} is VALID [2022-04-28 03:05:54,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {63507#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63507#(< main_~i~0 2015)} is VALID [2022-04-28 03:05:54,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {63514#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63507#(< main_~i~0 2015)} is VALID [2022-04-28 03:05:54,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {63514#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63514#(< main_~i~0 2014)} is VALID [2022-04-28 03:05:54,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {63521#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63514#(< main_~i~0 2014)} is VALID [2022-04-28 03:05:54,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {63521#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63521#(< main_~i~0 2013)} is VALID [2022-04-28 03:05:54,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {63528#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63521#(< main_~i~0 2013)} is VALID [2022-04-28 03:05:54,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {63528#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63528#(< main_~i~0 2012)} is VALID [2022-04-28 03:05:54,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {63535#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63528#(< main_~i~0 2012)} is VALID [2022-04-28 03:05:54,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {63535#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63535#(< main_~i~0 2011)} is VALID [2022-04-28 03:05:54,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {63542#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63535#(< main_~i~0 2011)} is VALID [2022-04-28 03:05:54,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {63542#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63542#(< main_~i~0 2010)} is VALID [2022-04-28 03:05:54,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {63549#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63542#(< main_~i~0 2010)} is VALID [2022-04-28 03:05:54,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {63549#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63549#(< main_~i~0 2009)} is VALID [2022-04-28 03:05:54,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {63556#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63549#(< main_~i~0 2009)} is VALID [2022-04-28 03:05:54,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {63556#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63556#(< main_~i~0 2008)} is VALID [2022-04-28 03:05:54,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {63563#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63556#(< main_~i~0 2008)} is VALID [2022-04-28 03:05:54,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {63563#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63563#(< main_~i~0 2007)} is VALID [2022-04-28 03:05:54,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {63570#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63563#(< main_~i~0 2007)} is VALID [2022-04-28 03:05:54,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {63570#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63570#(< main_~i~0 2006)} is VALID [2022-04-28 03:05:54,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {63577#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63570#(< main_~i~0 2006)} is VALID [2022-04-28 03:05:54,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {63577#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63577#(< main_~i~0 2005)} is VALID [2022-04-28 03:05:54,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {63584#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63577#(< main_~i~0 2005)} is VALID [2022-04-28 03:05:54,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {63584#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63584#(< main_~i~0 2004)} is VALID [2022-04-28 03:05:54,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {63591#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63584#(< main_~i~0 2004)} is VALID [2022-04-28 03:05:54,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {63591#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63591#(< main_~i~0 2003)} is VALID [2022-04-28 03:05:54,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {63598#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63591#(< main_~i~0 2003)} is VALID [2022-04-28 03:05:54,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {63598#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63598#(< main_~i~0 2002)} is VALID [2022-04-28 03:05:54,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {63605#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63598#(< main_~i~0 2002)} is VALID [2022-04-28 03:05:54,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {63605#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63605#(< main_~i~0 2001)} is VALID [2022-04-28 03:05:54,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {63612#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63605#(< main_~i~0 2001)} is VALID [2022-04-28 03:05:54,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {63612#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63612#(< main_~i~0 2000)} is VALID [2022-04-28 03:05:54,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {63619#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63612#(< main_~i~0 2000)} is VALID [2022-04-28 03:05:54,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {63619#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63619#(< main_~i~0 1999)} is VALID [2022-04-28 03:05:54,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {63626#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63619#(< main_~i~0 1999)} is VALID [2022-04-28 03:05:54,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {63626#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63626#(< main_~i~0 1998)} is VALID [2022-04-28 03:05:54,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {63633#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63626#(< main_~i~0 1998)} is VALID [2022-04-28 03:05:54,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {63633#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63633#(< main_~i~0 1997)} is VALID [2022-04-28 03:05:54,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {63640#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63633#(< main_~i~0 1997)} is VALID [2022-04-28 03:05:54,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {63640#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63640#(< main_~i~0 1996)} is VALID [2022-04-28 03:05:54,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {63647#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63640#(< main_~i~0 1996)} is VALID [2022-04-28 03:05:54,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {63647#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63647#(< main_~i~0 1995)} is VALID [2022-04-28 03:05:54,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {63654#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63647#(< main_~i~0 1995)} is VALID [2022-04-28 03:05:54,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {63654#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63654#(< main_~i~0 1994)} is VALID [2022-04-28 03:05:54,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {63661#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63654#(< main_~i~0 1994)} is VALID [2022-04-28 03:05:54,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {63661#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63661#(< main_~i~0 1993)} is VALID [2022-04-28 03:05:54,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {63668#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63661#(< main_~i~0 1993)} is VALID [2022-04-28 03:05:54,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {63668#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63668#(< main_~i~0 1992)} is VALID [2022-04-28 03:05:54,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {63675#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63668#(< main_~i~0 1992)} is VALID [2022-04-28 03:05:54,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {63675#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63675#(< main_~i~0 1991)} is VALID [2022-04-28 03:05:54,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {63682#(< main_~i~0 1990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63675#(< main_~i~0 1991)} is VALID [2022-04-28 03:05:54,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {63682#(< main_~i~0 1990)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63682#(< main_~i~0 1990)} is VALID [2022-04-28 03:05:54,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {63689#(< main_~i~0 1989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63682#(< main_~i~0 1990)} is VALID [2022-04-28 03:05:54,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {63689#(< main_~i~0 1989)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63689#(< main_~i~0 1989)} is VALID [2022-04-28 03:05:54,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {63696#(< main_~i~0 1988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63689#(< main_~i~0 1989)} is VALID [2022-04-28 03:05:54,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {63696#(< main_~i~0 1988)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63696#(< main_~i~0 1988)} is VALID [2022-04-28 03:05:54,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {63703#(< main_~i~0 1987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63696#(< main_~i~0 1988)} is VALID [2022-04-28 03:05:54,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {63703#(< main_~i~0 1987)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {63703#(< main_~i~0 1987)} is VALID [2022-04-28 03:05:54,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {62793#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {63703#(< main_~i~0 1987)} is VALID [2022-04-28 03:05:54,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-28 03:05:54,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-28 03:05:54,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-28 03:05:54,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {62793#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(12, 2); {62793#true} is VALID [2022-04-28 03:05:54,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {62793#true} call ULTIMATE.init(); {62793#true} is VALID [2022-04-28 03:05:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158613608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:54,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:54,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-28 03:05:54,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:54,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690862840] [2022-04-28 03:05:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690862840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:54,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:54,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 03:05:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219966993] [2022-04-28 03:05:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-28 03:05:54,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:54,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:54,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:54,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 03:05:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 03:05:54,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:05:54,665 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:57,217 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2022-04-28 03:05:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:05:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-28 03:05:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2022-04-28 03:05:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2022-04-28 03:05:57,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 144 transitions. [2022-04-28 03:05:57,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:57,316 INFO L225 Difference]: With dead ends: 144 [2022-04-28 03:05:57,316 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 03:05:57,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-28 03:05:57,319 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 132 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:57,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 34 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:05:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 03:05:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-04-28 03:05:58,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:58,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:58,053 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:58,053 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:58,054 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-28 03:05:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2022-04-28 03:05:58,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:58,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:58,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-28 03:05:58,054 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-28 03:05:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:58,055 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-28 03:05:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2022-04-28 03:05:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:58,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:58,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2022-04-28 03:05:58,057 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2022-04-28 03:05:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:58,057 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2022-04-28 03:05:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0) internal successors, (130), 64 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:58,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 137 transitions. [2022-04-28 03:05:58,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2022-04-28 03:05:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 03:05:58,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:58,241 INFO L195 NwaCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:58,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-04-28 03:05:58,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:58,444 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1422801162, now seen corresponding path program 123 times [2022-04-28 03:05:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306190058] [2022-04-28 03:05:58,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:05:58,457 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:05:58,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:05:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1422801162, now seen corresponding path program 124 times [2022-04-28 03:05:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:58,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773399681] [2022-04-28 03:05:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:59,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {64757#(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(12, 2); {64689#true} is VALID [2022-04-28 03:05:59,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-28 03:05:59,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-28 03:05:59,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {64689#true} call ULTIMATE.init(); {64757#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:59,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {64757#(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(12, 2); {64689#true} is VALID [2022-04-28 03:05:59,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-28 03:05:59,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-28 03:05:59,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-28 03:05:59,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {64689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {64694#(= main_~i~0 0)} is VALID [2022-04-28 03:05:59,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {64694#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64694#(= main_~i~0 0)} is VALID [2022-04-28 03:05:59,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {64694#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64695#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:59,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {64695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64695#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:59,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {64695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64696#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:59,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {64696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64696#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:59,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {64696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64697#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:59,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {64697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64697#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:59,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {64697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64698#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:59,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {64698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64698#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:59,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {64698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64699#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:59,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {64699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64699#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:59,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {64699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64700#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:59,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {64700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64700#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:59,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {64700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64701#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:59,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {64701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64701#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:59,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {64701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64702#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:59,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {64702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64702#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:59,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {64702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64703#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:59,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {64703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64703#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:59,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {64703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64704#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:59,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {64704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64704#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:59,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {64704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64705#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:59,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {64705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64705#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:59,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {64705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64706#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:59,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {64706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64706#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:59,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {64706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64707#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:59,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {64707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64707#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:59,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {64707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64708#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:59,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {64708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64708#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:59,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {64708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64709#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:59,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {64709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64709#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:59,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {64709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64710#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:59,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {64710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64710#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:59,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {64710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64711#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:59,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {64711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64711#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:59,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {64711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64712#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:59,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {64712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64712#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:59,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {64712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64713#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:59,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {64713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64713#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:59,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {64713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64714#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:59,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {64714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64714#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:59,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {64714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64715#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:59,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {64715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64715#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:59,770 INFO L290 TraceCheckUtils]: 49: Hoare triple {64715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64716#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:59,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {64716#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64716#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:59,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {64716#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64717#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:59,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {64717#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64717#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:59,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {64717#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64718#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:59,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {64718#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64718#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:59,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {64718#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64719#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:59,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {64719#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64719#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:59,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {64719#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64720#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:59,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {64720#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64720#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:59,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {64720#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64721#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:59,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {64721#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64721#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:59,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {64721#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64722#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:59,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {64722#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64722#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:59,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {64722#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64723#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:59,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {64723#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64723#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:59,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {64723#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64724#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:59,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {64724#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64724#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:59,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {64724#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64725#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:59,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {64725#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64725#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:59,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {64725#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64726#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:59,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {64726#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64726#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:59,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {64726#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64727#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:59,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {64727#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64727#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:59,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {64727#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64728#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:59,777 INFO L290 TraceCheckUtils]: 74: Hoare triple {64728#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64728#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:59,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {64728#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64729#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:59,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {64729#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64729#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:59,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {64729#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64730#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:59,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {64730#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64730#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:59,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {64730#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64731#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:59,779 INFO L290 TraceCheckUtils]: 80: Hoare triple {64731#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64731#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:59,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {64731#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64732#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:59,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {64732#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64732#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:59,780 INFO L290 TraceCheckUtils]: 83: Hoare triple {64732#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64733#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:59,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {64733#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64733#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:59,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {64733#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64734#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:59,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {64734#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64734#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:59,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {64734#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64735#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:59,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {64735#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64735#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:59,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {64735#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64736#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:59,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {64736#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64736#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:59,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {64736#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64737#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:59,782 INFO L290 TraceCheckUtils]: 92: Hoare triple {64737#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64737#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:59,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {64737#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64738#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:59,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {64738#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64738#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:59,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {64738#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64739#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:59,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {64739#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64739#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:59,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {64739#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64740#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:59,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {64740#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64740#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:59,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {64740#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64741#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:59,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {64741#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64741#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:59,785 INFO L290 TraceCheckUtils]: 101: Hoare triple {64741#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64742#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:59,785 INFO L290 TraceCheckUtils]: 102: Hoare triple {64742#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64742#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:59,785 INFO L290 TraceCheckUtils]: 103: Hoare triple {64742#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64743#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:59,785 INFO L290 TraceCheckUtils]: 104: Hoare triple {64743#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64743#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:59,786 INFO L290 TraceCheckUtils]: 105: Hoare triple {64743#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64744#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:59,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {64744#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64744#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:59,786 INFO L290 TraceCheckUtils]: 107: Hoare triple {64744#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64745#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:59,786 INFO L290 TraceCheckUtils]: 108: Hoare triple {64745#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64745#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:59,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {64745#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64746#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:59,787 INFO L290 TraceCheckUtils]: 110: Hoare triple {64746#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64746#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:59,787 INFO L290 TraceCheckUtils]: 111: Hoare triple {64746#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64747#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:59,788 INFO L290 TraceCheckUtils]: 112: Hoare triple {64747#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64747#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:59,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {64747#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64748#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:59,788 INFO L290 TraceCheckUtils]: 114: Hoare triple {64748#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64748#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:59,788 INFO L290 TraceCheckUtils]: 115: Hoare triple {64748#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64749#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:59,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {64749#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64749#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:59,789 INFO L290 TraceCheckUtils]: 117: Hoare triple {64749#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64750#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:59,789 INFO L290 TraceCheckUtils]: 118: Hoare triple {64750#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64750#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:59,790 INFO L290 TraceCheckUtils]: 119: Hoare triple {64750#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64751#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:59,790 INFO L290 TraceCheckUtils]: 120: Hoare triple {64751#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64751#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:59,790 INFO L290 TraceCheckUtils]: 121: Hoare triple {64751#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64752#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:59,790 INFO L290 TraceCheckUtils]: 122: Hoare triple {64752#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64752#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:59,791 INFO L290 TraceCheckUtils]: 123: Hoare triple {64752#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64753#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:59,791 INFO L290 TraceCheckUtils]: 124: Hoare triple {64753#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64753#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:59,791 INFO L290 TraceCheckUtils]: 125: Hoare triple {64753#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64754#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:59,791 INFO L290 TraceCheckUtils]: 126: Hoare triple {64754#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64754#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:59,792 INFO L290 TraceCheckUtils]: 127: Hoare triple {64754#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64755#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:59,792 INFO L290 TraceCheckUtils]: 128: Hoare triple {64755#(<= main_~i~0 61)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64755#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:59,792 INFO L290 TraceCheckUtils]: 129: Hoare triple {64755#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64756#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:59,793 INFO L290 TraceCheckUtils]: 130: Hoare triple {64756#(<= main_~i~0 62)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L290 TraceCheckUtils]: 131: Hoare triple {64690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L272 TraceCheckUtils]: 132: Hoare triple {64690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-28 03:05:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:59,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773399681] [2022-04-28 03:05:59,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773399681] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:59,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488888881] [2022-04-28 03:05:59,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:05:59,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:59,795 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:59,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 03:06:00,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:00,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:00,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 03:06:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:00,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:00,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {64689#true} call ULTIMATE.init(); {64689#true} is VALID [2022-04-28 03:06:00,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {64689#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(12, 2); {64689#true} is VALID [2022-04-28 03:06:00,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-28 03:06:00,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-28 03:06:00,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-28 03:06:00,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {64689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {64776#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:00,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {64776#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64776#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:00,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {64776#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64695#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:00,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {64695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64695#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:00,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {64695#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64696#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:00,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {64696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64696#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:00,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {64696#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64697#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:00,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {64697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64697#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:00,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {64697#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64698#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:00,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {64698#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64698#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:00,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {64698#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64699#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:00,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {64699#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64699#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:00,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {64699#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64700#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:00,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {64700#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64700#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:00,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {64700#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64701#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:00,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {64701#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64701#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:00,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {64701#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64702#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:00,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {64702#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64702#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:00,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {64702#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64703#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:00,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {64703#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64703#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:00,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {64703#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64704#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:00,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {64704#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64704#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:00,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {64704#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64705#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:00,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {64705#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64705#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:00,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {64705#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64706#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:00,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {64706#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64706#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:00,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {64706#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64707#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:00,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {64707#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64707#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:00,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {64707#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64708#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:00,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {64708#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64708#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:00,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {64708#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64709#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:00,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {64709#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64709#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:00,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {64709#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64710#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:00,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {64710#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64710#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:00,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {64710#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64711#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:00,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {64711#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64711#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:00,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {64711#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64712#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:00,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {64712#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64712#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:00,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {64712#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64713#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:00,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {64713#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64713#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:00,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {64713#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64714#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:00,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {64714#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64714#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:00,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {64714#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64715#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:00,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {64715#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64715#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:00,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {64715#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64716#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:00,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {64716#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64716#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:00,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {64716#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64717#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:00,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {64717#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64717#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:00,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {64717#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64718#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:00,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {64718#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64718#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:00,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {64718#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64719#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:00,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {64719#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64719#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:00,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {64719#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64720#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:00,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {64720#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64720#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:00,999 INFO L290 TraceCheckUtils]: 59: Hoare triple {64720#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64721#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:01,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {64721#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64721#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:01,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {64721#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64722#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:01,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {64722#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64722#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:01,001 INFO L290 TraceCheckUtils]: 63: Hoare triple {64722#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64723#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:01,001 INFO L290 TraceCheckUtils]: 64: Hoare triple {64723#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64723#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:01,001 INFO L290 TraceCheckUtils]: 65: Hoare triple {64723#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64724#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:01,002 INFO L290 TraceCheckUtils]: 66: Hoare triple {64724#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64724#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:01,002 INFO L290 TraceCheckUtils]: 67: Hoare triple {64724#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64725#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:01,002 INFO L290 TraceCheckUtils]: 68: Hoare triple {64725#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64725#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:01,002 INFO L290 TraceCheckUtils]: 69: Hoare triple {64725#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64726#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:01,003 INFO L290 TraceCheckUtils]: 70: Hoare triple {64726#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64726#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:01,003 INFO L290 TraceCheckUtils]: 71: Hoare triple {64726#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64727#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:01,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {64727#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64727#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:01,004 INFO L290 TraceCheckUtils]: 73: Hoare triple {64727#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64728#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:01,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {64728#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64728#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:01,004 INFO L290 TraceCheckUtils]: 75: Hoare triple {64728#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64729#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:01,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {64729#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64729#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:01,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {64729#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64730#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:01,005 INFO L290 TraceCheckUtils]: 78: Hoare triple {64730#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64730#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:01,005 INFO L290 TraceCheckUtils]: 79: Hoare triple {64730#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64731#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:01,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {64731#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64731#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:01,006 INFO L290 TraceCheckUtils]: 81: Hoare triple {64731#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64732#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:01,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {64732#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64732#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:01,006 INFO L290 TraceCheckUtils]: 83: Hoare triple {64732#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64733#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:01,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {64733#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64733#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:01,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {64733#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64734#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:01,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {64734#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64734#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:01,007 INFO L290 TraceCheckUtils]: 87: Hoare triple {64734#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64735#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:01,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {64735#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64735#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:01,008 INFO L290 TraceCheckUtils]: 89: Hoare triple {64735#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64736#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:01,008 INFO L290 TraceCheckUtils]: 90: Hoare triple {64736#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64736#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:01,009 INFO L290 TraceCheckUtils]: 91: Hoare triple {64736#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64737#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:01,009 INFO L290 TraceCheckUtils]: 92: Hoare triple {64737#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64737#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:01,009 INFO L290 TraceCheckUtils]: 93: Hoare triple {64737#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64738#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:01,009 INFO L290 TraceCheckUtils]: 94: Hoare triple {64738#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64738#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:01,010 INFO L290 TraceCheckUtils]: 95: Hoare triple {64738#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64739#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:01,010 INFO L290 TraceCheckUtils]: 96: Hoare triple {64739#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64739#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:01,010 INFO L290 TraceCheckUtils]: 97: Hoare triple {64739#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64740#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:01,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {64740#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64740#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:01,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {64740#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64741#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:01,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {64741#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64741#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:01,011 INFO L290 TraceCheckUtils]: 101: Hoare triple {64741#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64742#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:01,012 INFO L290 TraceCheckUtils]: 102: Hoare triple {64742#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64742#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:01,012 INFO L290 TraceCheckUtils]: 103: Hoare triple {64742#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64743#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:01,012 INFO L290 TraceCheckUtils]: 104: Hoare triple {64743#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64743#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:01,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {64743#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64744#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:01,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {64744#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64744#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:01,013 INFO L290 TraceCheckUtils]: 107: Hoare triple {64744#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64745#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:01,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {64745#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64745#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:01,014 INFO L290 TraceCheckUtils]: 109: Hoare triple {64745#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64746#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:01,014 INFO L290 TraceCheckUtils]: 110: Hoare triple {64746#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64746#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:01,014 INFO L290 TraceCheckUtils]: 111: Hoare triple {64746#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64747#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:01,014 INFO L290 TraceCheckUtils]: 112: Hoare triple {64747#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64747#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:01,015 INFO L290 TraceCheckUtils]: 113: Hoare triple {64747#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64748#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:01,015 INFO L290 TraceCheckUtils]: 114: Hoare triple {64748#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64748#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:01,015 INFO L290 TraceCheckUtils]: 115: Hoare triple {64748#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64749#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:01,016 INFO L290 TraceCheckUtils]: 116: Hoare triple {64749#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64749#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:01,016 INFO L290 TraceCheckUtils]: 117: Hoare triple {64749#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64750#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:01,016 INFO L290 TraceCheckUtils]: 118: Hoare triple {64750#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64750#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:01,016 INFO L290 TraceCheckUtils]: 119: Hoare triple {64750#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64751#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:01,017 INFO L290 TraceCheckUtils]: 120: Hoare triple {64751#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64751#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:01,017 INFO L290 TraceCheckUtils]: 121: Hoare triple {64751#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64752#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:01,017 INFO L290 TraceCheckUtils]: 122: Hoare triple {64752#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64752#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:01,018 INFO L290 TraceCheckUtils]: 123: Hoare triple {64752#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64753#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:01,018 INFO L290 TraceCheckUtils]: 124: Hoare triple {64753#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64753#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:01,018 INFO L290 TraceCheckUtils]: 125: Hoare triple {64753#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64754#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:01,018 INFO L290 TraceCheckUtils]: 126: Hoare triple {64754#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64754#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:01,019 INFO L290 TraceCheckUtils]: 127: Hoare triple {64754#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64755#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:01,019 INFO L290 TraceCheckUtils]: 128: Hoare triple {64755#(<= main_~i~0 61)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {64755#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:01,019 INFO L290 TraceCheckUtils]: 129: Hoare triple {64755#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64756#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:01,020 INFO L290 TraceCheckUtils]: 130: Hoare triple {64756#(<= main_~i~0 62)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L290 TraceCheckUtils]: 131: Hoare triple {64690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L272 TraceCheckUtils]: 132: Hoare triple {64690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-28 03:06:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:01,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:04,988 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-28 03:06:04,988 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-28 03:06:04,988 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-28 03:06:04,988 INFO L272 TraceCheckUtils]: 132: Hoare triple {64690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {64690#false} is VALID [2022-04-28 03:06:04,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {64690#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {64690#false} is VALID [2022-04-28 03:06:04,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {65182#(< main_~i~0 2048)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-28 03:06:04,989 INFO L290 TraceCheckUtils]: 129: Hoare triple {65186#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65182#(< main_~i~0 2048)} is VALID [2022-04-28 03:06:04,989 INFO L290 TraceCheckUtils]: 128: Hoare triple {65186#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65186#(< main_~i~0 2047)} is VALID [2022-04-28 03:06:04,989 INFO L290 TraceCheckUtils]: 127: Hoare triple {65193#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65186#(< main_~i~0 2047)} is VALID [2022-04-28 03:06:04,990 INFO L290 TraceCheckUtils]: 126: Hoare triple {65193#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65193#(< main_~i~0 2046)} is VALID [2022-04-28 03:06:04,990 INFO L290 TraceCheckUtils]: 125: Hoare triple {65200#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65193#(< main_~i~0 2046)} is VALID [2022-04-28 03:06:04,990 INFO L290 TraceCheckUtils]: 124: Hoare triple {65200#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65200#(< main_~i~0 2045)} is VALID [2022-04-28 03:06:04,991 INFO L290 TraceCheckUtils]: 123: Hoare triple {65207#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65200#(< main_~i~0 2045)} is VALID [2022-04-28 03:06:04,991 INFO L290 TraceCheckUtils]: 122: Hoare triple {65207#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65207#(< main_~i~0 2044)} is VALID [2022-04-28 03:06:04,991 INFO L290 TraceCheckUtils]: 121: Hoare triple {65214#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65207#(< main_~i~0 2044)} is VALID [2022-04-28 03:06:04,991 INFO L290 TraceCheckUtils]: 120: Hoare triple {65214#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65214#(< main_~i~0 2043)} is VALID [2022-04-28 03:06:04,992 INFO L290 TraceCheckUtils]: 119: Hoare triple {65221#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65214#(< main_~i~0 2043)} is VALID [2022-04-28 03:06:04,992 INFO L290 TraceCheckUtils]: 118: Hoare triple {65221#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65221#(< main_~i~0 2042)} is VALID [2022-04-28 03:06:04,992 INFO L290 TraceCheckUtils]: 117: Hoare triple {65228#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65221#(< main_~i~0 2042)} is VALID [2022-04-28 03:06:04,993 INFO L290 TraceCheckUtils]: 116: Hoare triple {65228#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65228#(< main_~i~0 2041)} is VALID [2022-04-28 03:06:04,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {65235#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65228#(< main_~i~0 2041)} is VALID [2022-04-28 03:06:04,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {65235#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65235#(< main_~i~0 2040)} is VALID [2022-04-28 03:06:04,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {65242#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65235#(< main_~i~0 2040)} is VALID [2022-04-28 03:06:04,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {65242#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65242#(< main_~i~0 2039)} is VALID [2022-04-28 03:06:04,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {65249#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65242#(< main_~i~0 2039)} is VALID [2022-04-28 03:06:04,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {65249#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65249#(< main_~i~0 2038)} is VALID [2022-04-28 03:06:04,995 INFO L290 TraceCheckUtils]: 109: Hoare triple {65256#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65249#(< main_~i~0 2038)} is VALID [2022-04-28 03:06:04,995 INFO L290 TraceCheckUtils]: 108: Hoare triple {65256#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65256#(< main_~i~0 2037)} is VALID [2022-04-28 03:06:04,995 INFO L290 TraceCheckUtils]: 107: Hoare triple {65263#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65256#(< main_~i~0 2037)} is VALID [2022-04-28 03:06:04,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {65263#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65263#(< main_~i~0 2036)} is VALID [2022-04-28 03:06:04,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {65270#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65263#(< main_~i~0 2036)} is VALID [2022-04-28 03:06:04,996 INFO L290 TraceCheckUtils]: 104: Hoare triple {65270#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65270#(< main_~i~0 2035)} is VALID [2022-04-28 03:06:04,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {65277#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65270#(< main_~i~0 2035)} is VALID [2022-04-28 03:06:04,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {65277#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65277#(< main_~i~0 2034)} is VALID [2022-04-28 03:06:04,997 INFO L290 TraceCheckUtils]: 101: Hoare triple {65284#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65277#(< main_~i~0 2034)} is VALID [2022-04-28 03:06:04,997 INFO L290 TraceCheckUtils]: 100: Hoare triple {65284#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65284#(< main_~i~0 2033)} is VALID [2022-04-28 03:06:04,997 INFO L290 TraceCheckUtils]: 99: Hoare triple {65291#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65284#(< main_~i~0 2033)} is VALID [2022-04-28 03:06:04,998 INFO L290 TraceCheckUtils]: 98: Hoare triple {65291#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65291#(< main_~i~0 2032)} is VALID [2022-04-28 03:06:04,998 INFO L290 TraceCheckUtils]: 97: Hoare triple {65298#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65291#(< main_~i~0 2032)} is VALID [2022-04-28 03:06:04,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {65298#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65298#(< main_~i~0 2031)} is VALID [2022-04-28 03:06:04,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {65305#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65298#(< main_~i~0 2031)} is VALID [2022-04-28 03:06:04,999 INFO L290 TraceCheckUtils]: 94: Hoare triple {65305#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65305#(< main_~i~0 2030)} is VALID [2022-04-28 03:06:04,999 INFO L290 TraceCheckUtils]: 93: Hoare triple {65312#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65305#(< main_~i~0 2030)} is VALID [2022-04-28 03:06:04,999 INFO L290 TraceCheckUtils]: 92: Hoare triple {65312#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65312#(< main_~i~0 2029)} is VALID [2022-04-28 03:06:05,000 INFO L290 TraceCheckUtils]: 91: Hoare triple {65319#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65312#(< main_~i~0 2029)} is VALID [2022-04-28 03:06:05,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {65319#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65319#(< main_~i~0 2028)} is VALID [2022-04-28 03:06:05,000 INFO L290 TraceCheckUtils]: 89: Hoare triple {65326#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65319#(< main_~i~0 2028)} is VALID [2022-04-28 03:06:05,000 INFO L290 TraceCheckUtils]: 88: Hoare triple {65326#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65326#(< main_~i~0 2027)} is VALID [2022-04-28 03:06:05,001 INFO L290 TraceCheckUtils]: 87: Hoare triple {65333#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65326#(< main_~i~0 2027)} is VALID [2022-04-28 03:06:05,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {65333#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65333#(< main_~i~0 2026)} is VALID [2022-04-28 03:06:05,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {65340#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65333#(< main_~i~0 2026)} is VALID [2022-04-28 03:06:05,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {65340#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65340#(< main_~i~0 2025)} is VALID [2022-04-28 03:06:05,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {65347#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65340#(< main_~i~0 2025)} is VALID [2022-04-28 03:06:05,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {65347#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65347#(< main_~i~0 2024)} is VALID [2022-04-28 03:06:05,002 INFO L290 TraceCheckUtils]: 81: Hoare triple {65354#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65347#(< main_~i~0 2024)} is VALID [2022-04-28 03:06:05,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {65354#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65354#(< main_~i~0 2023)} is VALID [2022-04-28 03:06:05,003 INFO L290 TraceCheckUtils]: 79: Hoare triple {65361#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65354#(< main_~i~0 2023)} is VALID [2022-04-28 03:06:05,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {65361#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65361#(< main_~i~0 2022)} is VALID [2022-04-28 03:06:05,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {65368#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65361#(< main_~i~0 2022)} is VALID [2022-04-28 03:06:05,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {65368#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65368#(< main_~i~0 2021)} is VALID [2022-04-28 03:06:05,004 INFO L290 TraceCheckUtils]: 75: Hoare triple {65375#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65368#(< main_~i~0 2021)} is VALID [2022-04-28 03:06:05,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {65375#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65375#(< main_~i~0 2020)} is VALID [2022-04-28 03:06:05,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {65382#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65375#(< main_~i~0 2020)} is VALID [2022-04-28 03:06:05,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {65382#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65382#(< main_~i~0 2019)} is VALID [2022-04-28 03:06:05,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {65389#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65382#(< main_~i~0 2019)} is VALID [2022-04-28 03:06:05,005 INFO L290 TraceCheckUtils]: 70: Hoare triple {65389#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65389#(< main_~i~0 2018)} is VALID [2022-04-28 03:06:05,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {65396#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65389#(< main_~i~0 2018)} is VALID [2022-04-28 03:06:05,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {65396#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65396#(< main_~i~0 2017)} is VALID [2022-04-28 03:06:05,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {65403#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65396#(< main_~i~0 2017)} is VALID [2022-04-28 03:06:05,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {65403#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65403#(< main_~i~0 2016)} is VALID [2022-04-28 03:06:05,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {65410#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65403#(< main_~i~0 2016)} is VALID [2022-04-28 03:06:05,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {65410#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65410#(< main_~i~0 2015)} is VALID [2022-04-28 03:06:05,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {65417#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65410#(< main_~i~0 2015)} is VALID [2022-04-28 03:06:05,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {65417#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65417#(< main_~i~0 2014)} is VALID [2022-04-28 03:06:05,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {65424#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65417#(< main_~i~0 2014)} is VALID [2022-04-28 03:06:05,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {65424#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65424#(< main_~i~0 2013)} is VALID [2022-04-28 03:06:05,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {65431#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65424#(< main_~i~0 2013)} is VALID [2022-04-28 03:06:05,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {65431#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65431#(< main_~i~0 2012)} is VALID [2022-04-28 03:06:05,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {65438#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65431#(< main_~i~0 2012)} is VALID [2022-04-28 03:06:05,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {65438#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65438#(< main_~i~0 2011)} is VALID [2022-04-28 03:06:05,010 INFO L290 TraceCheckUtils]: 55: Hoare triple {65445#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65438#(< main_~i~0 2011)} is VALID [2022-04-28 03:06:05,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {65445#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65445#(< main_~i~0 2010)} is VALID [2022-04-28 03:06:05,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {65452#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65445#(< main_~i~0 2010)} is VALID [2022-04-28 03:06:05,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {65452#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65452#(< main_~i~0 2009)} is VALID [2022-04-28 03:06:05,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {65459#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65452#(< main_~i~0 2009)} is VALID [2022-04-28 03:06:05,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {65459#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65459#(< main_~i~0 2008)} is VALID [2022-04-28 03:06:05,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {65466#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65459#(< main_~i~0 2008)} is VALID [2022-04-28 03:06:05,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {65466#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65466#(< main_~i~0 2007)} is VALID [2022-04-28 03:06:05,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {65473#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65466#(< main_~i~0 2007)} is VALID [2022-04-28 03:06:05,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {65473#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65473#(< main_~i~0 2006)} is VALID [2022-04-28 03:06:05,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {65480#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65473#(< main_~i~0 2006)} is VALID [2022-04-28 03:06:05,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {65480#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65480#(< main_~i~0 2005)} is VALID [2022-04-28 03:06:05,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {65487#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65480#(< main_~i~0 2005)} is VALID [2022-04-28 03:06:05,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {65487#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65487#(< main_~i~0 2004)} is VALID [2022-04-28 03:06:05,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {65494#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65487#(< main_~i~0 2004)} is VALID [2022-04-28 03:06:05,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {65494#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65494#(< main_~i~0 2003)} is VALID [2022-04-28 03:06:05,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {65501#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65494#(< main_~i~0 2003)} is VALID [2022-04-28 03:06:05,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {65501#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65501#(< main_~i~0 2002)} is VALID [2022-04-28 03:06:05,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {65508#(< main_~i~0 2001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65501#(< main_~i~0 2002)} is VALID [2022-04-28 03:06:05,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {65508#(< main_~i~0 2001)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65508#(< main_~i~0 2001)} is VALID [2022-04-28 03:06:05,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {65515#(< main_~i~0 2000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65508#(< main_~i~0 2001)} is VALID [2022-04-28 03:06:05,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {65515#(< main_~i~0 2000)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65515#(< main_~i~0 2000)} is VALID [2022-04-28 03:06:05,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {65522#(< main_~i~0 1999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65515#(< main_~i~0 2000)} is VALID [2022-04-28 03:06:05,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {65522#(< main_~i~0 1999)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65522#(< main_~i~0 1999)} is VALID [2022-04-28 03:06:05,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {65529#(< main_~i~0 1998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65522#(< main_~i~0 1999)} is VALID [2022-04-28 03:06:05,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {65529#(< main_~i~0 1998)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65529#(< main_~i~0 1998)} is VALID [2022-04-28 03:06:05,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {65536#(< main_~i~0 1997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65529#(< main_~i~0 1998)} is VALID [2022-04-28 03:06:05,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {65536#(< main_~i~0 1997)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65536#(< main_~i~0 1997)} is VALID [2022-04-28 03:06:05,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {65543#(< main_~i~0 1996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65536#(< main_~i~0 1997)} is VALID [2022-04-28 03:06:05,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {65543#(< main_~i~0 1996)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65543#(< main_~i~0 1996)} is VALID [2022-04-28 03:06:05,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {65550#(< main_~i~0 1995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65543#(< main_~i~0 1996)} is VALID [2022-04-28 03:06:05,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {65550#(< main_~i~0 1995)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65550#(< main_~i~0 1995)} is VALID [2022-04-28 03:06:05,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {65557#(< main_~i~0 1994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65550#(< main_~i~0 1995)} is VALID [2022-04-28 03:06:05,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {65557#(< main_~i~0 1994)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65557#(< main_~i~0 1994)} is VALID [2022-04-28 03:06:05,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {65564#(< main_~i~0 1993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65557#(< main_~i~0 1994)} is VALID [2022-04-28 03:06:05,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {65564#(< main_~i~0 1993)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65564#(< main_~i~0 1993)} is VALID [2022-04-28 03:06:05,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {65571#(< main_~i~0 1992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65564#(< main_~i~0 1993)} is VALID [2022-04-28 03:06:05,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {65571#(< main_~i~0 1992)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65571#(< main_~i~0 1992)} is VALID [2022-04-28 03:06:05,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {65578#(< main_~i~0 1991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65571#(< main_~i~0 1992)} is VALID [2022-04-28 03:06:05,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {65578#(< main_~i~0 1991)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65578#(< main_~i~0 1991)} is VALID [2022-04-28 03:06:05,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {65585#(< main_~i~0 1990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65578#(< main_~i~0 1991)} is VALID [2022-04-28 03:06:05,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {65585#(< main_~i~0 1990)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65585#(< main_~i~0 1990)} is VALID [2022-04-28 03:06:05,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {65592#(< main_~i~0 1989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65585#(< main_~i~0 1990)} is VALID [2022-04-28 03:06:05,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {65592#(< main_~i~0 1989)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65592#(< main_~i~0 1989)} is VALID [2022-04-28 03:06:05,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {65599#(< main_~i~0 1988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65592#(< main_~i~0 1989)} is VALID [2022-04-28 03:06:05,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {65599#(< main_~i~0 1988)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65599#(< main_~i~0 1988)} is VALID [2022-04-28 03:06:05,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {65606#(< main_~i~0 1987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65599#(< main_~i~0 1988)} is VALID [2022-04-28 03:06:05,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {65606#(< main_~i~0 1987)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65606#(< main_~i~0 1987)} is VALID [2022-04-28 03:06:05,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {65613#(< main_~i~0 1986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65606#(< main_~i~0 1987)} is VALID [2022-04-28 03:06:05,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {65613#(< main_~i~0 1986)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {65613#(< main_~i~0 1986)} is VALID [2022-04-28 03:06:05,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {64689#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {65613#(< main_~i~0 1986)} is VALID [2022-04-28 03:06:05,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-28 03:06:05,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-28 03:06:05,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-28 03:06:05,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {64689#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(12, 2); {64689#true} is VALID [2022-04-28 03:06:05,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {64689#true} call ULTIMATE.init(); {64689#true} is VALID [2022-04-28 03:06:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:05,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488888881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:05,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:05,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 130 [2022-04-28 03:06:05,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:05,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306190058] [2022-04-28 03:06:05,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306190058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:05,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:05,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:06:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356416359] [2022-04-28 03:06:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-28 03:06:05,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:05,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:05,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:05,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:06:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:05,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:06:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8258, Invalid=8512, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:06:05,107 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:07,791 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2022-04-28 03:06:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 03:06:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2022-04-28 03:06:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 146 transitions. [2022-04-28 03:06:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 146 transitions. [2022-04-28 03:06:07,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 146 transitions. [2022-04-28 03:06:07,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:07,902 INFO L225 Difference]: With dead ends: 146 [2022-04-28 03:06:07,902 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 03:06:07,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16386, Invalid=20670, Unknown=0, NotChecked=0, Total=37056 [2022-04-28 03:06:07,905 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 134 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:07,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 44 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:06:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 03:06:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-28 03:06:08,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:08,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,671 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,671 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:08,672 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-28 03:06:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2022-04-28 03:06:08,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:08,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:08,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-28 03:06:08,673 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-28 03:06:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:08,674 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-28 03:06:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2022-04-28 03:06:08,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:08,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:08,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:08,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2022-04-28 03:06:08,675 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2022-04-28 03:06:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:08,675 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2022-04-28 03:06:08,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0) internal successors, (132), 65 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 139 transitions. [2022-04-28 03:06:08,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2022-04-28 03:06:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 03:06:08,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:08,860 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:08,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-28 03:06:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:09,061 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1908563352, now seen corresponding path program 125 times [2022-04-28 03:06:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:09,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745193376] [2022-04-28 03:06:09,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:06:09,063 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:06:09,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:06:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1908563352, now seen corresponding path program 126 times [2022-04-28 03:06:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975066775] [2022-04-28 03:06:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:10,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {66682#(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(12, 2); {66613#true} is VALID [2022-04-28 03:06:10,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {66613#true} assume true; {66613#true} is VALID [2022-04-28 03:06:10,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66613#true} {66613#true} #44#return; {66613#true} is VALID [2022-04-28 03:06:10,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {66613#true} call ULTIMATE.init(); {66682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:10,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {66682#(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(12, 2); {66613#true} is VALID [2022-04-28 03:06:10,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {66613#true} assume true; {66613#true} is VALID [2022-04-28 03:06:10,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66613#true} {66613#true} #44#return; {66613#true} is VALID [2022-04-28 03:06:10,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {66613#true} call #t~ret5 := main(); {66613#true} is VALID [2022-04-28 03:06:10,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {66613#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {66618#(= main_~i~0 0)} is VALID [2022-04-28 03:06:10,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {66618#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66618#(= main_~i~0 0)} is VALID [2022-04-28 03:06:10,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {66618#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66619#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:10,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {66619#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66619#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:10,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {66619#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66620#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:10,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {66620#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66620#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:10,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {66620#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66621#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:10,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {66621#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66621#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:10,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {66621#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66622#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:10,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {66622#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66622#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:10,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {66622#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66623#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:10,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {66623#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66623#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:10,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {66623#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66624#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:10,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {66624#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66624#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:10,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {66624#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66625#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:10,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {66625#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66625#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:10,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {66625#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66626#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:10,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {66626#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66626#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:10,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {66626#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66627#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:10,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {66627#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66627#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:10,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {66627#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66628#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:10,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {66628#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66628#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:10,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {66628#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66629#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:10,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {66629#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66629#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:10,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {66629#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66630#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:10,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {66630#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66630#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:10,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {66630#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66631#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:10,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {66631#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66631#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:10,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {66631#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66632#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:10,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {66632#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66632#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:10,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {66632#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66633#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:10,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {66633#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66633#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:10,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {66633#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66634#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:10,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {66634#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66634#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:10,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {66634#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66635#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:10,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {66635#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66635#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:10,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {66635#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66636#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:10,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {66636#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66636#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:10,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {66636#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66637#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:10,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {66637#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66637#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:10,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {66637#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66638#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:10,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {66638#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66638#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:10,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {66638#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66639#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:10,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {66639#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66639#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:10,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {66639#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66640#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:10,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {66640#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66640#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:10,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {66640#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66641#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:10,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {66641#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66641#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:10,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {66641#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66642#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:10,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {66642#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66642#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:10,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {66642#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66643#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:10,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {66643#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66643#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:10,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {66643#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66644#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:10,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {66644#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66644#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:10,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {66644#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66645#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:10,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {66645#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66645#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:10,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {66645#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66646#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:10,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {66646#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66646#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:10,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {66646#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66647#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:10,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {66647#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66647#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:10,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {66647#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66648#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:10,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {66648#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66648#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:10,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {66648#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66649#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:10,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {66649#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66649#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:10,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {66649#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66650#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:10,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {66650#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66650#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:10,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {66650#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66651#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:10,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {66651#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66651#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:10,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {66651#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66652#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:10,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {66652#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66652#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:10,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {66652#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66653#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:10,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {66653#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66653#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:10,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {66653#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66654#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:10,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {66654#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66654#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:10,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {66654#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66655#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:10,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {66655#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66655#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:10,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {66655#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66656#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:10,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {66656#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66656#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:10,447 INFO L290 TraceCheckUtils]: 83: Hoare triple {66656#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66657#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:10,447 INFO L290 TraceCheckUtils]: 84: Hoare triple {66657#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66657#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:10,447 INFO L290 TraceCheckUtils]: 85: Hoare triple {66657#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66658#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:10,448 INFO L290 TraceCheckUtils]: 86: Hoare triple {66658#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66658#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:10,448 INFO L290 TraceCheckUtils]: 87: Hoare triple {66658#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66659#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:10,448 INFO L290 TraceCheckUtils]: 88: Hoare triple {66659#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66659#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:10,448 INFO L290 TraceCheckUtils]: 89: Hoare triple {66659#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66660#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:10,449 INFO L290 TraceCheckUtils]: 90: Hoare triple {66660#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66660#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:10,449 INFO L290 TraceCheckUtils]: 91: Hoare triple {66660#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66661#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:10,449 INFO L290 TraceCheckUtils]: 92: Hoare triple {66661#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66661#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:10,450 INFO L290 TraceCheckUtils]: 93: Hoare triple {66661#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66662#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:10,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {66662#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66662#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:10,450 INFO L290 TraceCheckUtils]: 95: Hoare triple {66662#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66663#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:10,450 INFO L290 TraceCheckUtils]: 96: Hoare triple {66663#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66663#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:10,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {66663#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66664#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:10,451 INFO L290 TraceCheckUtils]: 98: Hoare triple {66664#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66664#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:10,451 INFO L290 TraceCheckUtils]: 99: Hoare triple {66664#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66665#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:10,452 INFO L290 TraceCheckUtils]: 100: Hoare triple {66665#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66665#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:10,452 INFO L290 TraceCheckUtils]: 101: Hoare triple {66665#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66666#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:10,452 INFO L290 TraceCheckUtils]: 102: Hoare triple {66666#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66666#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:10,452 INFO L290 TraceCheckUtils]: 103: Hoare triple {66666#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66667#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:10,453 INFO L290 TraceCheckUtils]: 104: Hoare triple {66667#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66667#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:10,453 INFO L290 TraceCheckUtils]: 105: Hoare triple {66667#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66668#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:10,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {66668#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66668#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:10,454 INFO L290 TraceCheckUtils]: 107: Hoare triple {66668#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66669#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:10,454 INFO L290 TraceCheckUtils]: 108: Hoare triple {66669#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66669#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:10,454 INFO L290 TraceCheckUtils]: 109: Hoare triple {66669#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66670#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:10,454 INFO L290 TraceCheckUtils]: 110: Hoare triple {66670#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66670#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:10,455 INFO L290 TraceCheckUtils]: 111: Hoare triple {66670#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66671#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:10,455 INFO L290 TraceCheckUtils]: 112: Hoare triple {66671#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66671#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:10,455 INFO L290 TraceCheckUtils]: 113: Hoare triple {66671#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66672#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:10,455 INFO L290 TraceCheckUtils]: 114: Hoare triple {66672#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66672#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:10,456 INFO L290 TraceCheckUtils]: 115: Hoare triple {66672#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66673#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:10,456 INFO L290 TraceCheckUtils]: 116: Hoare triple {66673#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66673#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:10,456 INFO L290 TraceCheckUtils]: 117: Hoare triple {66673#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66674#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:10,457 INFO L290 TraceCheckUtils]: 118: Hoare triple {66674#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66674#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:10,457 INFO L290 TraceCheckUtils]: 119: Hoare triple {66674#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66675#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:10,457 INFO L290 TraceCheckUtils]: 120: Hoare triple {66675#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66675#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:10,457 INFO L290 TraceCheckUtils]: 121: Hoare triple {66675#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66676#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:10,458 INFO L290 TraceCheckUtils]: 122: Hoare triple {66676#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66676#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:10,458 INFO L290 TraceCheckUtils]: 123: Hoare triple {66676#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66677#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:10,458 INFO L290 TraceCheckUtils]: 124: Hoare triple {66677#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66677#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:10,459 INFO L290 TraceCheckUtils]: 125: Hoare triple {66677#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66678#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:10,459 INFO L290 TraceCheckUtils]: 126: Hoare triple {66678#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66678#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:10,459 INFO L290 TraceCheckUtils]: 127: Hoare triple {66678#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66679#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:10,459 INFO L290 TraceCheckUtils]: 128: Hoare triple {66679#(<= main_~i~0 61)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66679#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:10,460 INFO L290 TraceCheckUtils]: 129: Hoare triple {66679#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66680#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:10,460 INFO L290 TraceCheckUtils]: 130: Hoare triple {66680#(<= main_~i~0 62)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {66680#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:10,460 INFO L290 TraceCheckUtils]: 131: Hoare triple {66680#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66681#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:10,460 INFO L290 TraceCheckUtils]: 132: Hoare triple {66681#(<= main_~i~0 63)} assume !(~i~0 < 2048); {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L290 TraceCheckUtils]: 133: Hoare triple {66614#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L272 TraceCheckUtils]: 134: Hoare triple {66614#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L290 TraceCheckUtils]: 135: Hoare triple {66614#false} ~cond := #in~cond; {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L290 TraceCheckUtils]: 136: Hoare triple {66614#false} assume 0 == ~cond; {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L290 TraceCheckUtils]: 137: Hoare triple {66614#false} assume !false; {66614#false} is VALID [2022-04-28 03:06:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:10,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975066775] [2022-04-28 03:06:10,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975066775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:10,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075206689] [2022-04-28 03:06:10,462 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:10,462 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:06:10,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process