/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-1-simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:53:29,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:53:29,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:53:29,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:53:29,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:53:29,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:53:29,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:53:29,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:53:29,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:53:29,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:53:29,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:53:29,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:53:29,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:53:29,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:53:29,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:53:29,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:53:29,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:53:29,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:53:29,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:53:29,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:53:29,897 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:53:29,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:53:29,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:53:29,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:53:29,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:53:29,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:53:29,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:53:29,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:53:29,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:53:29,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:53:29,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:53:29,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:53:29,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:53:29,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:53:29,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:53:29,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:53:29,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:53:29,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:53:29,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:53:29,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:53:29,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:53:29,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:53:29,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:53:29,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:53:29,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:53:29,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:53:29,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:53:29,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:53:29,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:53:29,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:53:29,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:53:29,936 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:53:29,937 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:53:30,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:53:30,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:53:30,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:53:30,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:53:30,206 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:53:30,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-1-simple.i [2022-04-15 05:53:30,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb637d599/172afb291423433c961c5898173ac24c/FLAG7096cf7af [2022-04-15 05:53:30,665 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:53:30,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-1-simple.i [2022-04-15 05:53:30,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb637d599/172afb291423433c961c5898173ac24c/FLAG7096cf7af [2022-04-15 05:53:31,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb637d599/172afb291423433c961c5898173ac24c [2022-04-15 05:53:31,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:53:31,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:53:31,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:53:31,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:53:31,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:53:31,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47383d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31, skipping insertion in model container [2022-04-15 05:53:31,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:53:31,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:53:31,283 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-1-simple.i[809,822] [2022-04-15 05:53:31,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:53:31,328 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:53:31,342 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-1-simple.i[809,822] [2022-04-15 05:53:31,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:53:31,367 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:53:31,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31 WrapperNode [2022-04-15 05:53:31,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:53:31,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:53:31,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:53:31,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:53:31,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:53:31,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:53:31,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:53:31,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:53:31,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (1/1) ... [2022-04-15 05:53:31,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:53:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:31,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:53:31,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:53:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:53:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:53:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:53:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:53:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:53:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:53:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:53:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:53:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:53:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:53:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:53:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:53:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:53:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:53:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:53:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:53:31,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:53:31,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:53:31,765 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:53:31,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:53:31,772 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:53:31,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:31 BoogieIcfgContainer [2022-04-15 05:53:31,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:53:31,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:53:31,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:53:31,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:53:31,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:53:31" (1/3) ... [2022-04-15 05:53:31,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dda4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:31, skipping insertion in model container [2022-04-15 05:53:31,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:31" (2/3) ... [2022-04-15 05:53:31,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dda4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:31, skipping insertion in model container [2022-04-15 05:53:31,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:31" (3/3) ... [2022-04-15 05:53:31,781 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-1-simple.i [2022-04-15 05:53:31,786 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:53:31,786 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:53:31,825 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:53:31,830 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:53:31,831 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:53:31,853 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-15 05:53:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:53:31,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:31,860 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:31,861 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -445681932, now seen corresponding path program 1 times [2022-04-15 05:53:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328847070] [2022-04-15 05:53:31,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:53:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -445681932, now seen corresponding path program 2 times [2022-04-15 05:53:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835479701] [2022-04-15 05:53:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,150 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-15 05:53:32,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 05:53:32,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-15 05:53:32,153 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-15 05:53:32,154 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-15 05:53:32,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 05:53:32,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-15 05:53:32,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-15 05:53:32,155 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-15 05:53:32,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 05:53:32,157 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-15 05:53:32,157 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-15 05:53:32,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 05:53:32,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 05:53:32,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 05:53:32,158 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-15 05:53:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:32,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835479701] [2022-04-15 05:53:32,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835479701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:32,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:32,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:53:32,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328847070] [2022-04-15 05:53:32,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328847070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:32,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:32,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:53:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811989984] [2022-04-15 05:53:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:32,171 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-15 05:53:32,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:32,175 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-15 05:53:32,199 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-15 05:53:32,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:53:32,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:53:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:53:32,224 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-15 05:53:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,328 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 05:53:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:53:32,329 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-15 05:53:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:32,332 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-15 05:53:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 05:53:32,342 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-15 05:53:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 05:53:32,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 05:53:32,418 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-15 05:53:32,425 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:53:32,426 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 05:53:32,428 INFO L912 BasicCegarLoop]: 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-15 05:53:32,431 INFO L913 BasicCegarLoop]: 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-15 05:53:32,432 INFO L914 BasicCegarLoop]: 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-15 05:53:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 05:53:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 05:53:32,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:32,464 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-15 05:53:32,465 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-15 05:53:32,465 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-15 05:53:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,470 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 05:53:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:53:32,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:32,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:32,471 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-15 05:53:32,472 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-15 05:53:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,475 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 05:53:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:53:32,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:32,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:32,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:32,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:32,476 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-15 05:53:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 05:53:32,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 05:53:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:32,481 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 05:53:32,483 INFO L479 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-15 05:53:32,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 05:53:32,513 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-15 05:53:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:53:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:53:32,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:32,514 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:32,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:53:32,515 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -617456838, now seen corresponding path program 1 times [2022-04-15 05:53:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:32,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118222983] [2022-04-15 05:53:32,519 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:53:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash -617456838, now seen corresponding path program 2 times [2022-04-15 05:53:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:32,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970485606] [2022-04-15 05:53:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,599 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-15 05:53:32,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 05:53:32,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #44#return; {156#true} is VALID [2022-04-15 05:53:32,600 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-15 05:53:32,600 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-15 05:53:32,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 05:53:32,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #44#return; {156#true} is VALID [2022-04-15 05:53:32,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret5 := main(); {156#true} is VALID [2022-04-15 05:53:32,601 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-15 05:53:32,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~i~0 0)} assume !(~i~0 < 2048); {157#false} is VALID [2022-04-15 05:53:32,602 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-15 05:53:32,603 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-15 05:53:32,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 05:53:32,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 05:53:32,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 05:53:32,603 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-15 05:53:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:32,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970485606] [2022-04-15 05:53:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970485606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:32,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:32,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:53:32,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:32,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118222983] [2022-04-15 05:53:32,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118222983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:32,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:32,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:53:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111668580] [2022-04-15 05:53:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:32,619 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-15 05:53:32,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:32,620 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-15 05:53:32,632 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-15 05:53:32,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:53:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:53:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:53:32,633 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-15 05:53:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,686 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:53:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:53:32,687 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-15 05:53:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:32,687 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-15 05:53:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 05:53:32,689 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-15 05:53:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 05:53:32,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-15 05:53:32,712 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-15 05:53:32,713 INFO L225 Difference]: With dead ends: 22 [2022-04-15 05:53:32,714 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 05:53:32,714 INFO L912 BasicCegarLoop]: 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-15 05:53:32,715 INFO L913 BasicCegarLoop]: 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-15 05:53:32,716 INFO L914 BasicCegarLoop]: 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-15 05:53:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 05:53:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 05:53:32,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:32,721 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-15 05:53:32,721 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-15 05:53:32,721 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-15 05:53:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,723 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:53:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:53:32,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:32,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:32,723 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-15 05:53:32,724 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-15 05:53:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:32,725 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:53:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:53:32,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:32,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:32,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:32,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:32,726 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-15 05:53:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 05:53:32,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 05:53:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:32,728 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 05:53:32,728 INFO L479 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-15 05:53:32,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 05:53:32,744 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-15 05:53:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 05:53:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:53:32,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:32,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:32,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:53:32,746 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1544621860, now seen corresponding path program 1 times [2022-04-15 05:53:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:32,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123167919] [2022-04-15 05:53:32,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:32,764 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:32,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1544621860, now seen corresponding path program 2 times [2022-04-15 05:53:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:32,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026191527] [2022-04-15 05:53:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,858 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-15 05:53:32,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 05:53:32,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-15 05:53:32,859 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-15 05:53:32,860 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-15 05:53:32,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 05:53:32,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-15 05:53:32,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-15 05:53:32,861 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-15 05:53:32,862 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-15 05:53:32,862 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-15 05:53:32,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(<= main_~i~0 1)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-15 05:53:32,863 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-15 05:53:32,863 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-15 05:53:32,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-15 05:53:32,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-15 05:53:32,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 05:53:32,864 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-15 05:53:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026191527] [2022-04-15 05:53:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026191527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94043094] [2022-04-15 05:53:32,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:32,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:32,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:53:32,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:32,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:32,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:53:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:32,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:33,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-15 05:53:33,053 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-15 05:53:33,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 05:53:33,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-15 05:53:33,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-15 05:53:33,064 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-15 05:53:33,065 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-15 05:53:33,067 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-15 05:53:33,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(<= main_~i~0 1)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-15 05:53:33,068 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-15 05:53:33,068 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-15 05:53:33,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-15 05:53:33,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-15 05:53:33,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 05:53:33,069 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-15 05:53:33,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:33,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 05:53:33,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2022-04-15 05:53:33,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2022-04-15 05:53:33,171 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-15 05:53:33,171 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-15 05:53:33,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#(< main_~i~0 2048)} assume !(~i~0 < 2048); {274#false} is VALID [2022-04-15 05:53:33,172 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-15 05:53:33,173 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-15 05:53:33,174 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-15 05:53:33,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret5 := main(); {273#true} is VALID [2022-04-15 05:53:33,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2022-04-15 05:53:33,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 05:53:33,175 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-15 05:53:33,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-15 05:53:33,175 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-15 05:53:33,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94043094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:33,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:33,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:53:33,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123167919] [2022-04-15 05:53:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123167919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:33,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:53:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943718398] [2022-04-15 05:53:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:33,178 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-15 05:53:33,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:33,179 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-15 05:53:33,193 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-15 05:53:33,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:53:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:53:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:53:33,195 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-15 05:53:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:33,301 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:53:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:53:33,301 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-15 05:53:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:33,302 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-15 05:53:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 05:53:33,304 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-15 05:53:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 05:53:33,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 05:53:33,329 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-15 05:53:33,330 INFO L225 Difference]: With dead ends: 24 [2022-04-15 05:53:33,330 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 05:53:33,330 INFO L912 BasicCegarLoop]: 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-15 05:53:33,333 INFO L913 BasicCegarLoop]: 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-15 05:53:33,338 INFO L914 BasicCegarLoop]: 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-15 05:53:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 05:53:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 05:53:33,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:33,345 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-15 05:53:33,345 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-15 05:53:33,345 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-15 05:53:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:33,349 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:53:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:53:33,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:33,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:33,351 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-15 05:53:33,354 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-15 05:53:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:33,357 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:53:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:53:33,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:33,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:33,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:33,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:33,360 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-15 05:53:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 05:53:33,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-15 05:53:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:33,361 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 05:53:33,361 INFO L479 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-15 05:53:33,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 05:53:33,380 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-15 05:53:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 05:53:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:53:33,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:33,381 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:33,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:33,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:33,600 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash 802989566, now seen corresponding path program 3 times [2022-04-15 05:53:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:33,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417924642] [2022-04-15 05:53:33,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:33,604 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:33,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 802989566, now seen corresponding path program 4 times [2022-04-15 05:53:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:33,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446080963] [2022-04-15 05:53:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:33,673 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-15 05:53:33,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-15 05:53:33,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-15 05:53:33,675 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-15 05:53:33,675 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-15 05:53:33,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-15 05:53:33,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-15 05:53:33,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-15 05:53:33,676 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-15 05:53:33,676 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-15 05:53:33,677 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-15 05:53:33,677 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-15 05:53:33,678 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-15 05:53:33,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= main_~i~0 2)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-15 05:53:33,679 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-15 05:53:33,679 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-15 05:53:33,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-15 05:53:33,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-15 05:53:33,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-15 05:53:33,679 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-15 05:53:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446080963] [2022-04-15 05:53:33,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446080963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69853482] [2022-04-15 05:53:33,680 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:33,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:33,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:33,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:53:33,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:33,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:53:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:33,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:33,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-15 05:53:33,826 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-15 05:53:33,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-15 05:53:33,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-15 05:53:33,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-15 05:53:33,827 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-15 05:53:33,828 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-15 05:53:33,828 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-15 05:53:33,829 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-15 05:53:33,829 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-15 05:53:33,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {496#(<= main_~i~0 2)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-15 05:53:33,830 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-15 05:53:33,830 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-15 05:53:33,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-15 05:53:33,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-15 05:53:33,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-15 05:53:33,831 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-15 05:53:33,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:33,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-15 05:53:33,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-15 05:53:33,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-15 05:53:33,934 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-15 05:53:33,934 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-15 05:53:33,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {562#(< main_~i~0 2048)} assume !(~i~0 < 2048); {490#false} is VALID [2022-04-15 05:53:33,935 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-15 05:53:33,936 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-15 05:53:33,936 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-15 05:53:33,951 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-15 05:53:33,953 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-15 05:53:33,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} call #t~ret5 := main(); {489#true} is VALID [2022-04-15 05:53:33,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} #44#return; {489#true} is VALID [2022-04-15 05:53:33,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} assume true; {489#true} is VALID [2022-04-15 05:53:33,953 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-15 05:53:33,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-15 05:53:33,954 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-15 05:53:33,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69853482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:33,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:33,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:53:33,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417924642] [2022-04-15 05:53:33,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417924642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:33,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:33,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:53:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908836783] [2022-04-15 05:53:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:33,955 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-15 05:53:33,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:33,956 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-15 05:53:33,968 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-15 05:53:33,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:53:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:33,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:53:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:53:33,970 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-15 05:53:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:34,072 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:53:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:53:34,073 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-15 05:53:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:34,073 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-15 05:53:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 05:53:34,074 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-15 05:53:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 05:53:34,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 05:53:34,115 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-15 05:53:34,116 INFO L225 Difference]: With dead ends: 26 [2022-04-15 05:53:34,116 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 05:53:34,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:53:34,117 INFO L913 BasicCegarLoop]: 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-15 05:53:34,117 INFO L914 BasicCegarLoop]: 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-15 05:53:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 05:53:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 05:53:34,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:34,123 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-15 05:53:34,124 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-15 05:53:34,124 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-15 05:53:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:34,125 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:53:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:53:34,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:34,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:34,126 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-15 05:53:34,126 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-15 05:53:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:34,127 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:53:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:53:34,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:34,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:34,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:34,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:34,139 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-15 05:53:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 05:53:34,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-15 05:53:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:34,148 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 05:53:34,148 INFO L479 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-15 05:53:34,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 05:53:34,169 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-15 05:53:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 05:53:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:53:34,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:34,170 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:34,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:34,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 05:53:34,396 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:34,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1999739552, now seen corresponding path program 5 times [2022-04-15 05:53:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:34,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011482046] [2022-04-15 05:53:34,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:34,402 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:34,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1999739552, now seen corresponding path program 6 times [2022-04-15 05:53:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189069334] [2022-04-15 05:53:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:34,496 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-15 05:53:34,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 05:53:34,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-15 05:53:34,505 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-15 05:53:34,506 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-15 05:53:34,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 05:53:34,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-15 05:53:34,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-15 05:53:34,507 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-15 05:53:34,507 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-15 05:53:34,508 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-15 05:53:34,508 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-15 05:53:34,509 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-15 05:53:34,509 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-15 05:53:34,510 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-15 05:53:34,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#(<= main_~i~0 3)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-15 05:53:34,511 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-15 05:53:34,511 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-15 05:53:34,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-15 05:53:34,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-15 05:53:34,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-15 05:53:34,512 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-15 05:53:34,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:34,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189069334] [2022-04-15 05:53:34,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189069334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:34,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638595544] [2022-04-15 05:53:34,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:34,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:34,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:34,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 05:53:34,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:53:34,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:34,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:53:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:34,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:34,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2022-04-15 05:53:34,720 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-15 05:53:34,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 05:53:34,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-15 05:53:34,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-15 05:53:34,721 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-15 05:53:34,722 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-15 05:53:34,722 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-15 05:53:34,723 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-15 05:53:34,723 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-15 05:53:34,724 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-15 05:53:34,724 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-15 05:53:34,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#(<= main_~i~0 3)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-15 05:53:34,725 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-15 05:53:34,725 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-15 05:53:34,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-15 05:53:34,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-15 05:53:34,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-15 05:53:34,726 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-15 05:53:34,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:34,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-15 05:53:34,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2022-04-15 05:53:34,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2022-04-15 05:53:34,858 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-15 05:53:34,859 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-15 05:53:34,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(< main_~i~0 2048)} assume !(~i~0 < 2048); {734#false} is VALID [2022-04-15 05:53:34,859 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-15 05:53:34,860 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-15 05:53:34,860 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-15 05:53:34,861 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-15 05:53:34,862 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-15 05:53:34,862 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-15 05:53:34,863 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-15 05:53:34,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret5 := main(); {733#true} is VALID [2022-04-15 05:53:34,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #44#return; {733#true} is VALID [2022-04-15 05:53:34,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 05:53:34,864 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-15 05:53:34,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2022-04-15 05:53:34,864 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-15 05:53:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638595544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:34,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:34,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:53:34,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:34,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011482046] [2022-04-15 05:53:34,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011482046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:34,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:34,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:53:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756703508] [2022-04-15 05:53:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:34,866 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-15 05:53:34,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:34,866 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-15 05:53:34,879 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-15 05:53:34,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:53:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:53:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:53:34,880 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-15 05:53:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,023 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:53:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:53:35,023 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-15 05:53:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:35,024 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-15 05:53:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 05:53:35,030 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-15 05:53:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 05:53:35,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-15 05:53:35,071 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-15 05:53:35,073 INFO L225 Difference]: With dead ends: 28 [2022-04-15 05:53:35,073 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:53:35,073 INFO L912 BasicCegarLoop]: 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-15 05:53:35,074 INFO L913 BasicCegarLoop]: 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-15 05:53:35,074 INFO L914 BasicCegarLoop]: 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-15 05:53:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:53:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 05:53:35,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:35,086 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-15 05:53:35,086 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-15 05:53:35,087 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-15 05:53:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,088 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:53:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:53:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:35,089 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-15 05:53:35,089 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-15 05:53:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,090 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:53:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:53:35,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:35,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:35,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:35,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:35,091 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-15 05:53:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 05:53:35,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-04-15 05:53:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:35,092 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 05:53:35,092 INFO L479 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-15 05:53:35,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 05:53:35,111 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-15 05:53:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 05:53:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:53:35,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:35,112 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:35,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 05:53:35,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:35,336 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1025240770, now seen corresponding path program 7 times [2022-04-15 05:53:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:35,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954182574] [2022-04-15 05:53:35,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:35,339 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:35,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1025240770, now seen corresponding path program 8 times [2022-04-15 05:53:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944737934] [2022-04-15 05:53:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:35,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:35,435 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-15 05:53:35,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-15 05:53:35,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-15 05:53:35,437 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-15 05:53:35,437 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-15 05:53:35,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-15 05:53:35,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-15 05:53:35,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-15 05:53:35,438 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-15 05:53:35,439 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-15 05:53:35,439 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-15 05:53:35,439 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-15 05:53:35,440 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-15 05:53:35,440 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-15 05:53:35,441 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-15 05:53:35,441 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-15 05:53:35,442 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-15 05:53:35,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-15 05:53:35,442 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-15 05:53:35,442 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-15 05:53:35,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-15 05:53:35,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-15 05:53:35,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-15 05:53:35,443 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-15 05:53:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:35,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944737934] [2022-04-15 05:53:35,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944737934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:35,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701858809] [2022-04-15 05:53:35,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:35,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:35,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:35,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 05:53:35,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:35,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:35,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:53:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:35,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:35,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2022-04-15 05:53:35,608 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-15 05:53:35,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-15 05:53:35,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-15 05:53:35,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-15 05:53:35,609 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-15 05:53:35,609 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-15 05:53:35,610 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-15 05:53:35,610 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-15 05:53:35,611 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-15 05:53:35,611 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-15 05:53:35,611 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-15 05:53:35,612 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-15 05:53:35,612 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-15 05:53:35,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-15 05:53:35,613 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-15 05:53:35,613 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-15 05:53:35,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-15 05:53:35,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-15 05:53:35,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-15 05:53:35,614 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-15 05:53:35,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:35,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2022-04-15 05:53:35,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2022-04-15 05:53:35,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2022-04-15 05:53:35,757 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-15 05:53:35,759 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-15 05:53:35,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1006#false} is VALID [2022-04-15 05:53:35,760 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-15 05:53:35,761 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-15 05:53:35,761 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-15 05:53:35,762 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-15 05:53:35,763 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-15 05:53:35,763 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-15 05:53:35,764 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-15 05:53:35,764 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-15 05:53:35,765 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-15 05:53:35,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret5 := main(); {1005#true} is VALID [2022-04-15 05:53:35,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #44#return; {1005#true} is VALID [2022-04-15 05:53:35,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2022-04-15 05:53:35,765 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-15 05:53:35,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2022-04-15 05:53:35,765 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-15 05:53:35,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701858809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:35,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:35,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:53:35,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:35,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954182574] [2022-04-15 05:53:35,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954182574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:35,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:35,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:53:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122898617] [2022-04-15 05:53:35,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:35,769 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-15 05:53:35,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:35,770 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-15 05:53:35,788 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-15 05:53:35,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:53:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:53:35,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:53:35,789 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-15 05:53:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,930 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:53:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:53:35,931 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-15 05:53:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:35,931 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-15 05:53:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 05:53:35,932 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-15 05:53:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 05:53:35,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-15 05:53:35,960 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-15 05:53:35,961 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:53:35,962 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:53:35,962 INFO L912 BasicCegarLoop]: 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-15 05:53:35,969 INFO L913 BasicCegarLoop]: 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-15 05:53:35,969 INFO L914 BasicCegarLoop]: 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-15 05:53:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:53:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 05:53:35,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:35,984 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-15 05:53:35,984 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-15 05:53:35,984 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-15 05:53:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,985 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:53:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:53:35,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:35,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:35,986 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-15 05:53:35,986 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-15 05:53:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:35,987 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:53:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:53:35,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:35,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:35,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:35,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:35,988 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-15 05:53:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 05:53:35,989 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-04-15 05:53:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:35,989 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 05:53:35,989 INFO L479 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-15 05:53:35,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 05:53:36,009 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-15 05:53:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 05:53:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:53:36,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:36,010 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:36,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:36,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:36,228 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 834781796, now seen corresponding path program 9 times [2022-04-15 05:53:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:36,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649976077] [2022-04-15 05:53:36,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:36,231 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:36,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash 834781796, now seen corresponding path program 10 times [2022-04-15 05:53:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:36,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151872640] [2022-04-15 05:53:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:36,337 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-15 05:53:36,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-15 05:53:36,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-15 05:53:36,339 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-15 05:53:36,339 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-15 05:53:36,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-15 05:53:36,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-15 05:53:36,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-15 05:53:36,340 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-15 05:53:36,342 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-15 05:53:36,343 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-15 05:53:36,343 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-15 05:53:36,344 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-15 05:53:36,344 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-15 05:53:36,345 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-15 05:53:36,345 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-15 05:53:36,346 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-15 05:53:36,346 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-15 05:53:36,346 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-15 05:53:36,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-15 05:53:36,347 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-15 05:53:36,347 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-15 05:53:36,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-15 05:53:36,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-15 05:53:36,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-15 05:53:36,348 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-15 05:53:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151872640] [2022-04-15 05:53:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151872640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618617545] [2022-04-15 05:53:36,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:36,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:36,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:53:36,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:36,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:36,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:53:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:36,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:36,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2022-04-15 05:53:36,571 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-15 05:53:36,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-15 05:53:36,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-15 05:53:36,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-15 05:53:36,572 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-15 05:53:36,572 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-15 05:53:36,573 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-15 05:53:36,573 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-15 05:53:36,574 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-15 05:53:36,574 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-15 05:53:36,574 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-15 05:53:36,575 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-15 05:53:36,575 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-15 05:53:36,576 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-15 05:53:36,576 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-15 05:53:36,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-15 05:53:36,578 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-15 05:53:36,578 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-15 05:53:36,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-15 05:53:36,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-15 05:53:36,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-15 05:53:36,579 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-15 05:53:36,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:36,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2022-04-15 05:53:36,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2022-04-15 05:53:36,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2022-04-15 05:53:36,756 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-15 05:53:36,756 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-15 05:53:36,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {1399#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1306#false} is VALID [2022-04-15 05:53:36,757 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-15 05:53:36,758 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-15 05:53:36,759 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-15 05:53:36,760 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-15 05:53:36,763 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-15 05:53:36,764 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-15 05:53:36,765 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-15 05:53:36,765 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-15 05:53:36,766 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-15 05:53:36,766 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-15 05:53:36,767 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-15 05:53:36,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2022-04-15 05:53:36,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #44#return; {1305#true} is VALID [2022-04-15 05:53:36,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2022-04-15 05:53:36,768 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-15 05:53:36,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2022-04-15 05:53:36,768 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-15 05:53:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618617545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:36,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:36,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:53:36,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:36,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649976077] [2022-04-15 05:53:36,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649976077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:36,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:36,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:53:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578686324] [2022-04-15 05:53:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:36,770 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-15 05:53:36,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:36,770 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-15 05:53:36,790 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-15 05:53:36,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:53:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:53:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:53:36,792 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-15 05:53:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:36,965 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:53:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:53:36,965 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-15 05:53:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:36,965 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-15 05:53:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 05:53:36,967 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-15 05:53:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 05:53:36,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-15 05:53:37,002 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-15 05:53:37,003 INFO L225 Difference]: With dead ends: 32 [2022-04-15 05:53:37,003 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:53:37,003 INFO L912 BasicCegarLoop]: 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-15 05:53:37,004 INFO L913 BasicCegarLoop]: 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-15 05:53:37,005 INFO L914 BasicCegarLoop]: 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-15 05:53:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:53:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:53:37,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:37,021 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-15 05:53:37,021 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-15 05:53:37,021 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-15 05:53:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:37,023 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:53:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:53:37,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:37,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:37,023 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-15 05:53:37,023 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-15 05:53:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:37,024 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:53:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:53:37,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:37,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:37,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:37,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:37,025 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-15 05:53:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 05:53:37,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-04-15 05:53:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:37,026 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 05:53:37,027 INFO L479 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-15 05:53:37,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 05:53:37,049 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-15 05:53:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 05:53:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:53:37,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:37,050 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:37,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:37,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:37,260 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1807665786, now seen corresponding path program 11 times [2022-04-15 05:53:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:37,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916664565] [2022-04-15 05:53:37,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:37,272 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:37,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1807665786, now seen corresponding path program 12 times [2022-04-15 05:53:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:37,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954714472] [2022-04-15 05:53:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:37,363 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-15 05:53:37,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-15 05:53:37,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-15 05:53:37,367 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-15 05:53:37,367 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-15 05:53:37,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-15 05:53:37,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-15 05:53:37,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-15 05:53:37,368 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-15 05:53:37,368 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-15 05:53:37,369 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-15 05:53:37,369 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-15 05:53:37,369 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-15 05:53:37,370 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-15 05:53:37,370 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-15 05:53:37,370 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-15 05:53:37,371 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-15 05:53:37,371 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-15 05:53:37,372 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-15 05:53:37,372 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-15 05:53:37,373 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-15 05:53:37,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-15 05:53:37,373 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-15 05:53:37,374 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-15 05:53:37,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-15 05:53:37,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-15 05:53:37,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-15 05:53:37,380 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-15 05:53:37,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:37,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954714472] [2022-04-15 05:53:37,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954714472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:37,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826409836] [2022-04-15 05:53:37,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:37,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:37,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:37,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:37,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:53:37,463 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 05:53:37,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:37,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:53:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:37,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:37,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2022-04-15 05:53:37,610 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-15 05:53:37,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-15 05:53:37,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-15 05:53:37,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-15 05:53:37,611 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-15 05:53:37,612 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-15 05:53:37,612 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-15 05:53:37,613 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-15 05:53:37,613 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-15 05:53:37,613 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-15 05:53:37,614 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-15 05:53:37,614 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-15 05:53:37,615 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-15 05:53:37,615 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-15 05:53:37,616 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-15 05:53:37,616 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-15 05:53:37,616 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-15 05:53:37,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {1644#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-15 05:53:37,617 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-15 05:53:37,617 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-15 05:53:37,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-15 05:53:37,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-15 05:53:37,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-15 05:53:37,618 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-15 05:53:37,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:37,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2022-04-15 05:53:37,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2022-04-15 05:53:37,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2022-04-15 05:53:37,823 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-15 05:53:37,823 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-15 05:53:37,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1734#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1634#false} is VALID [2022-04-15 05:53:37,825 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-15 05:53:37,825 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-15 05:53:37,826 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-15 05:53:37,826 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-15 05:53:37,827 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-15 05:53:37,830 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-15 05:53:37,831 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-15 05:53:37,835 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-15 05:53:37,837 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-15 05:53:37,844 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-15 05:53:37,845 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-15 05:53:37,845 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-15 05:53:37,846 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-15 05:53:37,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {1633#true} call #t~ret5 := main(); {1633#true} is VALID [2022-04-15 05:53:37,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1633#true} {1633#true} #44#return; {1633#true} is VALID [2022-04-15 05:53:37,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#true} assume true; {1633#true} is VALID [2022-04-15 05:53:37,846 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-15 05:53:37,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2022-04-15 05:53:37,847 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-15 05:53:37,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826409836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:37,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:37,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 05:53:37,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:37,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916664565] [2022-04-15 05:53:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916664565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:37,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:37,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:53:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648316066] [2022-04-15 05:53:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:37,848 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-15 05:53:37,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:37,849 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-15 05:53:37,870 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-15 05:53:37,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:53:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:37,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:53:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:53:37,873 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-15 05:53:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:38,045 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:53:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:53:38,046 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-15 05:53:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:38,046 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-15 05:53:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-15 05:53:38,047 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-15 05:53:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-15 05:53:38,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-15 05:53:38,076 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-15 05:53:38,077 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:53:38,077 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 05:53:38,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-15 05:53:38,078 INFO L913 BasicCegarLoop]: 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-15 05:53:38,078 INFO L914 BasicCegarLoop]: 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-15 05:53:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 05:53:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 05:53:38,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:38,097 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-15 05:53:38,097 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-15 05:53:38,097 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-15 05:53:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:38,104 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:53:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 05:53:38,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:38,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:38,106 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-15 05:53:38,118 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-15 05:53:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:38,119 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:53:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 05:53:38,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:38,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:38,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:38,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:38,122 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-15 05:53:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 05:53:38,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-04-15 05:53:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:38,124 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 05:53:38,124 INFO L479 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-15 05:53:38,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 05:53:38,148 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-15 05:53:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 05:53:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:53:38,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:38,149 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:38,166 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-15 05:53:38,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:38,352 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1420847144, now seen corresponding path program 13 times [2022-04-15 05:53:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:38,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856202394] [2022-04-15 05:53:38,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:38,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:38,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1420847144, now seen corresponding path program 14 times [2022-04-15 05:53:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:38,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952008449] [2022-04-15 05:53:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:38,473 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-15 05:53:38,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-15 05:53:38,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-15 05:53:38,475 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-15 05:53:38,475 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-15 05:53:38,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-15 05:53:38,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-15 05:53:38,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-15 05:53:38,475 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-15 05:53:38,476 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-15 05:53:38,476 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-15 05:53:38,476 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-15 05:53:38,477 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-15 05:53:38,477 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-15 05:53:38,478 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-15 05:53:38,478 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-15 05:53:38,479 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-15 05:53:38,479 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-15 05:53:38,479 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-15 05:53:38,480 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-15 05:53:38,480 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-15 05:53:38,480 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-15 05:53:38,481 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-15 05:53:38,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-15 05:53:38,481 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-15 05:53:38,482 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-15 05:53:38,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-15 05:53:38,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-15 05:53:38,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-15 05:53:38,482 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-15 05:53:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:38,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952008449] [2022-04-15 05:53:38,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952008449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562530684] [2022-04-15 05:53:38,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:38,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:38,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:38,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:53:38,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:38,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:53:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:38,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:38,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2022-04-15 05:53:38,703 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-15 05:53:38,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-15 05:53:38,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-15 05:53:38,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-15 05:53:38,708 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-15 05:53:38,708 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-15 05:53:38,709 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-15 05:53:38,709 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-15 05:53:38,710 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-15 05:53:38,710 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-15 05:53:38,711 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-15 05:53:38,711 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-15 05:53:38,712 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-15 05:53:38,712 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-15 05:53:38,713 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-15 05:53:38,713 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-15 05:53:38,714 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-15 05:53:38,714 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-15 05:53:38,715 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-15 05:53:38,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-15 05:53:38,715 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-15 05:53:38,715 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-15 05:53:38,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-15 05:53:38,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-15 05:53:38,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-15 05:53:38,716 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-15 05:53:38,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:38,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2022-04-15 05:53:38,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2022-04-15 05:53:38,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2022-04-15 05:53:38,979 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-15 05:53:38,979 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-15 05:53:38,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {2097#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1990#false} is VALID [2022-04-15 05:53:38,984 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-15 05:53:38,984 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-15 05:53:38,985 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-15 05:53:38,985 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-15 05:53:38,986 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-15 05:53:38,986 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-15 05:53:38,987 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-15 05:53:38,987 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-15 05:53:38,988 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-15 05:53:38,988 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-15 05:53:38,989 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-15 05:53:38,989 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-15 05:53:38,990 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-15 05:53:38,990 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-15 05:53:38,991 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-15 05:53:38,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret5 := main(); {1989#true} is VALID [2022-04-15 05:53:38,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #44#return; {1989#true} is VALID [2022-04-15 05:53:38,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2022-04-15 05:53:38,991 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-15 05:53:38,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2022-04-15 05:53:38,992 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-15 05:53:38,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562530684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:38,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:38,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:53:38,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:38,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856202394] [2022-04-15 05:53:38,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856202394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:38,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:38,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:53:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66315427] [2022-04-15 05:53:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:38,993 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-15 05:53:38,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:38,994 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-15 05:53:39,018 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-15 05:53:39,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:53:39,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:39,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:53:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:53:39,019 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-15 05:53:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:39,235 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:53:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:53:39,235 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-15 05:53:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:39,235 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-15 05:53:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 05:53:39,237 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-15 05:53:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 05:53:39,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-15 05:53:39,276 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-15 05:53:39,277 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:53:39,277 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 05:53:39,278 INFO L912 BasicCegarLoop]: 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-15 05:53:39,279 INFO L913 BasicCegarLoop]: 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-15 05:53:39,279 INFO L914 BasicCegarLoop]: 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-15 05:53:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 05:53:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 05:53:39,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:39,304 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-15 05:53:39,304 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-15 05:53:39,304 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-15 05:53:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:39,305 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:53:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 05:53:39,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:39,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:39,306 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-15 05:53:39,306 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-15 05:53:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:39,307 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:53:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 05:53:39,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:39,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:39,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:39,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:39,308 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-15 05:53:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 05:53:39,308 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2022-04-15 05:53:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:39,309 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 05:53:39,309 INFO L479 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-15 05:53:39,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 05:53:39,336 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-15 05:53:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 05:53:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:53:39,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:39,337 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:39,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:39,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:39,538 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1239582134, now seen corresponding path program 15 times [2022-04-15 05:53:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761082365] [2022-04-15 05:53:39,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:39,543 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:39,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1239582134, now seen corresponding path program 16 times [2022-04-15 05:53:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226575424] [2022-04-15 05:53:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:39,652 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-15 05:53:39,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-15 05:53:39,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-15 05:53:39,653 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-15 05:53:39,653 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-15 05:53:39,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-15 05:53:39,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-15 05:53:39,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-15 05:53:39,654 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-15 05:53:39,654 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-15 05:53:39,655 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-15 05:53:39,655 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-15 05:53:39,655 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-15 05:53:39,656 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-15 05:53:39,656 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-15 05:53:39,657 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-15 05:53:39,657 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-15 05:53:39,658 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-15 05:53:39,658 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-15 05:53:39,659 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-15 05:53:39,659 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-15 05:53:39,659 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-15 05:53:39,660 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-15 05:53:39,660 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-15 05:53:39,661 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-15 05:53:39,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {2386#(<= main_~i~0 8)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-15 05:53:39,661 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-15 05:53:39,661 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-15 05:53:39,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-15 05:53:39,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-15 05:53:39,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-15 05:53:39,662 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-15 05:53:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:39,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226575424] [2022-04-15 05:53:39,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226575424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:39,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795309762] [2022-04-15 05:53:39,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:39,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:39,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:39,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:39,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:53:39,744 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:39,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:39,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 05:53:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:39,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:39,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2022-04-15 05:53:39,924 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-15 05:53:39,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-15 05:53:39,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-15 05:53:39,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-15 05:53:39,926 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-15 05:53:39,926 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-15 05:53:39,927 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-15 05:53:39,927 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-15 05:53:39,927 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-15 05:53:39,928 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-15 05:53:39,928 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-15 05:53:39,928 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-15 05:53:39,929 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-15 05:53:39,929 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-15 05:53:39,930 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-15 05:53:39,930 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-15 05:53:39,930 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-15 05:53:39,930 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-15 05:53:39,931 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-15 05:53:39,931 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-15 05:53:39,932 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-15 05:53:39,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {2386#(<= main_~i~0 8)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-15 05:53:39,932 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-15 05:53:39,932 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-15 05:53:39,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-15 05:53:39,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-15 05:53:39,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-15 05:53:39,933 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-15 05:53:39,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:40,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#false} assume !false; {2374#false} is VALID [2022-04-15 05:53:40,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {2374#false} assume 0 == ~cond; {2374#false} is VALID [2022-04-15 05:53:40,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {2374#false} ~cond := #in~cond; {2374#false} is VALID [2022-04-15 05:53:40,217 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-15 05:53:40,217 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-15 05:53:40,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {2488#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2374#false} is VALID [2022-04-15 05:53:40,218 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-15 05:53:40,218 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-15 05:53:40,220 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-15 05:53:40,220 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-15 05:53:40,221 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-15 05:53:40,221 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-15 05:53:40,221 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-15 05:53:40,222 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-15 05:53:40,222 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-15 05:53:40,223 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-15 05:53:40,227 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-15 05:53:40,228 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-15 05:53:40,228 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-15 05:53:40,229 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-15 05:53:40,229 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-15 05:53:40,229 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-15 05:53:40,230 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-15 05:53:40,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#true} call #t~ret5 := main(); {2373#true} is VALID [2022-04-15 05:53:40,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#true} {2373#true} #44#return; {2373#true} is VALID [2022-04-15 05:53:40,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#true} assume true; {2373#true} is VALID [2022-04-15 05:53:40,231 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-15 05:53:40,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {2373#true} call ULTIMATE.init(); {2373#true} is VALID [2022-04-15 05:53:40,231 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-15 05:53:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795309762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:40,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:40,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 05:53:40,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761082365] [2022-04-15 05:53:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761082365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:53:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117632559] [2022-04-15 05:53:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:40,233 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-15 05:53:40,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:40,233 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-15 05:53:40,254 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-15 05:53:40,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:53:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:53:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:53:40,255 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-15 05:53:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,471 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:53:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:53:40,472 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-15 05:53:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:40,472 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-15 05:53:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-15 05:53:40,473 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-15 05:53:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-04-15 05:53:40,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-04-15 05:53:40,503 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-15 05:53:40,504 INFO L225 Difference]: With dead ends: 38 [2022-04-15 05:53:40,504 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 05:53:40,504 INFO L912 BasicCegarLoop]: 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-15 05:53:40,505 INFO L913 BasicCegarLoop]: 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-15 05:53:40,505 INFO L914 BasicCegarLoop]: 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-15 05:53:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 05:53:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 05:53:40,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:40,545 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-15 05:53:40,546 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-15 05:53:40,547 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-15 05:53:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,548 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:53:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 05:53:40,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,549 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-15 05:53:40,549 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-15 05:53:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,550 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 05:53:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 05:53:40,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:40,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:40,551 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-15 05:53:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 05:53:40,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-04-15 05:53:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:40,552 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 05:53:40,553 INFO L479 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-15 05:53:40,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 05:53:40,583 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-15 05:53:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 05:53:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:53:40,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:40,585 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:40,613 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-15 05:53:40,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 05:53:40,810 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1888390124, now seen corresponding path program 17 times [2022-04-15 05:53:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118441554] [2022-04-15 05:53:40,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:40,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:40,813 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1888390124, now seen corresponding path program 18 times [2022-04-15 05:53:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:40,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9364083] [2022-04-15 05:53:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,932 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-15 05:53:40,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-15 05:53:40,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-15 05:53:40,933 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-15 05:53:40,933 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-15 05:53:40,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-15 05:53:40,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-15 05:53:40,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-15 05:53:40,934 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-15 05:53:40,934 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-15 05:53:40,935 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-15 05:53:40,935 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-15 05:53:40,935 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-15 05:53:40,936 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-15 05:53:40,936 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-15 05:53:40,937 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-15 05:53:40,937 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-15 05:53:40,937 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-15 05:53:40,938 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-15 05:53:40,938 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-15 05:53:40,938 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-15 05:53:40,939 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-15 05:53:40,939 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-15 05:53:40,940 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-15 05:53:40,940 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-15 05:53:40,940 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-15 05:53:40,941 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-15 05:53:40,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-15 05:53:40,941 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-15 05:53:40,941 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-15 05:53:40,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-15 05:53:40,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-15 05:53:40,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-15 05:53:40,942 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-15 05:53:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9364083] [2022-04-15 05:53:40,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9364083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002478712] [2022-04-15 05:53:40,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:40,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:40,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:40,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 05:53:41,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 05:53:41,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:41,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:53:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:41,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:41,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-15 05:53:41,220 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-15 05:53:41,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-15 05:53:41,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-15 05:53:41,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-15 05:53:41,221 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-15 05:53:41,222 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-15 05:53:41,222 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-15 05:53:41,222 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-15 05:53:41,223 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-15 05:53:41,223 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-15 05:53:41,223 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-15 05:53:41,224 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-15 05:53:41,224 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-15 05:53:41,224 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-15 05:53:41,225 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-15 05:53:41,225 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-15 05:53:41,225 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-15 05:53:41,226 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-15 05:53:41,226 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-15 05:53:41,226 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-15 05:53:41,227 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-15 05:53:41,227 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-15 05:53:41,228 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-15 05:53:41,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= main_~i~0 9)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-15 05:53:41,228 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-15 05:53:41,228 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-15 05:53:41,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-15 05:53:41,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-15 05:53:41,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-15 05:53:41,228 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-15 05:53:41,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:41,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-15 05:53:41,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-15 05:53:41,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-15 05:53:41,576 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-15 05:53:41,576 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-15 05:53:41,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {2907#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2786#false} is VALID [2022-04-15 05:53:41,580 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-15 05:53:41,580 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-15 05:53:41,581 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-15 05:53:41,581 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-15 05:53:41,582 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-15 05:53:41,582 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-15 05:53:41,582 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-15 05:53:41,583 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-15 05:53:41,583 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-15 05:53:41,584 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-15 05:53:41,584 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-15 05:53:41,584 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-15 05:53:41,585 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-15 05:53:41,585 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-15 05:53:41,586 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-15 05:53:41,586 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-15 05:53:41,587 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-15 05:53:41,587 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-15 05:53:41,588 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-15 05:53:41,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret5 := main(); {2785#true} is VALID [2022-04-15 05:53:41,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #44#return; {2785#true} is VALID [2022-04-15 05:53:41,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-15 05:53:41,589 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-15 05:53:41,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-15 05:53:41,589 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-15 05:53:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002478712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:41,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:41,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:53:41,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118441554] [2022-04-15 05:53:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118441554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:41,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:41,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:53:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438052032] [2022-04-15 05:53:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:41,591 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-15 05:53:41,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:41,592 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-15 05:53:41,617 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-15 05:53:41,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:53:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:53:41,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:53:41,619 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-15 05:53:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,903 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:53:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:53:41,904 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-15 05:53:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:41,905 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-15 05:53:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 05:53:41,908 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-15 05:53:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 05:53:41,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 05:53:41,941 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-15 05:53:41,943 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:53:41,943 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 05:53:41,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:53:41,944 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:41,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 05:53:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 05:53:41,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:41,981 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-15 05:53:41,981 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-15 05:53:41,981 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-15 05:53:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,982 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:53:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:53:41,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:41,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:41,982 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-15 05:53:41,983 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-15 05:53:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,983 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:53:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:53:41,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:41,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:41,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:41,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:41,984 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-15 05:53:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 05:53:41,985 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2022-04-15 05:53:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:41,985 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 05:53:41,985 INFO L479 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-15 05:53:41,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 05:53:42,015 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-15 05:53:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 05:53:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:53:42,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:42,016 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:42,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:42,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:42,236 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622862, now seen corresponding path program 19 times [2022-04-15 05:53:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:42,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592940879] [2022-04-15 05:53:42,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:42,239 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:42,239 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622862, now seen corresponding path program 20 times [2022-04-15 05:53:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:42,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086332045] [2022-04-15 05:53:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,372 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-15 05:53:42,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-15 05:53:42,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-15 05:53:42,373 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-15 05:53:42,373 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-15 05:53:42,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-15 05:53:42,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-15 05:53:42,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-15 05:53:42,373 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-15 05:53:42,374 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-15 05:53:42,374 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-15 05:53:42,375 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-15 05:53:42,375 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-15 05:53:42,375 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-15 05:53:42,376 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-15 05:53:42,376 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-15 05:53:42,377 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-15 05:53:42,377 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-15 05:53:42,377 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-15 05:53:42,378 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-15 05:53:42,378 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-15 05:53:42,378 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-15 05:53:42,379 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-15 05:53:42,379 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-15 05:53:42,380 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-15 05:53:42,380 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-15 05:53:42,380 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-15 05:53:42,381 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-15 05:53:42,381 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-15 05:53:42,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#(<= main_~i~0 10)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-15 05:53:42,381 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-15 05:53:42,381 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-15 05:53:42,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-15 05:53:42,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-15 05:53:42,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-15 05:53:42,382 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-15 05:53:42,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:42,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086332045] [2022-04-15 05:53:42,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086332045] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:42,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055482069] [2022-04-15 05:53:42,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:42,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:42,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:42,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 05:53:42,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:42,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:42,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:53:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:42,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {3225#true} call ULTIMATE.init(); {3225#true} is VALID [2022-04-15 05:53:42,669 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-15 05:53:42,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-15 05:53:42,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-15 05:53:42,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-15 05:53:42,670 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-15 05:53:42,670 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-15 05:53:42,671 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-15 05:53:42,671 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-15 05:53:42,671 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-15 05:53:42,672 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-15 05:53:42,672 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-15 05:53:42,672 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-15 05:53:42,673 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-15 05:53:42,673 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-15 05:53:42,674 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-15 05:53:42,674 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-15 05:53:42,674 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-15 05:53:42,675 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-15 05:53:42,675 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-15 05:53:42,675 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-15 05:53:42,676 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-15 05:53:42,683 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-15 05:53:42,684 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-15 05:53:42,685 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-15 05:53:42,685 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-15 05:53:42,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#(<= main_~i~0 10)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-15 05:53:42,686 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-15 05:53:42,686 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-15 05:53:42,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-15 05:53:42,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-15 05:53:42,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-15 05:53:42,687 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-15 05:53:42,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:43,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {3226#false} assume !false; {3226#false} is VALID [2022-04-15 05:53:43,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {3226#false} assume 0 == ~cond; {3226#false} is VALID [2022-04-15 05:53:43,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {3226#false} ~cond := #in~cond; {3226#false} is VALID [2022-04-15 05:53:43,023 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-15 05:53:43,023 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-15 05:53:43,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {3354#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3226#false} is VALID [2022-04-15 05:53:43,024 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-15 05:53:43,025 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-15 05:53:43,025 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-15 05:53:43,025 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-15 05:53:43,026 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-15 05:53:43,026 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-15 05:53:43,026 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-15 05:53:43,027 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-15 05:53:43,027 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-15 05:53:43,028 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-15 05:53:43,028 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-15 05:53:43,028 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-15 05:53:43,029 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-15 05:53:43,029 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-15 05:53:43,030 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-15 05:53:43,030 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-15 05:53:43,031 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-15 05:53:43,031 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-15 05:53:43,031 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-15 05:53:43,035 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-15 05:53:43,036 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-15 05:53:43,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {3225#true} call #t~ret5 := main(); {3225#true} is VALID [2022-04-15 05:53:43,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3225#true} {3225#true} #44#return; {3225#true} is VALID [2022-04-15 05:53:43,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {3225#true} assume true; {3225#true} is VALID [2022-04-15 05:53:43,037 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-15 05:53:43,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {3225#true} call ULTIMATE.init(); {3225#true} is VALID [2022-04-15 05:53:43,037 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-15 05:53:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055482069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:43,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:43,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:53:43,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:43,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592940879] [2022-04-15 05:53:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592940879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:43,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:43,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:53:43,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173268468] [2022-04-15 05:53:43,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:43,040 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-15 05:53:43,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:43,041 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-15 05:53:43,065 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-15 05:53:43,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:53:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:53:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:53:43,066 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-15 05:53:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,363 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:53:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:53:43,364 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-15 05:53:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:43,364 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-15 05:53:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 05:53:43,365 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-15 05:53:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 05:53:43,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2022-04-15 05:53:43,401 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-15 05:53:43,402 INFO L225 Difference]: With dead ends: 42 [2022-04-15 05:53:43,402 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 05:53:43,402 INFO L912 BasicCegarLoop]: 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-15 05:53:43,403 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:43,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 05:53:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 05:53:43,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:43,440 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-15 05:53:43,440 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-15 05:53:43,441 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-15 05:53:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,442 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:53:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 05:53:43,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:43,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:43,442 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-15 05:53:43,442 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-15 05:53:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,443 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:53:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 05:53:43,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:43,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:43,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:43,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:43,444 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-15 05:53:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 05:53:43,445 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2022-04-15 05:53:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:43,445 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 05:53:43,445 INFO L479 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-15 05:53:43,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 05:53:43,475 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-15 05:53:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 05:53:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 05:53:43,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:43,476 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:43,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 05:53:43,699 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1701653936, now seen corresponding path program 21 times [2022-04-15 05:53:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004202475] [2022-04-15 05:53:43,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:43,703 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:43,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1701653936, now seen corresponding path program 22 times [2022-04-15 05:53:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:43,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572348328] [2022-04-15 05:53:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,876 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-15 05:53:43,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-15 05:53:43,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-15 05:53:43,877 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-15 05:53:43,877 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-15 05:53:43,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-15 05:53:43,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-15 05:53:43,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-15 05:53:43,878 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-15 05:53:43,879 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-15 05:53:43,879 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-15 05:53:43,879 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-15 05:53:43,880 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-15 05:53:43,880 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-15 05:53:43,881 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-15 05:53:43,881 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-15 05:53:43,882 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-15 05:53:43,882 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-15 05:53:43,882 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-15 05:53:43,883 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-15 05:53:43,883 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-15 05:53:43,883 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-15 05:53:43,884 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-15 05:53:43,884 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-15 05:53:43,884 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-15 05:53:43,885 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-15 05:53:43,885 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-15 05:53:43,885 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-15 05:53:43,886 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-15 05:53:43,886 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-15 05:53:43,886 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-15 05:53:43,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(<= main_~i~0 11)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-15 05:53:43,887 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-15 05:53:43,887 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-15 05:53:43,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-15 05:53:43,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-15 05:53:43,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-15 05:53:43,887 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-15 05:53:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572348328] [2022-04-15 05:53:43,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572348328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985552212] [2022-04-15 05:53:43,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:43,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:43,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 05:53:43,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:43,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:43,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:53:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:44,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {3693#true} call ULTIMATE.init(); {3693#true} is VALID [2022-04-15 05:53:44,175 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-15 05:53:44,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-15 05:53:44,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-15 05:53:44,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-15 05:53:44,179 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-15 05:53:44,180 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-15 05:53:44,180 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-15 05:53:44,181 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-15 05:53:44,181 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-15 05:53:44,181 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-15 05:53:44,182 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-15 05:53:44,182 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-15 05:53:44,182 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-15 05:53:44,183 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-15 05:53:44,183 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-15 05:53:44,183 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-15 05:53:44,184 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-15 05:53:44,184 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-15 05:53:44,184 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-15 05:53:44,185 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-15 05:53:44,185 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-15 05:53:44,185 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-15 05:53:44,186 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-15 05:53:44,186 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-15 05:53:44,186 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-15 05:53:44,187 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-15 05:53:44,187 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-15 05:53:44,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(<= main_~i~0 11)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-15 05:53:44,188 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-15 05:53:44,188 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-15 05:53:44,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-15 05:53:44,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-15 05:53:44,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-15 05:53:44,188 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-15 05:53:44,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:44,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {3694#false} assume !false; {3694#false} is VALID [2022-04-15 05:53:44,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {3694#false} assume 0 == ~cond; {3694#false} is VALID [2022-04-15 05:53:44,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {3694#false} ~cond := #in~cond; {3694#false} is VALID [2022-04-15 05:53:44,547 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-15 05:53:44,547 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-15 05:53:44,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {3829#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3694#false} is VALID [2022-04-15 05:53:44,548 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-15 05:53:44,548 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-15 05:53:44,548 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-15 05:53:44,549 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-15 05:53:44,549 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-15 05:53:44,549 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-15 05:53:44,550 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-15 05:53:44,550 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-15 05:53:44,551 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-15 05:53:44,551 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-15 05:53:44,551 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-15 05:53:44,552 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-15 05:53:44,552 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-15 05:53:44,552 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-15 05:53:44,553 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-15 05:53:44,553 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-15 05:53:44,553 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-15 05:53:44,554 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-15 05:53:44,554 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-15 05:53:44,554 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-15 05:53:44,555 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-15 05:53:44,555 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-15 05:53:44,556 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-15 05:53:44,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {3693#true} call #t~ret5 := main(); {3693#true} is VALID [2022-04-15 05:53:44,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3693#true} {3693#true} #44#return; {3693#true} is VALID [2022-04-15 05:53:44,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3693#true} assume true; {3693#true} is VALID [2022-04-15 05:53:44,556 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-15 05:53:44,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {3693#true} call ULTIMATE.init(); {3693#true} is VALID [2022-04-15 05:53:44,556 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-15 05:53:44,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985552212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:44,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:44,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 05:53:44,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:44,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004202475] [2022-04-15 05:53:44,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004202475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:44,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:44,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:53:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240418806] [2022-04-15 05:53:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:44,558 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-15 05:53:44,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:44,558 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-15 05:53:44,594 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-15 05:53:44,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:53:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:53:44,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:53:44,595 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-15 05:53:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,864 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:53:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:53:44,864 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-15 05:53:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:44,864 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-15 05:53:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-15 05:53:44,866 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-15 05:53:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2022-04-15 05:53:44,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2022-04-15 05:53:44,901 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-15 05:53:44,902 INFO L225 Difference]: With dead ends: 44 [2022-04-15 05:53:44,902 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:53:44,903 INFO L912 BasicCegarLoop]: 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-15 05:53:44,903 INFO L913 BasicCegarLoop]: 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-15 05:53:44,904 INFO L914 BasicCegarLoop]: 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-15 05:53:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:53:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 05:53:44,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:44,942 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-15 05:53:44,942 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-15 05:53:44,943 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-15 05:53:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,944 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:53:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 05:53:44,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:44,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:44,944 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-15 05:53:44,944 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-15 05:53:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,945 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 05:53:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 05:53:44,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:44,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:44,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:44,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:44,946 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-15 05:53:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 05:53:44,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-04-15 05:53:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:44,947 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 05:53:44,947 INFO L479 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-15 05:53:44,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 05:53:44,983 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-15 05:53:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 05:53:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:53:44,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:44,984 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:45,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 05:53:45,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 05:53:45,185 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1967194670, now seen corresponding path program 23 times [2022-04-15 05:53:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:45,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664401174] [2022-04-15 05:53:45,188 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:45,188 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:45,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1967194670, now seen corresponding path program 24 times [2022-04-15 05:53:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:45,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326144286] [2022-04-15 05:53:45,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,333 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-15 05:53:45,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-15 05:53:45,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-15 05:53:45,334 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-15 05:53:45,334 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-15 05:53:45,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-15 05:53:45,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-15 05:53:45,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-15 05:53:45,339 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-15 05:53:45,340 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-15 05:53:45,340 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-15 05:53:45,341 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-15 05:53:45,341 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-15 05:53:45,342 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-15 05:53:45,342 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-15 05:53:45,343 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-15 05:53:45,343 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-15 05:53:45,344 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-15 05:53:45,344 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-15 05:53:45,345 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-15 05:53:45,345 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-15 05:53:45,345 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-15 05:53:45,346 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-15 05:53:45,346 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-15 05:53:45,347 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-15 05:53:45,347 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-15 05:53:45,348 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-15 05:53:45,348 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-15 05:53:45,349 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-15 05:53:45,349 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-15 05:53:45,349 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-15 05:53:45,350 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-15 05:53:45,350 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-15 05:53:45,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~i~0 12)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-15 05:53:45,351 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-15 05:53:45,351 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-15 05:53:45,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-15 05:53:45,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-15 05:53:45,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-15 05:53:45,352 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-15 05:53:45,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:45,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326144286] [2022-04-15 05:53:45,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326144286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:45,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182103806] [2022-04-15 05:53:45,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:45,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:45,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:45,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 05:53:45,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 05:53:45,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:45,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 05:53:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:45,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2022-04-15 05:53:45,750 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-15 05:53:45,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-15 05:53:45,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-15 05:53:45,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-15 05:53:45,751 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-15 05:53:45,751 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-15 05:53:45,751 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-15 05:53:45,752 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-15 05:53:45,752 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-15 05:53:45,753 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-15 05:53:45,753 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-15 05:53:45,753 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-15 05:53:45,754 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-15 05:53:45,754 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-15 05:53:45,755 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-15 05:53:45,755 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-15 05:53:45,755 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-15 05:53:45,756 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-15 05:53:45,756 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-15 05:53:45,756 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-15 05:53:45,757 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-15 05:53:45,757 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-15 05:53:45,758 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-15 05:53:45,758 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-15 05:53:45,758 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-15 05:53:45,759 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-15 05:53:45,759 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-15 05:53:45,759 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-15 05:53:45,760 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-15 05:53:45,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~i~0 12)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-15 05:53:45,760 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-15 05:53:45,760 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-15 05:53:45,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-15 05:53:45,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-15 05:53:45,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-15 05:53:45,761 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-15 05:53:45,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:46,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-15 05:53:46,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2022-04-15 05:53:46,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2022-04-15 05:53:46,152 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-15 05:53:46,153 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-15 05:53:46,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {4332#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4190#false} is VALID [2022-04-15 05:53:46,153 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-15 05:53:46,154 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-15 05:53:46,154 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-15 05:53:46,154 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-15 05:53:46,155 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-15 05:53:46,155 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-15 05:53:46,155 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-15 05:53:46,156 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-15 05:53:46,156 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-15 05:53:46,156 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-15 05:53:46,157 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-15 05:53:46,157 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-15 05:53:46,157 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-15 05:53:46,158 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-15 05:53:46,158 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-15 05:53:46,158 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-15 05:53:46,159 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-15 05:53:46,159 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-15 05:53:46,159 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-15 05:53:46,160 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-15 05:53:46,160 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-15 05:53:46,160 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-15 05:53:46,161 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-15 05:53:46,161 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-15 05:53:46,162 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-15 05:53:46,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret5 := main(); {4189#true} is VALID [2022-04-15 05:53:46,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #44#return; {4189#true} is VALID [2022-04-15 05:53:46,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-15 05:53:46,162 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-15 05:53:46,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2022-04-15 05:53:46,162 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-15 05:53:46,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182103806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:46,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:46,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 05:53:46,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:46,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664401174] [2022-04-15 05:53:46,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664401174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:46,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:46,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:53:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369703798] [2022-04-15 05:53:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:46,164 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-15 05:53:46,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:46,164 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-15 05:53:46,191 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-15 05:53:46,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:53:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:46,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:53:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:53:46,192 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-15 05:53:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:46,506 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:53:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:53:46,506 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-15 05:53:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:46,507 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-15 05:53:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 05:53:46,508 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-15 05:53:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 05:53:46,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-15 05:53:46,553 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-15 05:53:46,554 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:53:46,554 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 05:53:46,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 05:53:46,555 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:46,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 05:53:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 05:53:46,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:46,623 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-15 05:53:46,623 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-15 05:53:46,624 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-15 05:53:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:46,624 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:53:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 05:53:46,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:46,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:46,625 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-15 05:53:46,625 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-15 05:53:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:46,626 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 05:53:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 05:53:46,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:46,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:46,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:46,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:46,627 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-15 05:53:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 05:53:46,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-04-15 05:53:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:46,628 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 05:53:46,628 INFO L479 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-15 05:53:46,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 05:53:46,662 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-15 05:53:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 05:53:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:53:46,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:46,662 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:46,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:46,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 05:53:46,863 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1562555020, now seen corresponding path program 25 times [2022-04-15 05:53:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:46,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712512092] [2022-04-15 05:53:46,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:46,866 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:46,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1562555020, now seen corresponding path program 26 times [2022-04-15 05:53:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:46,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400222356] [2022-04-15 05:53:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,048 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-15 05:53:47,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-15 05:53:47,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-15 05:53:47,049 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-15 05:53:47,050 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-15 05:53:47,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-15 05:53:47,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-15 05:53:47,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-15 05:53:47,050 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-15 05:53:47,051 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-15 05:53:47,051 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-15 05:53:47,052 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-15 05:53:47,052 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-15 05:53:47,052 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-15 05:53:47,053 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-15 05:53:47,053 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-15 05:53:47,054 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-15 05:53:47,054 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-15 05:53:47,055 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-15 05:53:47,055 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-15 05:53:47,055 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-15 05:53:47,056 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-15 05:53:47,056 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-15 05:53:47,057 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-15 05:53:47,057 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-15 05:53:47,058 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-15 05:53:47,058 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-15 05:53:47,058 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-15 05:53:47,059 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-15 05:53:47,059 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-15 05:53:47,060 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-15 05:53:47,060 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-15 05:53:47,061 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-15 05:53:47,061 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-15 05:53:47,061 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-15 05:53:47,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {4731#(<= main_~i~0 13)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-15 05:53:47,062 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-15 05:53:47,062 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-15 05:53:47,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-15 05:53:47,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-15 05:53:47,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-15 05:53:47,063 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-15 05:53:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400222356] [2022-04-15 05:53:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400222356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21780944] [2022-04-15 05:53:47,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:47,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:47,065 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:47,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 05:53:47,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:47,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:47,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:53:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:47,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4713#true} is VALID [2022-04-15 05:53:47,370 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-15 05:53:47,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-15 05:53:47,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-15 05:53:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-15 05:53:47,376 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-15 05:53:47,376 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-15 05:53:47,377 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-15 05:53:47,377 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-15 05:53:47,378 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-15 05:53:47,378 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-15 05:53:47,379 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-15 05:53:47,379 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-15 05:53:47,379 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-15 05:53:47,380 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-15 05:53:47,380 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-15 05:53:47,381 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-15 05:53:47,381 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-15 05:53:47,382 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-15 05:53:47,382 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-15 05:53:47,383 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-15 05:53:47,383 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-15 05:53:47,383 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-15 05:53:47,384 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-15 05:53:47,384 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-15 05:53:47,385 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-15 05:53:47,385 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-15 05:53:47,386 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-15 05:53:47,386 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-15 05:53:47,387 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-15 05:53:47,387 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-15 05:53:47,388 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-15 05:53:47,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {4731#(<= main_~i~0 13)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-15 05:53:47,388 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-15 05:53:47,389 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-15 05:53:47,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-15 05:53:47,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-15 05:53:47,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-15 05:53:47,389 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-15 05:53:47,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:47,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {4714#false} assume !false; {4714#false} is VALID [2022-04-15 05:53:47,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {4714#false} assume 0 == ~cond; {4714#false} is VALID [2022-04-15 05:53:47,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {4714#false} ~cond := #in~cond; {4714#false} is VALID [2022-04-15 05:53:47,844 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-15 05:53:47,844 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-15 05:53:47,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {4863#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4714#false} is VALID [2022-04-15 05:53:47,844 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-15 05:53:47,845 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-15 05:53:47,847 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-15 05:53:47,848 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-15 05:53:47,848 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-15 05:53:47,849 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-15 05:53:47,849 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-15 05:53:47,849 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-15 05:53:47,850 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-15 05:53:47,850 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-15 05:53:47,851 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-15 05:53:47,851 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-15 05:53:47,851 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-15 05:53:47,851 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-15 05:53:47,852 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-15 05:53:47,852 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-15 05:53:47,853 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-15 05:53:47,855 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-15 05:53:47,856 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-15 05:53:47,856 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-15 05:53:47,857 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-15 05:53:47,857 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-15 05:53:47,858 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-15 05:53:47,858 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-15 05:53:47,858 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-15 05:53:47,859 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-15 05:53:47,859 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-15 05:53:47,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {4713#true} call #t~ret5 := main(); {4713#true} is VALID [2022-04-15 05:53:47,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4713#true} {4713#true} #44#return; {4713#true} is VALID [2022-04-15 05:53:47,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {4713#true} assume true; {4713#true} is VALID [2022-04-15 05:53:47,860 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-15 05:53:47,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {4713#true} call ULTIMATE.init(); {4713#true} is VALID [2022-04-15 05:53:47,860 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-15 05:53:47,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21780944] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:47,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:47,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:53:47,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:47,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712512092] [2022-04-15 05:53:47,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712512092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:47,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:47,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:53:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47415606] [2022-04-15 05:53:47,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:47,861 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-15 05:53:47,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:47,862 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-15 05:53:47,888 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-15 05:53:47,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:53:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:53:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:53:47,889 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-15 05:53:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,188 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:53:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:53:48,188 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-15 05:53:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:48,188 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-15 05:53:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-15 05:53:48,190 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-15 05:53:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-15 05:53:48,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-04-15 05:53:48,228 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-15 05:53:48,229 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:53:48,229 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 05:53:48,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:53:48,231 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:48,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 05:53:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-15 05:53:48,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:48,300 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-15 05:53:48,300 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-15 05:53:48,301 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-15 05:53:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,301 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:53:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 05:53:48,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:48,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:48,302 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-15 05:53:48,302 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-15 05:53:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,302 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 05:53:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 05:53:48,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:48,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:48,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:48,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:48,303 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-15 05:53:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 05:53:48,303 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2022-04-15 05:53:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:48,304 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 05:53:48,304 INFO L479 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-15 05:53:48,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 05:53:48,342 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-15 05:53:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 05:53:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 05:53:48,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:48,342 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:48,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:48,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 05:53:48,543 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 749091990, now seen corresponding path program 27 times [2022-04-15 05:53:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:48,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724865373] [2022-04-15 05:53:48,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:48,546 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:48,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash 749091990, now seen corresponding path program 28 times [2022-04-15 05:53:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539835389] [2022-04-15 05:53:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:48,743 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-15 05:53:48,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-15 05:53:48,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-15 05:53:48,744 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-15 05:53:48,744 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-15 05:53:48,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-15 05:53:48,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-15 05:53:48,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-15 05:53:48,745 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-15 05:53:48,745 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-15 05:53:48,746 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-15 05:53:48,746 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-15 05:53:48,747 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-15 05:53:48,747 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-15 05:53:48,748 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-15 05:53:48,748 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-15 05:53:48,749 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-15 05:53:48,749 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-15 05:53:48,749 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-15 05:53:48,750 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-15 05:53:48,750 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-15 05:53:48,751 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-15 05:53:48,751 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-15 05:53:48,751 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-15 05:53:48,752 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-15 05:53:48,752 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-15 05:53:48,752 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-15 05:53:48,753 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-15 05:53:48,753 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-15 05:53:48,754 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-15 05:53:48,754 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-15 05:53:48,754 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-15 05:53:48,755 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-15 05:53:48,755 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-15 05:53:48,756 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-15 05:53:48,756 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-15 05:53:48,756 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-15 05:53:48,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {5284#(<= main_~i~0 14)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-15 05:53:48,757 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-15 05:53:48,757 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-15 05:53:48,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-15 05:53:48,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-15 05:53:48,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-15 05:53:48,758 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-15 05:53:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:48,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539835389] [2022-04-15 05:53:48,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539835389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:48,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411161698] [2022-04-15 05:53:48,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:48,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:48,760 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:48,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 05:53:48,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:48,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:48,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 05:53:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:48,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:49,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} call ULTIMATE.init(); {5265#true} is VALID [2022-04-15 05:53:49,093 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-15 05:53:49,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-15 05:53:49,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-15 05:53:49,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-15 05:53:49,093 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-15 05:53:49,094 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-15 05:53:49,094 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-15 05:53:49,094 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-15 05:53:49,095 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-15 05:53:49,095 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-15 05:53:49,096 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-15 05:53:49,096 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-15 05:53:49,096 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-15 05:53:49,096 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-15 05:53:49,097 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-15 05:53:49,097 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-15 05:53:49,098 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-15 05:53:49,098 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-15 05:53:49,098 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-15 05:53:49,098 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-15 05:53:49,099 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-15 05:53:49,099 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-15 05:53:49,100 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-15 05:53:49,100 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-15 05:53:49,100 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-15 05:53:49,101 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-15 05:53:49,101 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-15 05:53:49,101 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-15 05:53:49,102 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-15 05:53:49,102 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-15 05:53:49,103 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-15 05:53:49,103 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-15 05:53:49,103 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-15 05:53:49,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {5284#(<= main_~i~0 14)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-15 05:53:49,104 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-15 05:53:49,104 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-15 05:53:49,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-15 05:53:49,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-15 05:53:49,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-15 05:53:49,104 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-15 05:53:49,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:49,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {5266#false} assume !false; {5266#false} is VALID [2022-04-15 05:53:49,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {5266#false} assume 0 == ~cond; {5266#false} is VALID [2022-04-15 05:53:49,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {5266#false} ~cond := #in~cond; {5266#false} is VALID [2022-04-15 05:53:49,575 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-15 05:53:49,575 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-15 05:53:49,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {5422#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5266#false} is VALID [2022-04-15 05:53:49,576 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-15 05:53:49,576 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-15 05:53:49,577 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-15 05:53:49,577 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-15 05:53:49,577 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-15 05:53:49,578 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-15 05:53:49,578 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-15 05:53:49,578 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-15 05:53:49,579 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-15 05:53:49,579 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-15 05:53:49,579 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-15 05:53:49,580 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-15 05:53:49,580 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-15 05:53:49,580 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-15 05:53:49,581 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-15 05:53:49,581 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-15 05:53:49,581 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-15 05:53:49,582 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-15 05:53:49,582 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-15 05:53:49,582 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-15 05:53:49,583 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-15 05:53:49,583 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-15 05:53:49,583 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-15 05:53:49,584 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-15 05:53:49,584 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-15 05:53:49,584 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-15 05:53:49,585 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-15 05:53:49,585 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-15 05:53:49,586 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-15 05:53:49,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#true} call #t~ret5 := main(); {5265#true} is VALID [2022-04-15 05:53:49,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#true} {5265#true} #44#return; {5265#true} is VALID [2022-04-15 05:53:49,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#true} assume true; {5265#true} is VALID [2022-04-15 05:53:49,586 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-15 05:53:49,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} call ULTIMATE.init(); {5265#true} is VALID [2022-04-15 05:53:49,586 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-15 05:53:49,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411161698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:49,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:49,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 05:53:49,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724865373] [2022-04-15 05:53:49,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724865373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:49,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:49,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:53:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195806523] [2022-04-15 05:53:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:49,588 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-15 05:53:49,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:49,588 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-15 05:53:49,616 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-15 05:53:49,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:53:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:53:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:53:49,618 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-15 05:53:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:49,971 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:53:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:53:49,972 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-15 05:53:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:49,972 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-15 05:53:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-15 05:53:49,973 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-15 05:53:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2022-04-15 05:53:49,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 50 transitions. [2022-04-15 05:53:50,017 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-15 05:53:50,017 INFO L225 Difference]: With dead ends: 50 [2022-04-15 05:53:50,017 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 05:53:50,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 05:53:50,019 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 05:53:50,019 INFO L914 BasicCegarLoop]: 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-15 05:53:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 05:53:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 05:53:50,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:50,076 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-15 05:53:50,076 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-15 05:53:50,076 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-15 05:53:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:50,076 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:53:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 05:53:50,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:50,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:50,077 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-15 05:53:50,077 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-15 05:53:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:50,078 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 05:53:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 05:53:50,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:50,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:50,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:50,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:50,078 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-15 05:53:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 05:53:50,079 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2022-04-15 05:53:50,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:50,079 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 05:53:50,079 INFO L479 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-15 05:53:50,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 05:53:50,125 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-15 05:53:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 05:53:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 05:53:50,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:50,125 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:50,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:50,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:50,326 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1743776568, now seen corresponding path program 29 times [2022-04-15 05:53:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:50,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812560007] [2022-04-15 05:53:50,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:50,333 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:50,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1743776568, now seen corresponding path program 30 times [2022-04-15 05:53:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:50,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645217896] [2022-04-15 05:53:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:50,575 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-15 05:53:50,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:53:50,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-15 05:53:50,576 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-15 05:53:50,577 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-15 05:53:50,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:53:50,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-15 05:53:50,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-15 05:53:50,577 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-15 05:53:50,577 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-15 05:53:50,578 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-15 05:53:50,578 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-15 05:53:50,579 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-15 05:53:50,579 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-15 05:53:50,580 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-15 05:53:50,580 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-15 05:53:50,580 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-15 05:53:50,581 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-15 05:53:50,581 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-15 05:53:50,582 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-15 05:53:50,582 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-15 05:53:50,582 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-15 05:53:50,583 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-15 05:53:50,583 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-15 05:53:50,584 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-15 05:53:50,584 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-15 05:53:50,584 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-15 05:53:50,585 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-15 05:53:50,585 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-15 05:53:50,585 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-15 05:53:50,586 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-15 05:53:50,586 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-15 05:53:50,587 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-15 05:53:50,587 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-15 05:53:50,588 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-15 05:53:50,588 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-15 05:53:50,589 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-15 05:53:50,589 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-15 05:53:50,589 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-15 05:53:50,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {5865#(<= main_~i~0 15)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-15 05:53:50,590 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-15 05:53:50,590 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-15 05:53:50,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:53:50,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:53:50,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:53:50,591 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-15 05:53:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645217896] [2022-04-15 05:53:50,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645217896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79290747] [2022-04-15 05:53:50,591 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:50,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:50,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 05:53:51,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 05:53:51,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:51,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:53:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:51,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:51,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-15 05:53:51,262 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-15 05:53:51,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:53:51,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-15 05:53:51,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-15 05:53:51,262 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-15 05:53:51,263 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-15 05:53:51,263 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-15 05:53:51,263 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-15 05:53:51,264 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-15 05:53:51,264 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-15 05:53:51,264 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-15 05:53:51,265 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-15 05:53:51,265 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-15 05:53:51,265 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-15 05:53:51,266 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-15 05:53:51,266 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-15 05:53:51,267 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-15 05:53:51,267 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-15 05:53:51,267 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-15 05:53:51,268 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-15 05:53:51,268 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-15 05:53:51,268 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-15 05:53:51,269 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-15 05:53:51,269 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-15 05:53:51,269 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-15 05:53:51,270 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-15 05:53:51,270 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-15 05:53:51,270 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-15 05:53:51,271 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-15 05:53:51,271 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-15 05:53:51,271 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-15 05:53:51,272 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-15 05:53:51,272 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-15 05:53:51,272 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-15 05:53:51,273 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-15 05:53:51,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {5865#(<= main_~i~0 15)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-15 05:53:51,273 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-15 05:53:51,273 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-15 05:53:51,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:53:51,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:53:51,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:53:51,274 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-15 05:53:51,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:51,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#false} assume !false; {5846#false} is VALID [2022-04-15 05:53:51,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {5846#false} assume 0 == ~cond; {5846#false} is VALID [2022-04-15 05:53:51,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {5846#false} ~cond := #in~cond; {5846#false} is VALID [2022-04-15 05:53:51,773 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-15 05:53:51,773 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-15 05:53:51,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {6009#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5846#false} is VALID [2022-04-15 05:53:51,774 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-15 05:53:51,774 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-15 05:53:51,775 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-15 05:53:51,775 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-15 05:53:51,775 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-15 05:53:51,776 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-15 05:53:51,776 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-15 05:53:51,776 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-15 05:53:51,777 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-15 05:53:51,777 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-15 05:53:51,777 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-15 05:53:51,778 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-15 05:53:51,778 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-15 05:53:51,778 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-15 05:53:51,779 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-15 05:53:51,779 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-15 05:53:51,780 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-15 05:53:51,780 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-15 05:53:51,780 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-15 05:53:51,780 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-15 05:53:51,781 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-15 05:53:51,781 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-15 05:53:51,782 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-15 05:53:51,782 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-15 05:53:51,782 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-15 05:53:51,783 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-15 05:53:51,783 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-15 05:53:51,783 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-15 05:53:51,784 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-15 05:53:51,784 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-15 05:53:51,785 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-15 05:53:51,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {5845#true} call #t~ret5 := main(); {5845#true} is VALID [2022-04-15 05:53:51,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5845#true} {5845#true} #44#return; {5845#true} is VALID [2022-04-15 05:53:51,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {5845#true} assume true; {5845#true} is VALID [2022-04-15 05:53:51,785 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-15 05:53:51,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {5845#true} call ULTIMATE.init(); {5845#true} is VALID [2022-04-15 05:53:51,785 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-15 05:53:51,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79290747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:51,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:51,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:53:51,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:51,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812560007] [2022-04-15 05:53:51,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812560007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:51,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:51,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:53:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714451857] [2022-04-15 05:53:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:51,787 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-15 05:53:51,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:51,787 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-15 05:53:51,818 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-15 05:53:51,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:53:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:53:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:53:51,819 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-15 05:53:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:52,165 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:53:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:53:52,165 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-15 05:53:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:52,166 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-15 05:53:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 05:53:52,166 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-15 05:53:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2022-04-15 05:53:52,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2022-04-15 05:53:52,206 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-15 05:53:52,207 INFO L225 Difference]: With dead ends: 52 [2022-04-15 05:53:52,207 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 05:53:52,208 INFO L912 BasicCegarLoop]: 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-15 05:53:52,208 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 05:53:52,208 INFO L914 BasicCegarLoop]: 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-15 05:53:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 05:53:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 05:53:52,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:52,272 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-15 05:53:52,272 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-15 05:53:52,272 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-15 05:53:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:52,273 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:53:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 05:53:52,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:52,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:52,273 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-15 05:53:52,274 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-15 05:53:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:52,274 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 05:53:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 05:53:52,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:52,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:52,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:52,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:52,275 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-15 05:53:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 05:53:52,275 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2022-04-15 05:53:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:52,275 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 05:53:52,276 INFO L479 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-15 05:53:52,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 05:53:52,316 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-15 05:53:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 05:53:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 05:53:52,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:52,316 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:52,335 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-15 05:53:52,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 05:53:52,517 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash -142050982, now seen corresponding path program 31 times [2022-04-15 05:53:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:52,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220795594] [2022-04-15 05:53:52,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:52,520 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:52,520 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash -142050982, now seen corresponding path program 32 times [2022-04-15 05:53:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:52,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475254948] [2022-04-15 05:53:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:52,777 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-15 05:53:52,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-15 05:53:52,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-15 05:53:52,778 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-15 05:53:52,778 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-15 05:53:52,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-15 05:53:52,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-15 05:53:52,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-15 05:53:52,779 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-15 05:53:52,779 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-15 05:53:52,780 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-15 05:53:52,780 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-15 05:53:52,781 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-15 05:53:52,781 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-15 05:53:52,782 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-15 05:53:52,782 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-15 05:53:52,782 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-15 05:53:52,783 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-15 05:53:52,783 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-15 05:53:52,784 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-15 05:53:52,784 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-15 05:53:52,784 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-15 05:53:52,785 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-15 05:53:52,785 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-15 05:53:52,786 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-15 05:53:52,786 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-15 05:53:52,787 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-15 05:53:52,787 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-15 05:53:52,787 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-15 05:53:52,788 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-15 05:53:52,788 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-15 05:53:52,789 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-15 05:53:52,789 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-15 05:53:52,789 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-15 05:53:52,790 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-15 05:53:52,790 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-15 05:53:52,791 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-15 05:53:52,791 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-15 05:53:52,792 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-15 05:53:52,792 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-15 05:53:52,792 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-15 05:53:52,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {6474#(<= main_~i~0 16)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-15 05:53:52,793 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-15 05:53:52,793 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-15 05:53:52,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-15 05:53:52,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-15 05:53:52,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-15 05:53:52,794 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-15 05:53:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:52,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475254948] [2022-04-15 05:53:52,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475254948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582398847] [2022-04-15 05:53:52,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:52,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 05:53:52,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:52,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:52,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:53:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:52,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:53,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {6453#true} call ULTIMATE.init(); {6453#true} is VALID [2022-04-15 05:53:53,171 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-15 05:53:53,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-15 05:53:53,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-15 05:53:53,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-15 05:53:53,172 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-15 05:53:53,172 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-15 05:53:53,173 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-15 05:53:53,173 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-15 05:53:53,173 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-15 05:53:53,174 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-15 05:53:53,174 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-15 05:53:53,174 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-15 05:53:53,175 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-15 05:53:53,175 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-15 05:53:53,176 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-15 05:53:53,176 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-15 05:53:53,176 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-15 05:53:53,176 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-15 05:53:53,177 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-15 05:53:53,177 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-15 05:53:53,178 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-15 05:53:53,178 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-15 05:53:53,179 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-15 05:53:53,179 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-15 05:53:53,179 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-15 05:53:53,180 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-15 05:53:53,180 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-15 05:53:53,180 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-15 05:53:53,181 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-15 05:53:53,181 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-15 05:53:53,181 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-15 05:53:53,182 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-15 05:53:53,182 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-15 05:53:53,182 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-15 05:53:53,183 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-15 05:53:53,183 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-15 05:53:53,183 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-15 05:53:53,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {6474#(<= main_~i~0 16)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-15 05:53:53,188 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-15 05:53:53,188 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-15 05:53:53,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-15 05:53:53,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-15 05:53:53,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-15 05:53:53,188 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-15 05:53:53,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:53,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {6454#false} assume !false; {6454#false} is VALID [2022-04-15 05:53:53,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {6454#false} assume 0 == ~cond; {6454#false} is VALID [2022-04-15 05:53:53,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {6454#false} ~cond := #in~cond; {6454#false} is VALID [2022-04-15 05:53:53,768 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-15 05:53:53,768 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-15 05:53:53,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {6624#(< main_~i~0 2048)} assume !(~i~0 < 2048); {6454#false} is VALID [2022-04-15 05:53:53,769 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-15 05:53:53,769 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-15 05:53:53,769 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-15 05:53:53,770 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-15 05:53:53,770 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-15 05:53:53,770 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-15 05:53:53,771 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-15 05:53:53,771 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-15 05:53:53,771 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-15 05:53:53,772 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-15 05:53:53,772 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-15 05:53:53,772 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-15 05:53:53,773 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-15 05:53:53,773 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-15 05:53:53,774 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-15 05:53:53,774 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-15 05:53:53,774 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-15 05:53:53,775 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-15 05:53:53,775 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-15 05:53:53,775 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-15 05:53:53,776 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-15 05:53:53,776 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-15 05:53:53,776 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-15 05:53:53,777 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-15 05:53:53,777 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-15 05:53:53,777 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-15 05:53:53,778 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-15 05:53:53,778 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-15 05:53:53,778 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-15 05:53:53,779 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-15 05:53:53,779 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-15 05:53:53,779 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-15 05:53:53,780 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-15 05:53:53,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {6453#true} call #t~ret5 := main(); {6453#true} is VALID [2022-04-15 05:53:53,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6453#true} {6453#true} #44#return; {6453#true} is VALID [2022-04-15 05:53:53,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {6453#true} assume true; {6453#true} is VALID [2022-04-15 05:53:53,780 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-15 05:53:53,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {6453#true} call ULTIMATE.init(); {6453#true} is VALID [2022-04-15 05:53:53,781 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-15 05:53:53,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582398847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:53,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:53,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:53:53,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:53,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220795594] [2022-04-15 05:53:53,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220795594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:53,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:53,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:53:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658374035] [2022-04-15 05:53:53,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:53,782 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-15 05:53:53,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:53,782 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-15 05:53:53,811 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-15 05:53:53,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:53:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:53,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:53:53,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:53:53,812 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-15 05:53:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,185 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:53:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:53:54,185 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-15 05:53:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:54,186 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-15 05:53:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-15 05:53:54,187 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-15 05:53:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2022-04-15 05:53:54,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 54 transitions. [2022-04-15 05:53:54,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:54,234 INFO L225 Difference]: With dead ends: 54 [2022-04-15 05:53:54,234 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 05:53:54,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 05:53:54,235 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:54,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 24 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 05:53:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 05:53:54,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:54,343 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-15 05:53:54,344 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-15 05:53:54,344 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-15 05:53:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,345 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:53:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 05:53:54,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:54,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:54,345 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-15 05:53:54,346 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-15 05:53:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,347 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 05:53:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 05:53:54,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:54,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:54,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:54,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:54,347 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-15 05:53:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 05:53:54,348 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2022-04-15 05:53:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:54,348 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 05:53:54,349 INFO L479 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-15 05:53:54,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 05:53:54,397 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-15 05:53:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 05:53:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 05:53:54,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:54,398 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:54,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 05:53:54,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 05:53:54,599 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 53872380, now seen corresponding path program 33 times [2022-04-15 05:53:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:54,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406190338] [2022-04-15 05:53:54,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:54,605 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:54,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 53872380, now seen corresponding path program 34 times [2022-04-15 05:53:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899072825] [2022-04-15 05:53:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:54,823 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-15 05:53:54,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-15 05:53:54,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-15 05:53:54,824 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-15 05:53:54,824 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-15 05:53:54,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-15 05:53:54,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-15 05:53:54,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-15 05:53:54,825 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-15 05:53:54,825 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-15 05:53:54,826 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-15 05:53:54,826 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-15 05:53:54,827 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-15 05:53:54,827 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-15 05:53:54,828 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-15 05:53:54,828 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-15 05:53:54,829 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-15 05:53:54,829 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-15 05:53:54,830 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-15 05:53:54,830 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-15 05:53:54,830 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-15 05:53:54,831 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-15 05:53:54,831 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-15 05:53:54,832 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-15 05:53:54,832 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-15 05:53:54,833 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-15 05:53:54,833 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-15 05:53:54,833 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-15 05:53:54,834 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-15 05:53:54,834 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-15 05:53:54,835 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-15 05:53:54,835 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-15 05:53:54,836 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-15 05:53:54,836 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-15 05:53:54,836 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-15 05:53:54,837 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-15 05:53:54,837 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-15 05:53:54,838 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-15 05:53:54,838 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-15 05:53:54,838 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-15 05:53:54,839 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-15 05:53:54,839 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-15 05:53:54,840 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-15 05:53:54,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {7111#(<= main_~i~0 17)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-15 05:53:54,840 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-15 05:53:54,840 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-15 05:53:54,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-15 05:53:54,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-15 05:53:54,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-15 05:53:54,841 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-15 05:53:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:54,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899072825] [2022-04-15 05:53:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899072825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41630961] [2022-04-15 05:53:54,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:54,843 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-15 05:53:54,844 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-15 05:53:54,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:54,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:54,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:53:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:54,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:55,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {7089#true} call ULTIMATE.init(); {7089#true} is VALID [2022-04-15 05:53:55,201 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-15 05:53:55,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-15 05:53:55,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-15 05:53:55,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-15 05:53:55,202 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-15 05:53:55,202 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-15 05:53:55,203 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-15 05:53:55,203 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-15 05:53:55,204 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-15 05:53:55,204 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-15 05:53:55,204 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-15 05:53:55,205 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-15 05:53:55,205 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-15 05:53:55,206 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-15 05:53:55,206 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-15 05:53:55,207 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-15 05:53:55,207 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-15 05:53:55,207 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-15 05:53:55,208 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-15 05:53:55,208 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-15 05:53:55,209 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-15 05:53:55,209 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-15 05:53:55,210 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-15 05:53:55,210 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-15 05:53:55,211 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-15 05:53:55,211 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-15 05:53:55,211 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-15 05:53:55,212 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-15 05:53:55,212 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-15 05:53:55,213 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-15 05:53:55,213 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-15 05:53:55,214 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-15 05:53:55,214 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-15 05:53:55,214 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-15 05:53:55,215 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-15 05:53:55,215 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-15 05:53:55,216 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-15 05:53:55,216 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-15 05:53:55,217 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-15 05:53:55,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {7111#(<= main_~i~0 17)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-15 05:53:55,217 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-15 05:53:55,217 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-15 05:53:55,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-15 05:53:55,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-15 05:53:55,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-15 05:53:55,218 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-15 05:53:55,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:55,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {7090#false} assume !false; {7090#false} is VALID [2022-04-15 05:53:55,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {7090#false} assume 0 == ~cond; {7090#false} is VALID [2022-04-15 05:53:55,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {7090#false} ~cond := #in~cond; {7090#false} is VALID [2022-04-15 05:53:55,811 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-15 05:53:55,811 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-15 05:53:55,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {7267#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7090#false} is VALID [2022-04-15 05:53:55,812 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-15 05:53:55,812 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-15 05:53:55,812 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-15 05:53:55,813 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-15 05:53:55,813 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-15 05:53:55,813 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-15 05:53:55,814 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-15 05:53:55,814 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-15 05:53:55,814 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-15 05:53:55,815 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-15 05:53:55,815 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-15 05:53:55,815 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-15 05:53:55,816 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-15 05:53:55,816 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-15 05:53:55,816 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-15 05:53:55,817 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-15 05:53:55,817 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-15 05:53:55,817 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-15 05:53:55,818 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-15 05:53:55,818 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-15 05:53:55,819 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-15 05:53:55,820 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-15 05:53:55,820 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-15 05:53:55,821 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-15 05:53:55,821 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-15 05:53:55,822 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-15 05:53:55,822 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-15 05:53:55,823 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-15 05:53:55,823 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-15 05:53:55,823 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-15 05:53:55,824 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-15 05:53:55,824 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-15 05:53:55,825 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-15 05:53:55,825 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-15 05:53:55,826 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-15 05:53:55,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {7089#true} call #t~ret5 := main(); {7089#true} is VALID [2022-04-15 05:53:55,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #44#return; {7089#true} is VALID [2022-04-15 05:53:55,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2022-04-15 05:53:55,826 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-15 05:53:55,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {7089#true} call ULTIMATE.init(); {7089#true} is VALID [2022-04-15 05:53:55,827 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-15 05:53:55,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41630961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:55,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:55,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 05:53:55,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:55,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406190338] [2022-04-15 05:53:55,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406190338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:55,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:55,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:53:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352168155] [2022-04-15 05:53:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:55,829 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-15 05:53:55,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:55,829 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-15 05:53:55,880 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-15 05:53:55,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:53:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:53:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:53:55,881 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-15 05:53:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,313 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:53:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:53:56,313 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-15 05:53:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:56,314 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-15 05:53:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-15 05:53:56,315 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-15 05:53:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-15 05:53:56,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-15 05:53:56,361 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-15 05:53:56,362 INFO L225 Difference]: With dead ends: 56 [2022-04-15 05:53:56,362 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 05:53:56,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 05:53:56,363 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:56,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 05:53:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 05:53:56,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:56,443 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-15 05:53:56,443 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-15 05:53:56,443 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-15 05:53:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,444 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:53:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 05:53:56,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:56,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:56,444 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-15 05:53:56,444 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-15 05:53:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,445 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 05:53:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 05:53:56,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:56,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:56,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:56,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:56,446 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-15 05:53:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 05:53:56,447 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2022-04-15 05:53:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:56,447 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 05:53:56,447 INFO L479 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-15 05:53:56,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 05:53:56,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 05:53:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 05:53:56,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:56,494 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:56,511 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-15 05:53:56,694 WARN L460 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-15 05:53:56,694 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash -642337762, now seen corresponding path program 35 times [2022-04-15 05:53:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:56,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929827343] [2022-04-15 05:53:56,697 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:56,697 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:56,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash -642337762, now seen corresponding path program 36 times [2022-04-15 05:53:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:56,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874790173] [2022-04-15 05:53:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:56,928 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-15 05:53:56,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-15 05:53:56,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-15 05:53:56,929 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-15 05:53:56,929 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-15 05:53:56,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-15 05:53:56,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-15 05:53:56,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-15 05:53:56,930 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-15 05:53:56,930 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-15 05:53:56,930 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-15 05:53:56,931 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-15 05:53:56,931 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-15 05:53:56,931 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-15 05:53:56,932 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-15 05:53:56,932 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-15 05:53:56,932 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-15 05:53:56,933 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-15 05:53:56,933 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-15 05:53:56,933 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-15 05:53:56,934 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-15 05:53:56,934 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-15 05:53:56,934 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-15 05:53:56,935 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-15 05:53:56,935 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-15 05:53:56,935 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-15 05:53:56,936 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-15 05:53:56,936 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-15 05:53:56,936 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-15 05:53:56,937 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-15 05:53:56,937 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-15 05:53:56,937 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-15 05:53:56,938 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-15 05:53:56,938 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-15 05:53:56,938 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-15 05:53:56,939 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-15 05:53:56,939 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-15 05:53:56,939 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-15 05:53:56,940 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-15 05:53:56,940 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-15 05:53:56,940 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-15 05:53:56,941 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-15 05:53:56,941 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-15 05:53:56,941 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-15 05:53:56,942 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-15 05:53:56,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {7776#(<= main_~i~0 18)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-15 05:53:56,942 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-15 05:53:56,942 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-15 05:53:56,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-15 05:53:56,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-15 05:53:56,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-15 05:53:56,943 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-15 05:53:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874790173] [2022-04-15 05:53:56,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874790173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991584433] [2022-04-15 05:53:56,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:56,945 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-15 05:53:56,946 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-15 05:53:57,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 05:53:57,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:57,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 05:53:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:57,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:57,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {7753#true} call ULTIMATE.init(); {7753#true} is VALID [2022-04-15 05:53:57,537 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-15 05:53:57,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-15 05:53:57,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-15 05:53:57,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-15 05:53:57,538 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-15 05:53:57,539 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-15 05:53:57,539 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-15 05:53:57,539 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-15 05:53:57,540 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-15 05:53:57,540 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-15 05:53:57,540 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-15 05:53:57,541 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-15 05:53:57,541 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-15 05:53:57,541 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-15 05:53:57,542 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-15 05:53:57,542 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-15 05:53:57,542 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-15 05:53:57,543 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-15 05:53:57,543 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-15 05:53:57,543 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-15 05:53:57,544 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-15 05:53:57,544 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-15 05:53:57,544 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-15 05:53:57,545 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-15 05:53:57,545 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-15 05:53:57,545 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-15 05:53:57,546 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-15 05:53:57,546 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-15 05:53:57,546 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-15 05:53:57,547 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-15 05:53:57,547 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-15 05:53:57,547 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-15 05:53:57,548 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-15 05:53:57,548 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-15 05:53:57,548 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-15 05:53:57,549 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-15 05:53:57,549 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-15 05:53:57,549 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-15 05:53:57,550 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-15 05:53:57,550 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-15 05:53:57,550 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-15 05:53:57,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {7776#(<= main_~i~0 18)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-15 05:53:57,551 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-15 05:53:57,551 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-15 05:53:57,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-15 05:53:57,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-15 05:53:57,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-15 05:53:57,552 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-15 05:53:57,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:58,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-04-15 05:53:58,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume 0 == ~cond; {7754#false} is VALID [2022-04-15 05:53:58,292 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#false} ~cond := #in~cond; {7754#false} is VALID [2022-04-15 05:53:58,292 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-15 05:53:58,292 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-15 05:53:58,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {7938#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7754#false} is VALID [2022-04-15 05:53:58,293 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-15 05:53:58,293 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-15 05:53:58,293 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-15 05:53:58,294 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-15 05:53:58,294 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-15 05:53:58,294 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-15 05:53:58,295 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-15 05:53:58,295 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-15 05:53:58,295 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-15 05:53:58,296 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-15 05:53:58,296 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-15 05:53:58,296 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-15 05:53:58,297 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-15 05:53:58,297 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-15 05:53:58,297 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-15 05:53:58,298 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-15 05:53:58,298 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-15 05:53:58,298 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-15 05:53:58,299 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-15 05:53:58,299 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-15 05:53:58,300 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-15 05:53:58,300 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-15 05:53:58,301 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-15 05:53:58,301 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-15 05:53:58,301 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-15 05:53:58,302 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-15 05:53:58,302 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-15 05:53:58,303 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-15 05:53:58,303 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-15 05:53:58,303 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-15 05:53:58,304 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-15 05:53:58,304 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-15 05:53:58,305 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-15 05:53:58,305 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-15 05:53:58,306 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-15 05:53:58,306 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-15 05:53:58,307 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-15 05:53:58,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call #t~ret5 := main(); {7753#true} is VALID [2022-04-15 05:53:58,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #44#return; {7753#true} is VALID [2022-04-15 05:53:58,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-04-15 05:53:58,307 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-15 05:53:58,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {7753#true} call ULTIMATE.init(); {7753#true} is VALID [2022-04-15 05:53:58,308 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-15 05:53:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991584433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:58,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:58,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 05:53:58,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:58,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929827343] [2022-04-15 05:53:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929827343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:58,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:58,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:53:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132965951] [2022-04-15 05:53:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:58,309 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-15 05:53:58,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:58,310 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-15 05:53:58,343 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-15 05:53:58,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:53:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:58,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:53:58,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:53:58,345 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-15 05:53:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:58,825 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:53:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:53:58,825 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-15 05:53:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:58,825 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-15 05:53:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-15 05:53:58,827 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-15 05:53:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-15 05:53:58,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-15 05:53:58,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:58,882 INFO L225 Difference]: With dead ends: 58 [2022-04-15 05:53:58,882 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 05:53:58,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 05:53:58,884 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:58,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 05:53:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-15 05:53:58,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:58,988 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-15 05:53:58,988 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-15 05:53:58,988 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-15 05:53:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:58,992 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:53:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 05:53:58,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:58,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:58,992 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-15 05:53:58,992 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-15 05:53:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:58,993 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 05:53:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 05:53:58,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:58,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:58,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:58,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:58,994 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-15 05:53:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 05:53:58,995 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2022-04-15 05:53:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:58,995 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 05:53:58,995 INFO L479 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-15 05:53:58,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 05:53:59,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 05:53:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:53:59,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:59,063 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:59,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 05:53:59,263 WARN L460 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-15 05:53:59,264 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 314613952, now seen corresponding path program 37 times [2022-04-15 05:53:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:59,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532769671] [2022-04-15 05:53:59,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:59,266 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:59,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash 314613952, now seen corresponding path program 38 times [2022-04-15 05:53:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:59,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867388192] [2022-04-15 05:53:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:59,532 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-15 05:53:59,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-15 05:53:59,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-15 05:53:59,533 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-15 05:53:59,533 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-15 05:53:59,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-15 05:53:59,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-15 05:53:59,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-15 05:53:59,534 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-15 05:53:59,534 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-15 05:53:59,534 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-15 05:53:59,535 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-15 05:53:59,535 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-15 05:53:59,536 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-15 05:53:59,536 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-15 05:53:59,537 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-15 05:53:59,537 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-15 05:53:59,537 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-15 05:53:59,538 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-15 05:53:59,538 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-15 05:53:59,539 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-15 05:53:59,539 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-15 05:53:59,539 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-15 05:53:59,540 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-15 05:53:59,540 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-15 05:53:59,541 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-15 05:53:59,541 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-15 05:53:59,541 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-15 05:53:59,542 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-15 05:53:59,542 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-15 05:53:59,543 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-15 05:53:59,543 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-15 05:53:59,544 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-15 05:53:59,544 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-15 05:53:59,545 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-15 05:53:59,545 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-15 05:53:59,545 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-15 05:53:59,546 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-15 05:53:59,546 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-15 05:53:59,547 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-15 05:53:59,547 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-15 05:53:59,548 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-15 05:53:59,548 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-15 05:53:59,548 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-15 05:53:59,549 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-15 05:53:59,549 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-15 05:53:59,550 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-15 05:53:59,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {8469#(<= main_~i~0 19)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-15 05:53:59,550 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-15 05:53:59,550 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-15 05:53:59,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-15 05:53:59,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-15 05:53:59,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-15 05:53:59,551 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-15 05:53:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867388192] [2022-04-15 05:53:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867388192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601191113] [2022-04-15 05:53:59,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:59,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:59,553 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-15 05:53:59,555 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-15 05:53:59,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:59,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:59,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:53:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:59,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:00,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8445#true} is VALID [2022-04-15 05:54:00,000 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-15 05:54:00,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-15 05:54:00,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-15 05:54:00,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-15 05:54:00,001 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-15 05:54:00,001 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-15 05:54:00,002 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-15 05:54:00,002 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-15 05:54:00,003 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-15 05:54:00,003 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-15 05:54:00,003 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-15 05:54:00,004 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-15 05:54:00,004 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-15 05:54:00,004 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-15 05:54:00,005 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-15 05:54:00,005 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-15 05:54:00,005 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-15 05:54:00,006 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-15 05:54:00,006 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-15 05:54:00,006 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-15 05:54:00,007 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-15 05:54:00,007 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-15 05:54:00,007 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-15 05:54:00,008 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-15 05:54:00,008 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-15 05:54:00,008 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-15 05:54:00,009 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-15 05:54:00,009 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-15 05:54:00,009 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-15 05:54:00,010 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-15 05:54:00,010 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-15 05:54:00,010 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-15 05:54:00,011 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-15 05:54:00,011 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-15 05:54:00,011 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-15 05:54:00,012 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-15 05:54:00,012 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-15 05:54:00,012 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-15 05:54:00,013 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-15 05:54:00,013 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-15 05:54:00,013 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-15 05:54:00,014 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-15 05:54:00,014 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-15 05:54:00,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {8469#(<= main_~i~0 19)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-15 05:54:00,014 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-15 05:54:00,015 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-15 05:54:00,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-15 05:54:00,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-15 05:54:00,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-15 05:54:00,015 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-15 05:54:00,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:00,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {8446#false} assume !false; {8446#false} is VALID [2022-04-15 05:54:00,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {8446#false} assume 0 == ~cond; {8446#false} is VALID [2022-04-15 05:54:00,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {8446#false} ~cond := #in~cond; {8446#false} is VALID [2022-04-15 05:54:00,738 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-15 05:54:00,738 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-15 05:54:00,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {8637#(< main_~i~0 2048)} assume !(~i~0 < 2048); {8446#false} is VALID [2022-04-15 05:54:00,739 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-15 05:54:00,739 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-15 05:54:00,740 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-15 05:54:00,740 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-15 05:54:00,741 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-15 05:54:00,741 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-15 05:54:00,741 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-15 05:54:00,742 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-15 05:54:00,742 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-15 05:54:00,743 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-15 05:54:00,743 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-15 05:54:00,743 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-15 05:54:00,744 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-15 05:54:00,744 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-15 05:54:00,745 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-15 05:54:00,745 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-15 05:54:00,746 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-15 05:54:00,746 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-15 05:54:00,746 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-15 05:54:00,747 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-15 05:54:00,747 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-15 05:54:00,748 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-15 05:54:00,748 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-15 05:54:00,749 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-15 05:54:00,749 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-15 05:54:00,750 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-15 05:54:00,750 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-15 05:54:00,750 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-15 05:54:00,761 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-15 05:54:00,761 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-15 05:54:00,762 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-15 05:54:00,762 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-15 05:54:00,762 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-15 05:54:00,763 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-15 05:54:00,763 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-15 05:54:00,764 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-15 05:54:00,764 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-15 05:54:00,765 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-15 05:54:00,766 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-15 05:54:00,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {8445#true} call #t~ret5 := main(); {8445#true} is VALID [2022-04-15 05:54:00,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8445#true} {8445#true} #44#return; {8445#true} is VALID [2022-04-15 05:54:00,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#true} assume true; {8445#true} is VALID [2022-04-15 05:54:00,766 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-15 05:54:00,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {8445#true} call ULTIMATE.init(); {8445#true} is VALID [2022-04-15 05:54:00,767 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-15 05:54:00,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601191113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:00,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:00,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 05:54:00,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:00,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532769671] [2022-04-15 05:54:00,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532769671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:00,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:00,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:54:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956873642] [2022-04-15 05:54:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:00,770 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-15 05:54:00,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:00,770 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-15 05:54:00,815 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-15 05:54:00,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:54:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:54:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:54:00,816 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-15 05:54:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:01,295 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:54:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:54:01,296 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-15 05:54:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:01,296 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-15 05:54:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-15 05:54:01,298 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-15 05:54:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-15 05:54:01,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-15 05:54:01,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:01,349 INFO L225 Difference]: With dead ends: 60 [2022-04-15 05:54:01,349 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 05:54:01,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 05:54:01,351 INFO L913 BasicCegarLoop]: 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-15 05:54:01,351 INFO L914 BasicCegarLoop]: 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-15 05:54:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 05:54:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 05:54:01,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:01,450 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-15 05:54:01,451 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-15 05:54:01,451 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-15 05:54:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:01,452 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:54:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 05:54:01,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:01,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:01,452 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-15 05:54:01,453 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-15 05:54:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:01,454 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 05:54:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 05:54:01,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:01,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:01,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:01,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:01,454 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-15 05:54:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 05:54:01,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2022-04-15 05:54:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:01,456 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 05:54:01,456 INFO L479 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-15 05:54:01,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 05:54:01,514 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-15 05:54:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 05:54:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 05:54:01,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:01,514 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:01,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:01,715 WARN L460 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-15 05:54:01,715 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash 822209762, now seen corresponding path program 39 times [2022-04-15 05:54:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831485172] [2022-04-15 05:54:01,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:01,718 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:01,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 822209762, now seen corresponding path program 40 times [2022-04-15 05:54:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:01,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306792394] [2022-04-15 05:54:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:01,986 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-15 05:54:01,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-15 05:54:01,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-15 05:54:01,988 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-15 05:54:01,988 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-15 05:54:01,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-15 05:54:01,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-15 05:54:01,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-15 05:54:01,988 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-15 05:54:01,989 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-15 05:54:01,989 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-15 05:54:01,990 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-15 05:54:01,990 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-15 05:54:01,990 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-15 05:54:01,991 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-15 05:54:01,991 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-15 05:54:01,992 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-15 05:54:01,992 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-15 05:54:01,993 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-15 05:54:01,993 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-15 05:54:01,993 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-15 05:54:01,994 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-15 05:54:01,994 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-15 05:54:01,995 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-15 05:54:01,995 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-15 05:54:01,996 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-15 05:54:01,996 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-15 05:54:01,997 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-15 05:54:01,997 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-15 05:54:01,997 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-15 05:54:01,998 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-15 05:54:01,998 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-15 05:54:01,999 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-15 05:54:01,999 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-15 05:54:02,000 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-15 05:54:02,000 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-15 05:54:02,000 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-15 05:54:02,001 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-15 05:54:02,001 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-15 05:54:02,002 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-15 05:54:02,002 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-15 05:54:02,002 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-15 05:54:02,003 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-15 05:54:02,003 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-15 05:54:02,004 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-15 05:54:02,004 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-15 05:54:02,005 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-15 05:54:02,005 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-15 05:54:02,006 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-15 05:54:02,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {9190#(<= main_~i~0 20)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-15 05:54:02,006 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-15 05:54:02,006 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-15 05:54:02,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-15 05:54:02,006 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-15 05:54:02,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-15 05:54:02,007 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-15 05:54:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:02,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306792394] [2022-04-15 05:54:02,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306792394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:02,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013206119] [2022-04-15 05:54:02,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:02,012 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-15 05:54:02,042 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-15 05:54:02,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:02,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:02,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 05:54:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:02,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:02,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2022-04-15 05:54:02,484 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-15 05:54:02,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-15 05:54:02,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-15 05:54:02,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-15 05:54:02,485 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-15 05:54:02,485 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-15 05:54:02,486 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-15 05:54:02,486 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-15 05:54:02,486 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-15 05:54:02,487 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-15 05:54:02,487 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-15 05:54:02,487 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-15 05:54:02,488 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-15 05:54:02,488 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-15 05:54:02,488 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-15 05:54:02,489 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-15 05:54:02,489 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-15 05:54:02,489 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-15 05:54:02,490 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-15 05:54:02,490 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-15 05:54:02,490 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-15 05:54:02,491 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-15 05:54:02,491 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-15 05:54:02,491 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-15 05:54:02,492 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-15 05:54:02,492 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-15 05:54:02,492 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-15 05:54:02,493 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-15 05:54:02,493 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-15 05:54:02,493 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-15 05:54:02,494 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-15 05:54:02,494 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-15 05:54:02,494 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-15 05:54:02,495 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-15 05:54:02,495 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-15 05:54:02,495 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-15 05:54:02,496 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-15 05:54:02,496 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-15 05:54:02,497 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-15 05:54:02,497 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-15 05:54:02,497 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-15 05:54:02,497 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-15 05:54:02,498 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-15 05:54:02,498 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-15 05:54:02,499 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-15 05:54:02,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {9190#(<= main_~i~0 20)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-15 05:54:02,499 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-15 05:54:02,499 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-15 05:54:02,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-15 05:54:02,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-15 05:54:02,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-15 05:54:02,500 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-15 05:54:02,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:03,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2022-04-15 05:54:03,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {9166#false} assume 0 == ~cond; {9166#false} is VALID [2022-04-15 05:54:03,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2022-04-15 05:54:03,245 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-15 05:54:03,245 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-15 05:54:03,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {9364#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9166#false} is VALID [2022-04-15 05:54:03,246 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-15 05:54:03,246 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-15 05:54:03,247 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-15 05:54:03,247 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-15 05:54:03,248 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-15 05:54:03,248 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-15 05:54:03,248 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-15 05:54:03,249 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-15 05:54:03,249 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-15 05:54:03,250 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-15 05:54:03,250 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-15 05:54:03,251 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-15 05:54:03,251 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-15 05:54:03,251 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-15 05:54:03,252 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-15 05:54:03,252 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-15 05:54:03,253 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-15 05:54:03,253 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-15 05:54:03,254 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-15 05:54:03,254 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-15 05:54:03,254 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-15 05:54:03,255 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-15 05:54:03,255 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-15 05:54:03,256 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-15 05:54:03,256 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-15 05:54:03,257 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-15 05:54:03,257 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-15 05:54:03,257 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-15 05:54:03,258 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-15 05:54:03,258 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-15 05:54:03,259 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-15 05:54:03,259 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-15 05:54:03,260 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-15 05:54:03,260 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-15 05:54:03,261 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-15 05:54:03,261 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-15 05:54:03,261 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-15 05:54:03,262 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-15 05:54:03,262 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-15 05:54:03,263 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-15 05:54:03,263 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-15 05:54:03,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret5 := main(); {9165#true} is VALID [2022-04-15 05:54:03,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #44#return; {9165#true} is VALID [2022-04-15 05:54:03,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2022-04-15 05:54:03,264 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-15 05:54:03,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2022-04-15 05:54:03,264 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-15 05:54:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013206119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:03,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:03,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 05:54:03,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831485172] [2022-04-15 05:54:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831485172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:03,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:03,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:54:03,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736004921] [2022-04-15 05:54:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:03,266 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-15 05:54:03,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:03,267 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-15 05:54:03,310 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-15 05:54:03,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:54:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:54:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:54:03,312 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-15 05:54:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:03,819 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:54:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:54:03,819 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-15 05:54:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:03,820 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-15 05:54:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-15 05:54:03,821 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-15 05:54:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-15 05:54:03,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions. [2022-04-15 05:54:03,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:03,874 INFO L225 Difference]: With dead ends: 62 [2022-04-15 05:54:03,874 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 05:54:03,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 05:54:03,876 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 05:54:03,876 INFO L914 BasicCegarLoop]: 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-15 05:54:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 05:54:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-15 05:54:03,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:03,995 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-15 05:54:03,995 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-15 05:54:03,995 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-15 05:54:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:03,996 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:54:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 05:54:03,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:03,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:03,996 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-15 05:54:03,996 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-15 05:54:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:03,997 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 05:54:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 05:54:03,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:03,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:03,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:03,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:03,998 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-15 05:54:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 05:54:03,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2022-04-15 05:54:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:03,999 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 05:54:03,999 INFO L479 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-15 05:54:03,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 05:54:04,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 05:54:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 05:54:04,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:04,068 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:04,086 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-15 05:54:04,268 WARN L460 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-15 05:54:04,269 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1004488572, now seen corresponding path program 41 times [2022-04-15 05:54:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:04,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147411324] [2022-04-15 05:54:04,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:04,274 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:04,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1004488572, now seen corresponding path program 42 times [2022-04-15 05:54:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:04,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903344065] [2022-04-15 05:54:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:04,574 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-15 05:54:04,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-15 05:54:04,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-15 05:54:04,575 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-15 05:54:04,575 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-15 05:54:04,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-15 05:54:04,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-15 05:54:04,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-15 05:54:04,575 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-15 05:54:04,576 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-15 05:54:04,576 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-15 05:54:04,576 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-15 05:54:04,577 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-15 05:54:04,577 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-15 05:54:04,577 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-15 05:54:04,578 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-15 05:54:04,578 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-15 05:54:04,578 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-15 05:54:04,579 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-15 05:54:04,579 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-15 05:54:04,579 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-15 05:54:04,580 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-15 05:54:04,580 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-15 05:54:04,580 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-15 05:54:04,581 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-15 05:54:04,581 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-15 05:54:04,581 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-15 05:54:04,582 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-15 05:54:04,582 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-15 05:54:04,582 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-15 05:54:04,583 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-15 05:54:04,583 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-15 05:54:04,583 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-15 05:54:04,584 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-15 05:54:04,584 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-15 05:54:04,584 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-15 05:54:04,585 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-15 05:54:04,585 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-15 05:54:04,585 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-15 05:54:04,586 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-15 05:54:04,586 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-15 05:54:04,586 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-15 05:54:04,587 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-15 05:54:04,587 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-15 05:54:04,587 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-15 05:54:04,588 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-15 05:54:04,588 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-15 05:54:04,588 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-15 05:54:04,589 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-15 05:54:04,589 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-15 05:54:04,589 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-15 05:54:04,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {9939#(<= main_~i~0 21)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-15 05:54:04,590 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-15 05:54:04,590 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-15 05:54:04,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-15 05:54:04,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-15 05:54:04,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-15 05:54:04,591 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-15 05:54:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903344065] [2022-04-15 05:54:04,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903344065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870517993] [2022-04-15 05:54:04,591 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:04,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:04,592 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-15 05:54:04,593 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-15 05:54:05,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 05:54:05,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:05,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:54:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:05,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:05,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {9913#true} call ULTIMATE.init(); {9913#true} is VALID [2022-04-15 05:54:05,624 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-15 05:54:05,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-15 05:54:05,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-15 05:54:05,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-15 05:54:05,625 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-15 05:54:05,625 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-15 05:54:05,626 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-15 05:54:05,626 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-15 05:54:05,627 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-15 05:54:05,627 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-15 05:54:05,627 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-15 05:54:05,628 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-15 05:54:05,628 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-15 05:54:05,628 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-15 05:54:05,629 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-15 05:54:05,630 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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,633 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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,634 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-15 05:54:05,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-15 05:54:05,635 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-15 05:54:05,635 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-15 05:54:05,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-15 05:54:05,636 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-15 05:54:05,636 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-15 05:54:05,636 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-15 05:54:05,637 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-15 05:54:05,637 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-15 05:54:05,638 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-15 05:54:05,638 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-15 05:54:05,638 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-15 05:54:05,639 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-15 05:54:05,639 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-15 05:54:05,639 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-15 05:54:05,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-15 05:54:05,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-15 05:54:05,641 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-15 05:54:05,642 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-15 05:54:05,642 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-15 05:54:05,643 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-15 05:54:05,644 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-15 05:54:05,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {9939#(<= main_~i~0 21)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-15 05:54:05,644 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-15 05:54:05,644 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-15 05:54:05,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-15 05:54:05,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-15 05:54:05,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-15 05:54:05,645 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-15 05:54:05,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:06,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {9914#false} assume !false; {9914#false} is VALID [2022-04-15 05:54:06,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {9914#false} assume 0 == ~cond; {9914#false} is VALID [2022-04-15 05:54:06,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {9914#false} ~cond := #in~cond; {9914#false} is VALID [2022-04-15 05:54:06,470 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-15 05:54:06,470 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-15 05:54:06,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9914#false} is VALID [2022-04-15 05:54:06,471 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-15 05:54:06,472 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-15 05:54:06,472 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-15 05:54:06,473 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-15 05:54:06,473 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-15 05:54:06,474 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-15 05:54:06,474 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-15 05:54:06,474 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-15 05:54:06,475 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-15 05:54:06,475 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-15 05:54:06,476 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-15 05:54:06,476 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-15 05:54:06,477 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-15 05:54:06,477 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-15 05:54:06,477 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-15 05:54:06,478 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-15 05:54:06,478 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-15 05:54:06,479 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-15 05:54:06,479 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-15 05:54:06,480 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-15 05:54:06,480 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-15 05:54:06,480 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-15 05:54:06,481 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-15 05:54:06,481 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-15 05:54:06,482 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-15 05:54:06,482 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-15 05:54:06,483 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-15 05:54:06,483 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-15 05:54:06,483 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-15 05:54:06,484 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-15 05:54:06,484 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-15 05:54:06,484 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-15 05:54:06,485 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-15 05:54:06,485 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-15 05:54:06,485 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-15 05:54:06,486 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-15 05:54:06,486 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-15 05:54:06,486 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-15 05:54:06,487 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-15 05:54:06,487 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-15 05:54:06,488 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-15 05:54:06,488 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-15 05:54:06,488 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-15 05:54:06,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {9913#true} call #t~ret5 := main(); {9913#true} is VALID [2022-04-15 05:54:06,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9913#true} {9913#true} #44#return; {9913#true} is VALID [2022-04-15 05:54:06,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {9913#true} assume true; {9913#true} is VALID [2022-04-15 05:54:06,489 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-15 05:54:06,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {9913#true} call ULTIMATE.init(); {9913#true} is VALID [2022-04-15 05:54:06,489 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-15 05:54:06,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870517993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:06,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 05:54:06,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147411324] [2022-04-15 05:54:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147411324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:06,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 05:54:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160572809] [2022-04-15 05:54:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:06,491 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-15 05:54:06,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:06,491 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-15 05:54:06,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:06,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 05:54:06,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 05:54:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:54:06,529 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-15 05:54:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:07,081 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:54:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 05:54:07,081 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-15 05:54:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:07,082 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-15 05:54:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-15 05:54:07,083 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-15 05:54:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2022-04-15 05:54:07,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2022-04-15 05:54:07,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:07,151 INFO L225 Difference]: With dead ends: 64 [2022-04-15 05:54:07,151 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 05:54:07,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:54:07,153 INFO L913 BasicCegarLoop]: 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-15 05:54:07,153 INFO L914 BasicCegarLoop]: 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-15 05:54:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 05:54:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-15 05:54:07,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:07,274 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-15 05:54:07,274 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-15 05:54:07,274 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-15 05:54:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:07,275 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:54:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 05:54:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:07,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:07,276 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-15 05:54:07,276 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-15 05:54:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:07,277 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 05:54:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 05:54:07,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:07,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:07,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:07,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:07,278 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-15 05:54:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-15 05:54:07,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2022-04-15 05:54:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:07,279 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-15 05:54:07,279 INFO L479 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-15 05:54:07,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-15 05:54:07,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 05:54:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 05:54:07,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:07,336 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:07,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 05:54:07,539 WARN L460 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-15 05:54:07,539 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash 180036518, now seen corresponding path program 43 times [2022-04-15 05:54:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:07,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448390587] [2022-04-15 05:54:07,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:07,542 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:07,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash 180036518, now seen corresponding path program 44 times [2022-04-15 05:54:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:07,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663810489] [2022-04-15 05:54:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:07,828 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-15 05:54:07,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-15 05:54:07,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-15 05:54:07,829 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-15 05:54:07,829 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-15 05:54:07,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-15 05:54:07,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-15 05:54:07,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-15 05:54:07,830 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-15 05:54:07,830 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-15 05:54:07,830 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-15 05:54:07,831 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-15 05:54:07,831 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-15 05:54:07,831 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-15 05:54:07,832 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-15 05:54:07,832 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-15 05:54:07,832 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-15 05:54:07,833 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-15 05:54:07,833 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-15 05:54:07,833 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-15 05:54:07,834 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-15 05:54:07,834 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-15 05:54:07,834 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-15 05:54:07,835 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-15 05:54:07,835 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-15 05:54:07,835 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-15 05:54:07,836 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-15 05:54:07,836 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-15 05:54:07,836 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-15 05:54:07,837 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-15 05:54:07,837 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-15 05:54:07,837 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-15 05:54:07,838 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-15 05:54:07,838 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-15 05:54:07,838 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-15 05:54:07,839 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-15 05:54:07,839 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-15 05:54:07,839 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-15 05:54:07,840 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-15 05:54:07,840 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-15 05:54:07,840 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-15 05:54:07,841 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-15 05:54:07,841 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-15 05:54:07,841 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-15 05:54:07,842 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-15 05:54:07,842 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-15 05:54:07,842 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-15 05:54:07,843 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-15 05:54:07,844 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-15 05:54:07,844 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-15 05:54:07,844 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-15 05:54:07,845 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-15 05:54:07,845 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-15 05:54:07,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {10716#(<= main_~i~0 22)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-15 05:54:07,845 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-15 05:54:07,845 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-15 05:54:07,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-15 05:54:07,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-15 05:54:07,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-15 05:54:07,846 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-15 05:54:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663810489] [2022-04-15 05:54:07,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663810489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499670359] [2022-04-15 05:54:07,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:07,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:07,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:07,848 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-15 05:54:07,849 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-15 05:54:07,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:07,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:07,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:54:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:07,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:08,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {10689#true} call ULTIMATE.init(); {10689#true} is VALID [2022-04-15 05:54:08,304 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-15 05:54:08,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-15 05:54:08,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-15 05:54:08,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-15 05:54:08,304 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-15 05:54:08,305 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-15 05:54:08,305 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-15 05:54:08,305 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-15 05:54:08,306 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-15 05:54:08,307 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-15 05:54:08,307 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-15 05:54:08,307 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-15 05:54:08,308 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-15 05:54:08,308 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-15 05:54:08,308 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-15 05:54:08,309 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-15 05:54:08,309 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-15 05:54:08,309 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-15 05:54:08,310 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-15 05:54:08,310 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-15 05:54:08,310 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-15 05:54:08,311 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-15 05:54:08,311 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-15 05:54:08,311 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-15 05:54:08,312 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-15 05:54:08,312 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-15 05:54:08,312 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-15 05:54:08,313 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-15 05:54:08,313 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-15 05:54:08,313 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-15 05:54:08,314 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-15 05:54:08,314 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-15 05:54:08,314 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-15 05:54:08,315 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-15 05:54:08,315 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-15 05:54:08,315 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-15 05:54:08,316 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-15 05:54:08,316 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-15 05:54:08,316 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-15 05:54:08,317 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-15 05:54:08,317 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-15 05:54:08,317 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-15 05:54:08,318 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-15 05:54:08,318 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-15 05:54:08,319 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-15 05:54:08,319 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-15 05:54:08,319 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-15 05:54:08,320 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-15 05:54:08,320 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-15 05:54:08,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {10716#(<= main_~i~0 22)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-15 05:54:08,321 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-15 05:54:08,321 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-15 05:54:08,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-15 05:54:08,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-15 05:54:08,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-15 05:54:08,321 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-15 05:54:08,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:09,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {10690#false} assume !false; {10690#false} is VALID [2022-04-15 05:54:09,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {10690#false} assume 0 == ~cond; {10690#false} is VALID [2022-04-15 05:54:09,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {10690#false} ~cond := #in~cond; {10690#false} is VALID [2022-04-15 05:54:09,150 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-15 05:54:09,150 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-15 05:54:09,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {10902#(< main_~i~0 2048)} assume !(~i~0 < 2048); {10690#false} is VALID [2022-04-15 05:54:09,151 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-15 05:54:09,152 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-15 05:54:09,152 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-15 05:54:09,152 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-15 05:54:09,153 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-15 05:54:09,153 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-15 05:54:09,153 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-15 05:54:09,154 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-15 05:54:09,154 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-15 05:54:09,154 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-15 05:54:09,155 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-15 05:54:09,155 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-15 05:54:09,155 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-15 05:54:09,156 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-15 05:54:09,156 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-15 05:54:09,156 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-15 05:54:09,157 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-15 05:54:09,157 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-15 05:54:09,157 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-15 05:54:09,158 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-15 05:54:09,158 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-15 05:54:09,158 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-15 05:54:09,159 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-15 05:54:09,159 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-15 05:54:09,159 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-15 05:54:09,160 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-15 05:54:09,160 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-15 05:54:09,160 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-15 05:54:09,161 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-15 05:54:09,161 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-15 05:54:09,162 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-15 05:54:09,162 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-15 05:54:09,162 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-15 05:54:09,162 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-15 05:54:09,163 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-15 05:54:09,163 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-15 05:54:09,164 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-15 05:54:09,164 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-15 05:54:09,164 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-15 05:54:09,165 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-15 05:54:09,165 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-15 05:54:09,165 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-15 05:54:09,166 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-15 05:54:09,166 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-15 05:54:09,166 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-15 05:54:09,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {10689#true} call #t~ret5 := main(); {10689#true} is VALID [2022-04-15 05:54:09,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10689#true} {10689#true} #44#return; {10689#true} is VALID [2022-04-15 05:54:09,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {10689#true} assume true; {10689#true} is VALID [2022-04-15 05:54:09,167 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-15 05:54:09,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {10689#true} call ULTIMATE.init(); {10689#true} is VALID [2022-04-15 05:54:09,167 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-15 05:54:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499670359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:09,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 05:54:09,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448390587] [2022-04-15 05:54:09,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448390587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:09,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 05:54:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544507154] [2022-04-15 05:54:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:09,169 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-15 05:54:09,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:09,169 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-15 05:54:09,206 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-15 05:54:09,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 05:54:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 05:54:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:54:09,208 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-15 05:54:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:09,766 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:54:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 05:54:09,766 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-15 05:54:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:09,766 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-15 05:54:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-15 05:54:09,767 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-15 05:54:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-15 05:54:09,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-15 05:54:09,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:09,822 INFO L225 Difference]: With dead ends: 66 [2022-04-15 05:54:09,822 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 05:54:09,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 05:54:09,824 INFO L913 BasicCegarLoop]: 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-15 05:54:09,824 INFO L914 BasicCegarLoop]: 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-15 05:54:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 05:54:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 05:54:09,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:09,946 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-15 05:54:09,946 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-15 05:54:09,946 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-15 05:54:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:09,947 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:54:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 05:54:09,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:09,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:09,948 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-15 05:54:09,948 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-15 05:54:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:09,949 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 05:54:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 05:54:09,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:09,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:09,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:09,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:09,950 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-15 05:54:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 05:54:09,951 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2022-04-15 05:54:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:09,951 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 05:54:09,951 INFO L479 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-15 05:54:09,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 05:54:10,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 05:54:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 05:54:10,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:10,048 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:10,074 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-15 05:54:10,263 WARN L460 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-15 05:54:10,264 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 342314568, now seen corresponding path program 45 times [2022-04-15 05:54:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:10,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415342851] [2022-04-15 05:54:10,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:10,267 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:10,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 342314568, now seen corresponding path program 46 times [2022-04-15 05:54:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110562759] [2022-04-15 05:54:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:10,616 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-15 05:54:10,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-15 05:54:10,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-15 05:54:10,617 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-15 05:54:10,617 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-15 05:54:10,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-15 05:54:10,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-15 05:54:10,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-15 05:54:10,618 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-15 05:54:10,618 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-15 05:54:10,619 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-15 05:54:10,619 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-15 05:54:10,620 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-15 05:54:10,620 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-15 05:54:10,620 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-15 05:54:10,621 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-15 05:54:10,621 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-15 05:54:10,621 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-15 05:54:10,622 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-15 05:54:10,622 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-15 05:54:10,622 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-15 05:54:10,623 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-15 05:54:10,623 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-15 05:54:10,623 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-15 05:54:10,624 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-15 05:54:10,624 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-15 05:54:10,624 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-15 05:54:10,625 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-15 05:54:10,625 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-15 05:54:10,625 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-15 05:54:10,626 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-15 05:54:10,626 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-15 05:54:10,626 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-15 05:54:10,627 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-15 05:54:10,627 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-15 05:54:10,627 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-15 05:54:10,628 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-15 05:54:10,628 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-15 05:54:10,628 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-15 05:54:10,629 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-15 05:54:10,629 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-15 05:54:10,629 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-15 05:54:10,630 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-15 05:54:10,630 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-15 05:54:10,630 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-15 05:54:10,631 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-15 05:54:10,631 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-15 05:54:10,631 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-15 05:54:10,632 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-15 05:54:10,632 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-15 05:54:10,632 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-15 05:54:10,633 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-15 05:54:10,633 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-15 05:54:10,633 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-15 05:54:10,634 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-15 05:54:10,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {11521#(<= main_~i~0 23)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-15 05:54:10,634 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-15 05:54:10,634 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-15 05:54:10,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-15 05:54:10,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-15 05:54:10,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-15 05:54:10,635 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-15 05:54:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:10,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110562759] [2022-04-15 05:54:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110562759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:10,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233102736] [2022-04-15 05:54:10,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:10,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:10,636 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-15 05:54:10,637 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-15 05:54:10,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:10,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:10,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:54:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:10,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:11,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {11493#true} call ULTIMATE.init(); {11493#true} is VALID [2022-04-15 05:54:11,097 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-15 05:54:11,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-15 05:54:11,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-15 05:54:11,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-15 05:54:11,098 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-15 05:54:11,098 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-15 05:54:11,099 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-15 05:54:11,099 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-15 05:54:11,099 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-15 05:54:11,100 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-15 05:54:11,100 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-15 05:54:11,100 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-15 05:54:11,101 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-15 05:54:11,101 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-15 05:54:11,101 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-15 05:54:11,102 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-15 05:54:11,102 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-15 05:54:11,102 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-15 05:54:11,103 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-15 05:54:11,103 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-15 05:54:11,103 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-15 05:54:11,104 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-15 05:54:11,104 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-15 05:54:11,104 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-15 05:54:11,105 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-15 05:54:11,105 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-15 05:54:11,105 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-15 05:54:11,106 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-15 05:54:11,106 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-15 05:54:11,106 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-15 05:54:11,107 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-15 05:54:11,107 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-15 05:54:11,107 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-15 05:54:11,108 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-15 05:54:11,108 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-15 05:54:11,108 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-15 05:54:11,109 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-15 05:54:11,109 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-15 05:54:11,110 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-15 05:54:11,110 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-15 05:54:11,110 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-15 05:54:11,110 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-15 05:54:11,111 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-15 05:54:11,111 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-15 05:54:11,112 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-15 05:54:11,112 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-15 05:54:11,112 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-15 05:54:11,113 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-15 05:54:11,113 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-15 05:54:11,113 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-15 05:54:11,114 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-15 05:54:11,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {11521#(<= main_~i~0 23)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-15 05:54:11,114 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-15 05:54:11,114 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-15 05:54:11,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-15 05:54:11,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-15 05:54:11,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-15 05:54:11,115 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-15 05:54:11,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:11,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {11494#false} assume !false; {11494#false} is VALID [2022-04-15 05:54:11,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {11494#false} assume 0 == ~cond; {11494#false} is VALID [2022-04-15 05:54:11,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {11494#false} ~cond := #in~cond; {11494#false} is VALID [2022-04-15 05:54:11,998 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-15 05:54:11,998 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-15 05:54:11,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {11713#(< main_~i~0 2048)} assume !(~i~0 < 2048); {11494#false} is VALID [2022-04-15 05:54:11,998 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-15 05:54:11,999 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-15 05:54:11,999 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-15 05:54:11,999 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-15 05:54:12,000 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-15 05:54:12,000 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-15 05:54:12,000 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-15 05:54:12,001 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-15 05:54:12,001 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-15 05:54:12,001 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-15 05:54:12,002 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-15 05:54:12,002 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-15 05:54:12,002 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-15 05:54:12,003 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-15 05:54:12,003 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-15 05:54:12,003 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-15 05:54:12,004 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-15 05:54:12,004 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-15 05:54:12,005 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-15 05:54:12,005 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-15 05:54:12,005 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-15 05:54:12,006 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-15 05:54:12,006 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-15 05:54:12,006 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-15 05:54:12,007 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-15 05:54:12,007 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-15 05:54:12,007 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-15 05:54:12,008 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-15 05:54:12,008 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-15 05:54:12,008 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-15 05:54:12,009 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-15 05:54:12,009 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-15 05:54:12,009 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-15 05:54:12,010 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-15 05:54:12,010 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-15 05:54:12,010 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-15 05:54:12,011 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-15 05:54:12,011 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-15 05:54:12,011 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-15 05:54:12,012 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-15 05:54:12,012 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-15 05:54:12,012 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-15 05:54:12,013 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-15 05:54:12,013 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-15 05:54:12,013 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-15 05:54:12,014 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-15 05:54:12,014 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-15 05:54:12,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {11493#true} call #t~ret5 := main(); {11493#true} is VALID [2022-04-15 05:54:12,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11493#true} {11493#true} #44#return; {11493#true} is VALID [2022-04-15 05:54:12,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {11493#true} assume true; {11493#true} is VALID [2022-04-15 05:54:12,015 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-15 05:54:12,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {11493#true} call ULTIMATE.init(); {11493#true} is VALID [2022-04-15 05:54:12,015 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-15 05:54:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233102736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:12,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 05:54:12,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415342851] [2022-04-15 05:54:12,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415342851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:12,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:12,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 05:54:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621193772] [2022-04-15 05:54:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:12,016 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-15 05:54:12,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:12,016 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-15 05:54:12,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:12,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 05:54:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 05:54:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:54:12,055 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-15 05:54:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:12,679 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:54:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 05:54:12,680 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-15 05:54:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:12,680 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-15 05:54:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-15 05:54:12,681 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-15 05:54:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-15 05:54:12,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-15 05:54:12,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:12,753 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:54:12,753 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 05:54:12,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 05:54:12,754 INFO L913 BasicCegarLoop]: 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-15 05:54:12,754 INFO L914 BasicCegarLoop]: 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-15 05:54:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 05:54:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 05:54:12,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:12,899 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-15 05:54:12,899 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-15 05:54:12,899 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-15 05:54:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:12,900 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:54:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 05:54:12,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:12,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:12,900 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-15 05:54:12,901 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-15 05:54:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:12,901 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 05:54:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 05:54:12,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:12,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:12,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:12,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:12,902 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-15 05:54:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-15 05:54:12,903 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2022-04-15 05:54:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:12,903 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-15 05:54:12,904 INFO L479 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-15 05:54:12,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-15 05:54:12,967 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-15 05:54:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 05:54:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 05:54:12,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:12,968 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:12,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 05:54:13,168 WARN L460 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-15 05:54:13,168 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1672697962, now seen corresponding path program 47 times [2022-04-15 05:54:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:13,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237165093] [2022-04-15 05:54:13,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:13,171 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:13,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1672697962, now seen corresponding path program 48 times [2022-04-15 05:54:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:13,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170511888] [2022-04-15 05:54:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:13,535 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-15 05:54:13,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-15 05:54:13,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-15 05:54:13,536 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-15 05:54:13,536 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-15 05:54:13,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-15 05:54:13,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-15 05:54:13,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-15 05:54:13,537 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-15 05:54:13,537 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-15 05:54:13,538 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-15 05:54:13,538 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-15 05:54:13,539 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-15 05:54:13,539 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-15 05:54:13,539 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-15 05:54:13,540 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-15 05:54:13,540 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-15 05:54:13,540 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-15 05:54:13,541 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-15 05:54:13,541 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-15 05:54:13,542 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-15 05:54:13,542 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-15 05:54:13,543 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-15 05:54:13,543 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-15 05:54:13,543 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-15 05:54:13,544 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-15 05:54:13,544 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-15 05:54:13,544 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-15 05:54:13,545 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-15 05:54:13,545 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-15 05:54:13,546 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-15 05:54:13,546 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-15 05:54:13,547 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-15 05:54:13,547 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-15 05:54:13,547 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-15 05:54:13,548 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-15 05:54:13,548 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-15 05:54:13,549 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-15 05:54:13,549 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-15 05:54:13,549 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-15 05:54:13,550 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-15 05:54:13,550 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-15 05:54:13,551 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-15 05:54:13,551 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-15 05:54:13,551 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-15 05:54:13,552 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-15 05:54:13,552 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-15 05:54:13,553 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-15 05:54:13,553 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-15 05:54:13,553 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-15 05:54:13,554 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-15 05:54:13,554 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-15 05:54:13,555 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-15 05:54:13,555 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-15 05:54:13,555 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-15 05:54:13,556 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-15 05:54:13,556 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-15 05:54:13,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#(<= main_~i~0 24)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-15 05:54:13,557 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-15 05:54:13,557 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-15 05:54:13,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-15 05:54:13,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-15 05:54:13,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-15 05:54:13,558 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-15 05:54:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:13,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170511888] [2022-04-15 05:54:13,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170511888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:13,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084042019] [2022-04-15 05:54:13,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:13,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:13,560 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-15 05:54:13,561 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-15 05:54:15,506 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 05:54:15,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:15,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 05:54:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:15,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:15,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {12325#true} call ULTIMATE.init(); {12325#true} is VALID [2022-04-15 05:54:15,881 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-15 05:54:15,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-15 05:54:15,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-15 05:54:15,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-15 05:54:15,882 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-15 05:54:15,882 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-15 05:54:15,883 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-15 05:54:15,883 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-15 05:54:15,883 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-15 05:54:15,884 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-15 05:54:15,884 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-15 05:54:15,884 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-15 05:54:15,885 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-15 05:54:15,885 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-15 05:54:15,885 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-15 05:54:15,886 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-15 05:54:15,886 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-15 05:54:15,886 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-15 05:54:15,887 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-15 05:54:15,887 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-15 05:54:15,887 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-15 05:54:15,888 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-15 05:54:15,888 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-15 05:54:15,888 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-15 05:54:15,889 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-15 05:54:15,889 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-15 05:54:15,889 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-15 05:54:15,890 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-15 05:54:15,890 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-15 05:54:15,890 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-15 05:54:15,891 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-15 05:54:15,891 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-15 05:54:15,891 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-15 05:54:15,892 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-15 05:54:15,892 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-15 05:54:15,892 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-15 05:54:15,893 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-15 05:54:15,893 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-15 05:54:15,893 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-15 05:54:15,894 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-15 05:54:15,894 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-15 05:54:15,894 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-15 05:54:15,895 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-15 05:54:15,895 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-15 05:54:15,896 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-15 05:54:15,896 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-15 05:54:15,896 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-15 05:54:15,896 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-15 05:54:15,897 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-15 05:54:15,897 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-15 05:54:15,898 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-15 05:54:15,898 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-15 05:54:15,898 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-15 05:54:15,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#(<= main_~i~0 24)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-15 05:54:15,899 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-15 05:54:15,899 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-15 05:54:15,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-15 05:54:15,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-15 05:54:15,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-15 05:54:15,900 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-15 05:54:15,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:16,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {12326#false} assume !false; {12326#false} is VALID [2022-04-15 05:54:16,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {12326#false} assume 0 == ~cond; {12326#false} is VALID [2022-04-15 05:54:16,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {12326#false} ~cond := #in~cond; {12326#false} is VALID [2022-04-15 05:54:16,847 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-15 05:54:16,847 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-15 05:54:16,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {12552#(< main_~i~0 2048)} assume !(~i~0 < 2048); {12326#false} is VALID [2022-04-15 05:54:16,847 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-15 05:54:16,848 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-15 05:54:16,848 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-15 05:54:16,848 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-15 05:54:16,849 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-15 05:54:16,849 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-15 05:54:16,849 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-15 05:54:16,850 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-15 05:54:16,850 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-15 05:54:16,850 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-15 05:54:16,851 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-15 05:54:16,851 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-15 05:54:16,851 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-15 05:54:16,852 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-15 05:54:16,852 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-15 05:54:16,852 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-15 05:54:16,853 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-15 05:54:16,853 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-15 05:54:16,854 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-15 05:54:16,854 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-15 05:54:16,854 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-15 05:54:16,854 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-15 05:54:16,855 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-15 05:54:16,855 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-15 05:54:16,856 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-15 05:54:16,856 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-15 05:54:16,856 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-15 05:54:16,857 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-15 05:54:16,857 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-15 05:54:16,857 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-15 05:54:16,858 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-15 05:54:16,858 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-15 05:54:16,858 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-15 05:54:16,859 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-15 05:54:16,859 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-15 05:54:16,860 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-15 05:54:16,860 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-15 05:54:16,861 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-15 05:54:16,861 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-15 05:54:16,861 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-15 05:54:16,862 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-15 05:54:16,862 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-15 05:54:16,862 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-15 05:54:16,863 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-15 05:54:16,863 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-15 05:54:16,864 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-15 05:54:16,865 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-15 05:54:16,866 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-15 05:54:16,867 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-15 05:54:16,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {12325#true} call #t~ret5 := main(); {12325#true} is VALID [2022-04-15 05:54:16,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12325#true} {12325#true} #44#return; {12325#true} is VALID [2022-04-15 05:54:16,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {12325#true} assume true; {12325#true} is VALID [2022-04-15 05:54:16,867 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-15 05:54:16,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {12325#true} call ULTIMATE.init(); {12325#true} is VALID [2022-04-15 05:54:16,868 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-15 05:54:16,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084042019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:16,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:16,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 05:54:16,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:16,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237165093] [2022-04-15 05:54:16,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237165093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:16,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:16,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 05:54:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004510729] [2022-04-15 05:54:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:16,869 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-15 05:54:16,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:16,870 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-15 05:54:16,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:16,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 05:54:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:16,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 05:54:16,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:54:16,912 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-15 05:54:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:17,613 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:54:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 05:54:17,613 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-15 05:54:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:17,613 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-15 05:54:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 05:54:17,614 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-15 05:54:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 05:54:17,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-15 05:54:17,681 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-15 05:54:17,682 INFO L225 Difference]: With dead ends: 70 [2022-04-15 05:54:17,682 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 05:54:17,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 05:54:17,683 INFO L913 BasicCegarLoop]: 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-15 05:54:17,683 INFO L914 BasicCegarLoop]: 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-15 05:54:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 05:54:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-15 05:54:17,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:17,829 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-15 05:54:17,829 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-15 05:54:17,829 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-15 05:54:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:17,830 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:54:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 05:54:17,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:17,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:17,830 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-15 05:54:17,831 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-15 05:54:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:17,832 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 05:54:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 05:54:17,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:17,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:17,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:17,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:17,832 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-15 05:54:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 05:54:17,833 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2022-04-15 05:54:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:17,834 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 05:54:17,834 INFO L479 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-15 05:54:17,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 05:54:17,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 05:54:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 05:54:17,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:17,919 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:17,950 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-15 05:54:18,139 WARN L460 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-15 05:54:18,139 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 270885388, now seen corresponding path program 49 times [2022-04-15 05:54:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:18,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196060139] [2022-04-15 05:54:18,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:18,143 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:18,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash 270885388, now seen corresponding path program 50 times [2022-04-15 05:54:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:18,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740538565] [2022-04-15 05:54:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:18,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:18,524 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-15 05:54:18,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-15 05:54:18,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-15 05:54:18,525 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-15 05:54:18,526 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-15 05:54:18,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-15 05:54:18,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-15 05:54:18,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-15 05:54:18,526 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-15 05:54:18,527 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-15 05:54:18,527 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-15 05:54:18,528 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-15 05:54:18,528 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-15 05:54:18,528 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-15 05:54:18,529 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-15 05:54:18,529 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-15 05:54:18,530 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-15 05:54:18,530 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-15 05:54:18,531 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-15 05:54:18,531 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-15 05:54:18,531 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-15 05:54:18,532 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-15 05:54:18,532 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-15 05:54:18,533 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-15 05:54:18,533 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-15 05:54:18,534 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-15 05:54:18,534 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-15 05:54:18,534 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-15 05:54:18,535 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-15 05:54:18,535 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-15 05:54:18,536 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-15 05:54:18,536 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-15 05:54:18,537 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-15 05:54:18,537 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-15 05:54:18,538 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-15 05:54:18,538 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-15 05:54:18,538 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-15 05:54:18,539 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-15 05:54:18,539 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-15 05:54:18,540 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-15 05:54:18,540 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-15 05:54:18,540 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-15 05:54:18,541 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-15 05:54:18,541 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-15 05:54:18,542 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-15 05:54:18,542 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-15 05:54:18,543 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-15 05:54:18,543 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-15 05:54:18,543 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-15 05:54:18,544 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-15 05:54:18,544 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-15 05:54:18,545 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-15 05:54:18,545 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-15 05:54:18,546 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-15 05:54:18,546 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-15 05:54:18,546 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-15 05:54:18,547 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-15 05:54:18,547 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-15 05:54:18,548 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-15 05:54:18,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {13215#(<= main_~i~0 25)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-15 05:54:18,548 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-15 05:54:18,548 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-15 05:54:18,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-15 05:54:18,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-15 05:54:18,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-15 05:54:18,549 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-15 05:54:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740538565] [2022-04-15 05:54:18,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740538565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025275580] [2022-04-15 05:54:18,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:18,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:18,551 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-15 05:54:18,552 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-15 05:54:18,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:18,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:18,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 05:54:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:18,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:19,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {13185#true} call ULTIMATE.init(); {13185#true} is VALID [2022-04-15 05:54:19,127 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-15 05:54:19,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-15 05:54:19,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-15 05:54:19,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-15 05:54:19,127 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-15 05:54:19,128 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-15 05:54:19,128 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-15 05:54:19,128 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-15 05:54:19,129 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-15 05:54:19,129 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-15 05:54:19,130 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-15 05:54:19,130 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-15 05:54:19,130 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-15 05:54:19,130 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-15 05:54:19,131 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-15 05:54:19,131 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-15 05:54:19,132 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-15 05:54:19,132 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-15 05:54:19,132 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-15 05:54:19,132 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-15 05:54:19,133 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-15 05:54:19,133 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-15 05:54:19,133 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-15 05:54:19,134 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-15 05:54:19,134 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-15 05:54:19,144 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-15 05:54:19,144 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-15 05:54:19,145 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-15 05:54:19,145 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-15 05:54:19,145 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-15 05:54:19,146 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-15 05:54:19,146 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-15 05:54:19,146 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-15 05:54:19,147 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-15 05:54:19,147 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-15 05:54:19,147 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-15 05:54:19,148 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-15 05:54:19,148 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-15 05:54:19,148 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-15 05:54:19,149 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-15 05:54:19,149 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-15 05:54:19,149 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-15 05:54:19,150 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-15 05:54:19,150 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-15 05:54:19,150 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-15 05:54:19,151 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-15 05:54:19,151 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-15 05:54:19,151 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-15 05:54:19,152 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-15 05:54:19,152 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-15 05:54:19,152 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-15 05:54:19,153 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-15 05:54:19,153 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-15 05:54:19,153 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-15 05:54:19,154 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-15 05:54:19,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {13215#(<= main_~i~0 25)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-15 05:54:19,154 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-15 05:54:19,154 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-15 05:54:19,154 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-15 05:54:19,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-15 05:54:19,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-15 05:54:19,155 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-15 05:54:19,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:20,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {13186#false} assume !false; {13186#false} is VALID [2022-04-15 05:54:20,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {13186#false} assume 0 == ~cond; {13186#false} is VALID [2022-04-15 05:54:20,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {13186#false} ~cond := #in~cond; {13186#false} is VALID [2022-04-15 05:54:20,137 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-15 05:54:20,137 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-15 05:54:20,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {13419#(< main_~i~0 2048)} assume !(~i~0 < 2048); {13186#false} is VALID [2022-04-15 05:54:20,138 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-15 05:54:20,138 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-15 05:54:20,139 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-15 05:54:20,139 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-15 05:54:20,139 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-15 05:54:20,140 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-15 05:54:20,140 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-15 05:54:20,140 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-15 05:54:20,141 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-15 05:54:20,141 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-15 05:54:20,141 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-15 05:54:20,142 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-15 05:54:20,142 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-15 05:54:20,142 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-15 05:54:20,143 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-15 05:54:20,143 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-15 05:54:20,144 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-15 05:54:20,144 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-15 05:54:20,144 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-15 05:54:20,144 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-15 05:54:20,145 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-15 05:54:20,145 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-15 05:54:20,146 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-15 05:54:20,146 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-15 05:54:20,146 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-15 05:54:20,146 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-15 05:54:20,147 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-15 05:54:20,147 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-15 05:54:20,148 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-15 05:54:20,148 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-15 05:54:20,148 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-15 05:54:20,149 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-15 05:54:20,149 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-15 05:54:20,149 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-15 05:54:20,150 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-15 05:54:20,150 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-15 05:54:20,150 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-15 05:54:20,150 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-15 05:54:20,151 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-15 05:54:20,151 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-15 05:54:20,152 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-15 05:54:20,152 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-15 05:54:20,152 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-15 05:54:20,153 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-15 05:54:20,153 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-15 05:54:20,153 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-15 05:54:20,154 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-15 05:54:20,154 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-15 05:54:20,154 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-15 05:54:20,155 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-15 05:54:20,155 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-15 05:54:20,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {13185#true} call #t~ret5 := main(); {13185#true} is VALID [2022-04-15 05:54:20,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13185#true} {13185#true} #44#return; {13185#true} is VALID [2022-04-15 05:54:20,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {13185#true} assume true; {13185#true} is VALID [2022-04-15 05:54:20,155 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-15 05:54:20,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {13185#true} call ULTIMATE.init(); {13185#true} is VALID [2022-04-15 05:54:20,156 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-15 05:54:20,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025275580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:20,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:20,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 05:54:20,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:20,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196060139] [2022-04-15 05:54:20,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196060139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:20,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:20,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 05:54:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887937253] [2022-04-15 05:54:20,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:20,157 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-15 05:54:20,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:20,157 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-15 05:54:20,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:20,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 05:54:20,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:20,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 05:54:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 05:54:20,198 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-15 05:54:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:20,905 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:54:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 05:54:20,905 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-15 05:54:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:20,906 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-15 05:54:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-15 05:54:20,907 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-15 05:54:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-15 05:54:20,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 72 transitions. [2022-04-15 05:54:20,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:20,971 INFO L225 Difference]: With dead ends: 72 [2022-04-15 05:54:20,971 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 05:54:20,971 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:54:20,972 INFO L913 BasicCegarLoop]: 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-15 05:54:20,972 INFO L914 BasicCegarLoop]: 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-15 05:54:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 05:54:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-15 05:54:21,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:21,127 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-15 05:54:21,127 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-15 05:54:21,127 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-15 05:54:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:21,128 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:54:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 05:54:21,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:21,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:21,128 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-15 05:54:21,128 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-15 05:54:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:21,136 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 05:54:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 05:54:21,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:21,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:21,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:21,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:21,136 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-15 05:54:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-15 05:54:21,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2022-04-15 05:54:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:21,138 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-15 05:54:21,138 INFO L479 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-15 05:54:21,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-15 05:54:21,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 05:54:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 05:54:21,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:21,213 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:21,236 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-15 05:54:21,427 WARN L460 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-15 05:54:21,427 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1748732718, now seen corresponding path program 51 times [2022-04-15 05:54:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1464262312] [2022-04-15 05:54:21,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:21,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:21,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1748732718, now seen corresponding path program 52 times [2022-04-15 05:54:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506193156] [2022-04-15 05:54:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:21,861 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-15 05:54:21,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-15 05:54:21,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-15 05:54:21,862 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-15 05:54:21,862 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-15 05:54:21,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-15 05:54:21,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-15 05:54:21,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-15 05:54:21,863 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-15 05:54:21,863 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-15 05:54:21,864 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-15 05:54:21,864 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-15 05:54:21,865 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-15 05:54:21,865 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-15 05:54:21,865 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-15 05:54:21,866 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-15 05:54:21,866 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-15 05:54:21,867 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-15 05:54:21,867 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-15 05:54:21,867 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-15 05:54:21,868 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-15 05:54:21,868 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-15 05:54:21,869 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-15 05:54:21,869 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-15 05:54:21,869 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-15 05:54:21,870 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-15 05:54:21,870 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-15 05:54:21,870 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-15 05:54:21,871 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-15 05:54:21,871 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-15 05:54:21,872 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-15 05:54:21,872 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-15 05:54:21,873 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-15 05:54:21,873 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-15 05:54:21,873 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-15 05:54:21,874 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-15 05:54:21,874 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-15 05:54:21,875 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-15 05:54:21,875 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-15 05:54:21,876 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-15 05:54:21,876 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-15 05:54:21,876 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-15 05:54:21,877 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-15 05:54:21,877 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-15 05:54:21,878 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-15 05:54:21,878 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-15 05:54:21,878 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-15 05:54:21,879 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-15 05:54:21,879 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-15 05:54:21,880 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-15 05:54:21,880 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-15 05:54:21,880 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-15 05:54:21,881 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-15 05:54:21,881 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-15 05:54:21,882 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-15 05:54:21,882 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-15 05:54:21,882 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-15 05:54:21,883 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-15 05:54:21,883 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-15 05:54:21,884 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-15 05:54:21,884 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-15 05:54:21,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {14104#(<= main_~i~0 26)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-15 05:54:21,885 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-15 05:54:21,885 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-15 05:54:21,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-15 05:54:21,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-15 05:54:21,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-15 05:54:21,886 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-15 05:54:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506193156] [2022-04-15 05:54:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506193156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166476488] [2022-04-15 05:54:21,886 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:21,887 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-15 05:54:21,889 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-15 05:54:22,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:22,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:22,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 05:54:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:22,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:22,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {14073#true} call ULTIMATE.init(); {14073#true} is VALID [2022-04-15 05:54:22,480 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-15 05:54:22,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-15 05:54:22,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-15 05:54:22,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-15 05:54:22,481 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-15 05:54:22,482 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-15 05:54:22,482 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-15 05:54:22,483 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-15 05:54:22,483 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-15 05:54:22,484 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-15 05:54:22,484 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-15 05:54:22,485 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-15 05:54:22,485 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-15 05:54:22,486 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-15 05:54:22,486 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-15 05:54:22,487 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-15 05:54:22,487 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-15 05:54:22,488 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-15 05:54:22,488 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-15 05:54:22,488 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-15 05:54:22,489 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-15 05:54:22,489 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-15 05:54:22,490 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-15 05:54:22,490 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-15 05:54:22,491 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-15 05:54:22,491 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-15 05:54:22,492 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-15 05:54:22,492 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-15 05:54:22,492 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-15 05:54:22,493 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-15 05:54:22,493 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-15 05:54:22,494 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-15 05:54:22,494 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-15 05:54:22,495 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-15 05:54:22,495 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-15 05:54:22,495 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-15 05:54:22,496 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-15 05:54:22,496 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-15 05:54:22,497 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-15 05:54:22,497 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-15 05:54:22,498 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-15 05:54:22,498 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-15 05:54:22,498 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-15 05:54:22,499 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-15 05:54:22,499 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-15 05:54:22,500 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-15 05:54:22,500 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-15 05:54:22,501 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-15 05:54:22,501 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-15 05:54:22,501 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-15 05:54:22,502 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-15 05:54:22,502 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-15 05:54:22,503 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-15 05:54:22,503 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-15 05:54:22,504 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-15 05:54:22,504 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-15 05:54:22,504 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-15 05:54:22,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {14104#(<= main_~i~0 26)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-15 05:54:22,505 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-15 05:54:22,505 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-15 05:54:22,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-15 05:54:22,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-15 05:54:22,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-15 05:54:22,506 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-15 05:54:22,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:23,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {14074#false} assume !false; {14074#false} is VALID [2022-04-15 05:54:23,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {14074#false} assume 0 == ~cond; {14074#false} is VALID [2022-04-15 05:54:23,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {14074#false} ~cond := #in~cond; {14074#false} is VALID [2022-04-15 05:54:23,610 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-15 05:54:23,610 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-15 05:54:23,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {14314#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14074#false} is VALID [2022-04-15 05:54:23,611 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-15 05:54:23,611 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-15 05:54:23,612 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-15 05:54:23,612 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-15 05:54:23,612 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-15 05:54:23,613 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-15 05:54:23,613 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-15 05:54:23,613 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-15 05:54:23,614 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-15 05:54:23,614 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-15 05:54:23,614 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-15 05:54:23,615 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-15 05:54:23,615 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-15 05:54:23,615 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-15 05:54:23,616 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-15 05:54:23,616 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-15 05:54:23,616 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-15 05:54:23,617 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-15 05:54:23,617 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-15 05:54:23,617 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-15 05:54:23,618 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-15 05:54:23,618 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-15 05:54:23,618 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-15 05:54:23,619 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-15 05:54:23,619 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-15 05:54:23,619 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-15 05:54:23,620 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-15 05:54:23,620 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-15 05:54:23,620 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-15 05:54:23,621 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-15 05:54:23,621 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-15 05:54:23,621 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-15 05:54:23,622 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-15 05:54:23,622 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-15 05:54:23,623 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-15 05:54:23,623 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-15 05:54:23,623 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-15 05:54:23,624 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-15 05:54:23,624 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-15 05:54:23,624 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-15 05:54:23,625 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-15 05:54:23,625 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-15 05:54:23,625 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-15 05:54:23,626 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-15 05:54:23,626 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-15 05:54:23,626 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-15 05:54:23,627 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-15 05:54:23,627 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-15 05:54:23,627 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-15 05:54:23,628 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-15 05:54:23,628 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-15 05:54:23,628 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-15 05:54:23,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; {14493#(< main_~i~0 2022)} is VALID [2022-04-15 05:54:23,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {14073#true} call #t~ret5 := main(); {14073#true} is VALID [2022-04-15 05:54:23,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14073#true} {14073#true} #44#return; {14073#true} is VALID [2022-04-15 05:54:23,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {14073#true} assume true; {14073#true} is VALID [2022-04-15 05:54:23,629 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-15 05:54:23,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {14073#true} call ULTIMATE.init(); {14073#true} is VALID [2022-04-15 05:54:23,630 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-15 05:54:23,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166476488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:23,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:23,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 05:54:23,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1464262312] [2022-04-15 05:54:23,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1464262312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:23,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:23,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 05:54:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685948984] [2022-04-15 05:54:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:23,631 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-15 05:54:23,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:23,631 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-15 05:54:23,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:23,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 05:54:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 05:54:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 05:54:23,674 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-15 05:54:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:24,397 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:54:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 05:54:24,397 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-15 05:54:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:24,398 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-15 05:54:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-15 05:54:24,398 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-15 05:54:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 74 transitions. [2022-04-15 05:54:24,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 74 transitions. [2022-04-15 05:54:24,454 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-15 05:54:24,455 INFO L225 Difference]: With dead ends: 74 [2022-04-15 05:54:24,455 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 05:54:24,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 05:54:24,457 INFO L913 BasicCegarLoop]: 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-15 05:54:24,457 INFO L914 BasicCegarLoop]: 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-15 05:54:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 05:54:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-15 05:54:24,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:24,626 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-15 05:54:24,626 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-15 05:54:24,626 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-15 05:54:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:24,627 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:54:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 05:54:24,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:24,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:24,628 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-15 05:54:24,628 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-15 05:54:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:24,629 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 05:54:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 05:54:24,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:24,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:24,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:24,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:24,630 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-15 05:54:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-15 05:54:24,631 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2022-04-15 05:54:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:24,631 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-15 05:54:24,631 INFO L479 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-15 05:54:24,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-15 05:54:24,732 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-15 05:54:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 05:54:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 05:54:24,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:24,733 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:24,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 05:54:24,947 WARN L460 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-15 05:54:24,947 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 325841872, now seen corresponding path program 53 times [2022-04-15 05:54:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004556107] [2022-04-15 05:54:24,950 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:24,950 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:24,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash 325841872, now seen corresponding path program 54 times [2022-04-15 05:54:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:24,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070488730] [2022-04-15 05:54:24,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:24,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:25,393 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-15 05:54:25,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-15 05:54:25,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-15 05:54:25,394 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-15 05:54:25,394 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-15 05:54:25,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-15 05:54:25,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-15 05:54:25,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-15 05:54:25,395 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-15 05:54:25,395 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-15 05:54:25,396 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-15 05:54:25,396 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-15 05:54:25,396 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-15 05:54:25,397 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-15 05:54:25,397 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-15 05:54:25,398 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-15 05:54:25,398 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-15 05:54:25,398 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-15 05:54:25,399 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-15 05:54:25,399 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-15 05:54:25,400 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-15 05:54:25,400 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-15 05:54:25,400 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-15 05:54:25,401 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-15 05:54:25,401 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-15 05:54:25,402 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-15 05:54:25,402 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-15 05:54:25,402 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-15 05:54:25,403 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-15 05:54:25,403 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-15 05:54:25,404 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-15 05:54:25,404 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-15 05:54:25,405 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-15 05:54:25,405 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-15 05:54:25,405 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-15 05:54:25,406 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-15 05:54:25,406 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-15 05:54:25,407 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-15 05:54:25,407 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-15 05:54:25,407 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-15 05:54:25,408 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-15 05:54:25,408 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-15 05:54:25,409 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-15 05:54:25,409 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-15 05:54:25,409 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-15 05:54:25,410 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-15 05:54:25,410 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-15 05:54:25,411 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-15 05:54:25,411 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-15 05:54:25,411 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-15 05:54:25,412 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-15 05:54:25,412 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-15 05:54:25,413 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-15 05:54:25,413 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-15 05:54:25,413 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-15 05:54:25,414 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-15 05:54:25,414 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-15 05:54:25,415 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-15 05:54:25,415 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-15 05:54:25,415 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-15 05:54:25,416 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-15 05:54:25,416 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-15 05:54:25,417 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-15 05:54:25,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {15021#(<= main_~i~0 27)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-15 05:54:25,417 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-15 05:54:25,417 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-15 05:54:25,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-15 05:54:25,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-15 05:54:25,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-15 05:54:25,418 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-15 05:54:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:25,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070488730] [2022-04-15 05:54:25,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070488730] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:25,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595439078] [2022-04-15 05:54:25,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:25,424 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-15 05:54:25,425 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-15 05:54:28,118 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 05:54:28,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:28,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:54:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:28,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:28,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {14989#true} call ULTIMATE.init(); {14989#true} is VALID [2022-04-15 05:54:28,533 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-15 05:54:28,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-15 05:54:28,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-15 05:54:28,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-15 05:54:28,534 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-15 05:54:28,534 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-15 05:54:28,534 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-15 05:54:28,535 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-15 05:54:28,535 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-15 05:54:28,535 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-15 05:54:28,536 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-15 05:54:28,536 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-15 05:54:28,536 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-15 05:54:28,537 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-15 05:54:28,537 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-15 05:54:28,537 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-15 05:54:28,538 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-15 05:54:28,538 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-15 05:54:28,538 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-15 05:54:28,539 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-15 05:54:28,539 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-15 05:54:28,539 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-15 05:54:28,540 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-15 05:54:28,540 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-15 05:54:28,540 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-15 05:54:28,541 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-15 05:54:28,541 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-15 05:54:28,541 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-15 05:54:28,542 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-15 05:54:28,542 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-15 05:54:28,543 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-15 05:54:28,543 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-15 05:54:28,543 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-15 05:54:28,544 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-15 05:54:28,544 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-15 05:54:28,544 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-15 05:54:28,545 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-15 05:54:28,545 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-15 05:54:28,545 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-15 05:54:28,546 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-15 05:54:28,546 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-15 05:54:28,546 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-15 05:54:28,547 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-15 05:54:28,547 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-15 05:54:28,547 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-15 05:54:28,548 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-15 05:54:28,548 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-15 05:54:28,548 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-15 05:54:28,549 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-15 05:54:28,549 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-15 05:54:28,549 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-15 05:54:28,550 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-15 05:54:28,550 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-15 05:54:28,550 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-15 05:54:28,551 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-15 05:54:28,555 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-15 05:54:28,556 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-15 05:54:28,557 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-15 05:54:28,557 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-15 05:54:28,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {15021#(<= main_~i~0 27)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-15 05:54:28,558 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-15 05:54:28,558 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-15 05:54:28,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-15 05:54:28,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-15 05:54:28,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-15 05:54:28,559 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-15 05:54:28,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:29,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {14990#false} assume !false; {14990#false} is VALID [2022-04-15 05:54:29,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {14990#false} assume 0 == ~cond; {14990#false} is VALID [2022-04-15 05:54:29,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {14990#false} ~cond := #in~cond; {14990#false} is VALID [2022-04-15 05:54:29,746 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-15 05:54:29,746 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-15 05:54:29,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {15237#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14990#false} is VALID [2022-04-15 05:54:29,747 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-15 05:54:29,747 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-15 05:54:29,748 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-15 05:54:29,748 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-15 05:54:29,748 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-15 05:54:29,749 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-15 05:54:29,749 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-15 05:54:29,749 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-15 05:54:29,750 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-15 05:54:29,750 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-15 05:54:29,750 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-15 05:54:29,751 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-15 05:54:29,751 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-15 05:54:29,751 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-15 05:54:29,752 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-15 05:54:29,752 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-15 05:54:29,753 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-15 05:54:29,753 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-15 05:54:29,753 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-15 05:54:29,753 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-15 05:54:29,754 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-15 05:54:29,754 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-15 05:54:29,755 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-15 05:54:29,755 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-15 05:54:29,755 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-15 05:54:29,756 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-15 05:54:29,756 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-15 05:54:29,756 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-15 05:54:29,757 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-15 05:54:29,757 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-15 05:54:29,757 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-15 05:54:29,758 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-15 05:54:29,758 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-15 05:54:29,758 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-15 05:54:29,759 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-15 05:54:29,759 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-15 05:54:29,759 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-15 05:54:29,760 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-15 05:54:29,760 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-15 05:54:29,760 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-15 05:54:29,761 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-15 05:54:29,761 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-15 05:54:29,761 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-15 05:54:29,762 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-15 05:54:29,762 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-15 05:54:29,762 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-15 05:54:29,763 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-15 05:54:29,763 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-15 05:54:29,763 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-15 05:54:29,764 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-15 05:54:29,764 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-15 05:54:29,764 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-15 05:54:29,765 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-15 05:54:29,765 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-15 05:54:29,766 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-15 05:54:29,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {14989#true} call #t~ret5 := main(); {14989#true} is VALID [2022-04-15 05:54:29,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14989#true} {14989#true} #44#return; {14989#true} is VALID [2022-04-15 05:54:29,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {14989#true} assume true; {14989#true} is VALID [2022-04-15 05:54:29,766 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-15 05:54:29,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {14989#true} call ULTIMATE.init(); {14989#true} is VALID [2022-04-15 05:54:29,766 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-15 05:54:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595439078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:29,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 05:54:29,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004556107] [2022-04-15 05:54:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004556107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:29,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 05:54:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202807878] [2022-04-15 05:54:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:29,768 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-15 05:54:29,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:29,768 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-15 05:54:29,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:29,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 05:54:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 05:54:29,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:54:29,813 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-15 05:54:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:30,716 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:54:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 05:54:30,717 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-15 05:54:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:30,717 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-15 05:54:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-15 05:54:30,718 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-15 05:54:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-15 05:54:30,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2022-04-15 05:54:30,788 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-15 05:54:30,789 INFO L225 Difference]: With dead ends: 76 [2022-04-15 05:54:30,789 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 05:54:30,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 05:54:30,791 INFO L913 BasicCegarLoop]: 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-15 05:54:30,791 INFO L914 BasicCegarLoop]: 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-15 05:54:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 05:54:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-15 05:54:30,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:30,993 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-15 05:54:30,993 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-15 05:54:30,993 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-15 05:54:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:30,994 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:54:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 05:54:30,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:30,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:30,995 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-15 05:54:30,995 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-15 05:54:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:30,996 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 05:54:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 05:54:30,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:30,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:30,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:30,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:30,997 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-15 05:54:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-15 05:54:30,998 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2022-04-15 05:54:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:30,998 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-15 05:54:30,998 INFO L479 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-15 05:54:30,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-15 05:54:31,072 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-15 05:54:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 05:54:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 05:54:31,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:31,073 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:31,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 05:54:31,295 WARN L460 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-15 05:54:31,295 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1272661006, now seen corresponding path program 55 times [2022-04-15 05:54:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [968154886] [2022-04-15 05:54:31,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:31,298 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:31,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1272661006, now seen corresponding path program 56 times [2022-04-15 05:54:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177888220] [2022-04-15 05:54:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:31,705 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-15 05:54:31,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-15 05:54:31,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-15 05:54:31,706 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-15 05:54:31,706 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-15 05:54:31,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-15 05:54:31,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-15 05:54:31,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-15 05:54:31,707 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-15 05:54:31,707 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-15 05:54:31,707 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-15 05:54:31,707 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-15 05:54:31,708 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-15 05:54:31,708 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-15 05:54:31,709 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-15 05:54:31,709 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-15 05:54:31,709 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-15 05:54:31,710 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-15 05:54:31,710 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-15 05:54:31,710 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-15 05:54:31,711 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-15 05:54:31,711 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-15 05:54:31,711 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-15 05:54:31,712 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-15 05:54:31,712 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-15 05:54:31,712 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-15 05:54:31,713 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-15 05:54:31,713 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-15 05:54:31,713 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-15 05:54:31,714 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-15 05:54:31,714 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-15 05:54:31,714 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-15 05:54:31,715 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-15 05:54:31,715 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-15 05:54:31,715 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-15 05:54:31,716 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-15 05:54:31,716 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-15 05:54:31,716 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-15 05:54:31,717 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-15 05:54:31,717 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-15 05:54:31,717 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-15 05:54:31,717 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-15 05:54:31,718 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-15 05:54:31,718 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-15 05:54:31,719 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-15 05:54:31,719 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-15 05:54:31,719 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-15 05:54:31,719 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-15 05:54:31,720 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-15 05:54:31,720 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-15 05:54:31,721 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-15 05:54:31,721 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-15 05:54:31,721 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-15 05:54:31,722 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-15 05:54:31,722 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-15 05:54:31,723 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-15 05:54:31,723 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-15 05:54:31,723 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-15 05:54:31,724 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-15 05:54:31,724 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-15 05:54:31,724 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-15 05:54:31,725 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-15 05:54:31,725 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-15 05:54:31,725 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-15 05:54:31,726 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-15 05:54:31,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {15966#(<= main_~i~0 28)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-15 05:54:31,726 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-15 05:54:31,726 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-15 05:54:31,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-15 05:54:31,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-15 05:54:31,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-15 05:54:31,727 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-15 05:54:31,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:31,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177888220] [2022-04-15 05:54:31,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177888220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:31,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602783906] [2022-04-15 05:54:31,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:31,728 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-15 05:54:31,736 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-15 05:54:31,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:31,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:31,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:54:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:31,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:32,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {15933#true} call ULTIMATE.init(); {15933#true} is VALID [2022-04-15 05:54:32,323 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-15 05:54:32,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-15 05:54:32,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-15 05:54:32,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-15 05:54:32,324 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-15 05:54:32,324 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-15 05:54:32,325 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-15 05:54:32,325 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-15 05:54:32,325 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-15 05:54:32,326 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-15 05:54:32,326 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-15 05:54:32,326 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-15 05:54:32,327 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-15 05:54:32,327 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-15 05:54:32,328 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-15 05:54:32,328 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-15 05:54:32,328 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-15 05:54:32,328 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-15 05:54:32,329 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-15 05:54:32,329 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-15 05:54:32,330 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-15 05:54:32,330 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-15 05:54:32,330 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-15 05:54:32,331 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-15 05:54:32,331 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-15 05:54:32,331 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-15 05:54:32,332 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-15 05:54:32,332 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-15 05:54:32,332 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-15 05:54:32,333 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-15 05:54:32,333 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-15 05:54:32,333 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-15 05:54:32,334 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-15 05:54:32,334 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-15 05:54:32,334 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-15 05:54:32,335 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-15 05:54:32,335 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-15 05:54:32,335 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-15 05:54:32,336 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-15 05:54:32,336 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-15 05:54:32,336 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-15 05:54:32,337 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-15 05:54:32,337 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-15 05:54:32,337 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-15 05:54:32,338 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-15 05:54:32,338 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-15 05:54:32,338 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-15 05:54:32,339 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-15 05:54:32,339 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-15 05:54:32,339 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-15 05:54:32,340 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-15 05:54:32,340 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-15 05:54:32,340 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-15 05:54:32,341 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-15 05:54:32,341 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-15 05:54:32,341 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-15 05:54:32,342 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-15 05:54:32,342 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-15 05:54:32,342 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-15 05:54:32,343 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-15 05:54:32,343 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-15 05:54:32,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {15966#(<= main_~i~0 28)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-15 05:54:32,343 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-15 05:54:32,344 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-15 05:54:32,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-15 05:54:32,344 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-15 05:54:32,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-15 05:54:32,344 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-15 05:54:32,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:33,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {15934#false} assume !false; {15934#false} is VALID [2022-04-15 05:54:33,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {15934#false} assume 0 == ~cond; {15934#false} is VALID [2022-04-15 05:54:33,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {15934#false} ~cond := #in~cond; {15934#false} is VALID [2022-04-15 05:54:33,558 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-15 05:54:33,558 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-15 05:54:33,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {16188#(< main_~i~0 2048)} assume !(~i~0 < 2048); {15934#false} is VALID [2022-04-15 05:54:33,559 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-15 05:54:33,560 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-15 05:54:33,560 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-15 05:54:33,560 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-15 05:54:33,561 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-15 05:54:33,561 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-15 05:54:33,562 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-15 05:54:33,562 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-15 05:54:33,562 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-15 05:54:33,563 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-15 05:54:33,563 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-15 05:54:33,563 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-15 05:54:33,564 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-15 05:54:33,564 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-15 05:54:33,564 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-15 05:54:33,565 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-15 05:54:33,565 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-15 05:54:33,565 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-15 05:54:33,566 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-15 05:54:33,566 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-15 05:54:33,566 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-15 05:54:33,567 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-15 05:54:33,567 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-15 05:54:33,567 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-15 05:54:33,568 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-15 05:54:33,568 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-15 05:54:33,568 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-15 05:54:33,569 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-15 05:54:33,569 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-15 05:54:33,569 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-15 05:54:33,570 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-15 05:54:33,570 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-15 05:54:33,570 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-15 05:54:33,571 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-15 05:54:33,571 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-15 05:54:33,571 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-15 05:54:33,572 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-15 05:54:33,572 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-15 05:54:33,572 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-15 05:54:33,573 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-15 05:54:33,573 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-15 05:54:33,573 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-15 05:54:33,574 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-15 05:54:33,574 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-15 05:54:33,574 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-15 05:54:33,575 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-15 05:54:33,575 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-15 05:54:33,575 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-15 05:54:33,576 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-15 05:54:33,576 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-15 05:54:33,576 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-15 05:54:33,577 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-15 05:54:33,577 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-15 05:54:33,577 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-15 05:54:33,578 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-15 05:54:33,578 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-15 05:54:33,579 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-15 05:54:33,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {15933#true} call #t~ret5 := main(); {15933#true} is VALID [2022-04-15 05:54:33,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15933#true} {15933#true} #44#return; {15933#true} is VALID [2022-04-15 05:54:33,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {15933#true} assume true; {15933#true} is VALID [2022-04-15 05:54:33,579 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-15 05:54:33,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {15933#true} call ULTIMATE.init(); {15933#true} is VALID [2022-04-15 05:54:33,580 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-15 05:54:33,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602783906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:33,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 05:54:33,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [968154886] [2022-04-15 05:54:33,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [968154886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:33,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 05:54:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520525916] [2022-04-15 05:54:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:33,581 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-15 05:54:33,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:33,581 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-15 05:54:33,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:33,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 05:54:33,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 05:54:33,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 05:54:33,643 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-15 05:54:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:34,508 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:54:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 05:54:34,509 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-15 05:54:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:34,509 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-15 05:54:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-15 05:54:34,510 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-15 05:54:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 78 transitions. [2022-04-15 05:54:34,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 78 transitions. [2022-04-15 05:54:34,577 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-15 05:54:34,578 INFO L225 Difference]: With dead ends: 78 [2022-04-15 05:54:34,578 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 05:54:34,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 05:54:34,581 INFO L913 BasicCegarLoop]: 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-15 05:54:34,581 INFO L914 BasicCegarLoop]: 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-15 05:54:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 05:54:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-04-15 05:54:34,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:34,793 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-15 05:54:34,793 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-15 05:54:34,793 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-15 05:54:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:34,794 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:54:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 05:54:34,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:34,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:34,795 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-15 05:54:34,795 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-15 05:54:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:34,796 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 05:54:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 05:54:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:34,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:34,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:34,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:34,796 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-15 05:54:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-15 05:54:34,797 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2022-04-15 05:54:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:34,798 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-15 05:54:34,798 INFO L479 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-15 05:54:34,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-15 05:54:34,874 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-15 05:54:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 05:54:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 05:54:34,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:34,875 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:34,903 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-15 05:54:35,103 WARN L460 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-15 05:54:35,104 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash 164365204, now seen corresponding path program 57 times [2022-04-15 05:54:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291209419] [2022-04-15 05:54:35,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:35,110 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:35,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 164365204, now seen corresponding path program 58 times [2022-04-15 05:54:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:35,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325578244] [2022-04-15 05:54:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:35,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:35,548 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-15 05:54:35,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-15 05:54:35,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-15 05:54:35,549 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-15 05:54:35,549 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-15 05:54:35,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-15 05:54:35,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-15 05:54:35,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-15 05:54:35,550 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-15 05:54:35,551 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-15 05:54:35,551 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-15 05:54:35,552 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-15 05:54:35,552 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-15 05:54:35,553 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-15 05:54:35,553 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-15 05:54:35,553 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-15 05:54:35,554 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-15 05:54:35,554 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-15 05:54:35,555 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-15 05:54:35,555 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-15 05:54:35,556 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-15 05:54:35,556 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-15 05:54:35,557 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-15 05:54:35,557 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-15 05:54:35,558 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-15 05:54:35,558 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-15 05:54:35,558 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-15 05:54:35,559 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-15 05:54:35,559 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-15 05:54:35,560 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-15 05:54:35,560 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-15 05:54:35,560 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-15 05:54:35,561 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-15 05:54:35,561 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-15 05:54:35,562 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-15 05:54:35,562 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-15 05:54:35,563 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-15 05:54:35,563 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-15 05:54:35,564 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-15 05:54:35,564 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-15 05:54:35,564 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-15 05:54:35,565 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-15 05:54:35,565 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-15 05:54:35,565 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-15 05:54:35,566 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-15 05:54:35,566 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-15 05:54:35,566 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-15 05:54:35,567 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-15 05:54:35,567 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-15 05:54:35,567 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-15 05:54:35,568 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-15 05:54:35,568 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-15 05:54:35,568 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-15 05:54:35,569 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-15 05:54:35,569 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-15 05:54:35,569 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-15 05:54:35,570 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-15 05:54:35,570 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-15 05:54:35,570 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-15 05:54:35,571 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-15 05:54:35,571 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-15 05:54:35,571 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-15 05:54:35,572 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-15 05:54:35,572 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-15 05:54:35,572 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-15 05:54:35,573 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-15 05:54:35,573 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-15 05:54:35,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {16939#(<= main_~i~0 29)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-15 05:54:35,574 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-15 05:54:35,574 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-15 05:54:35,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-15 05:54:35,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-15 05:54:35,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-15 05:54:35,574 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-15 05:54:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325578244] [2022-04-15 05:54:35,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325578244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007345194] [2022-04-15 05:54:35,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:35,576 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-15 05:54:35,577 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-15 05:54:35,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:35,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:35,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 05:54:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:35,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:36,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {16905#true} call ULTIMATE.init(); {16905#true} is VALID [2022-04-15 05:54:36,184 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-15 05:54:36,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-15 05:54:36,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-15 05:54:36,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-15 05:54:36,185 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-15 05:54:36,185 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-15 05:54:36,186 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-15 05:54:36,186 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-15 05:54:36,187 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-15 05:54:36,187 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-15 05:54:36,187 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-15 05:54:36,188 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-15 05:54:36,188 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-15 05:54:36,188 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-15 05:54:36,189 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-15 05:54:36,189 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-15 05:54:36,189 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-15 05:54:36,190 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-15 05:54:36,190 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-15 05:54:36,190 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-15 05:54:36,191 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-15 05:54:36,191 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-15 05:54:36,191 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-15 05:54:36,192 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-15 05:54:36,192 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-15 05:54:36,192 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-15 05:54:36,193 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-15 05:54:36,193 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-15 05:54:36,193 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-15 05:54:36,194 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-15 05:54:36,194 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-15 05:54:36,194 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-15 05:54:36,195 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-15 05:54:36,195 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-15 05:54:36,195 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-15 05:54:36,196 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-15 05:54:36,196 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-15 05:54:36,196 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-15 05:54:36,197 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-15 05:54:36,197 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-15 05:54:36,197 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-15 05:54:36,198 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-15 05:54:36,198 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-15 05:54:36,198 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-15 05:54:36,199 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-15 05:54:36,199 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-15 05:54:36,199 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-15 05:54:36,200 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-15 05:54:36,200 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-15 05:54:36,200 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-15 05:54:36,201 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-15 05:54:36,201 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-15 05:54:36,201 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-15 05:54:36,202 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-15 05:54:36,202 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-15 05:54:36,202 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-15 05:54:36,203 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-15 05:54:36,203 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-15 05:54:36,204 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-15 05:54:36,204 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-15 05:54:36,207 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-15 05:54:36,207 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-15 05:54:36,208 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-15 05:54:36,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {16939#(<= main_~i~0 29)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-15 05:54:36,208 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-15 05:54:36,208 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-15 05:54:36,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-15 05:54:36,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-15 05:54:36,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-15 05:54:36,209 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-15 05:54:36,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:37,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {16906#false} assume !false; {16906#false} is VALID [2022-04-15 05:54:37,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {16906#false} assume 0 == ~cond; {16906#false} is VALID [2022-04-15 05:54:37,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {16906#false} ~cond := #in~cond; {16906#false} is VALID [2022-04-15 05:54:37,469 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-15 05:54:37,469 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-15 05:54:37,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {17167#(< main_~i~0 2048)} assume !(~i~0 < 2048); {16906#false} is VALID [2022-04-15 05:54:37,470 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-15 05:54:37,470 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-15 05:54:37,470 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-15 05:54:37,471 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-15 05:54:37,471 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-15 05:54:37,471 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-15 05:54:37,472 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-15 05:54:37,472 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-15 05:54:37,472 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-15 05:54:37,473 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-15 05:54:37,473 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-15 05:54:37,473 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-15 05:54:37,474 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-15 05:54:37,474 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-15 05:54:37,474 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-15 05:54:37,475 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-15 05:54:37,475 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-15 05:54:37,475 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-15 05:54:37,476 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-15 05:54:37,476 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-15 05:54:37,476 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-15 05:54:37,477 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-15 05:54:37,477 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-15 05:54:37,477 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-15 05:54:37,478 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-15 05:54:37,478 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-15 05:54:37,478 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-15 05:54:37,479 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-15 05:54:37,479 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-15 05:54:37,479 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-15 05:54:37,480 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-15 05:54:37,480 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-15 05:54:37,480 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-15 05:54:37,481 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-15 05:54:37,481 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-15 05:54:37,481 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-15 05:54:37,482 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-15 05:54:37,482 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-15 05:54:37,482 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-15 05:54:37,483 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-15 05:54:37,483 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-15 05:54:37,483 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-15 05:54:37,484 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-15 05:54:37,484 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-15 05:54:37,485 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-15 05:54:37,485 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-15 05:54:37,485 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-15 05:54:37,485 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-15 05:54:37,486 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-15 05:54:37,486 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-15 05:54:37,487 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-15 05:54:37,487 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-15 05:54:37,487 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-15 05:54:37,488 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-15 05:54:37,488 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-15 05:54:37,488 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-15 05:54:37,489 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-15 05:54:37,489 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-15 05:54:37,489 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-15 05:54:37,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {16905#true} call #t~ret5 := main(); {16905#true} is VALID [2022-04-15 05:54:37,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16905#true} {16905#true} #44#return; {16905#true} is VALID [2022-04-15 05:54:37,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {16905#true} assume true; {16905#true} is VALID [2022-04-15 05:54:37,490 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-15 05:54:37,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {16905#true} call ULTIMATE.init(); {16905#true} is VALID [2022-04-15 05:54:37,490 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-15 05:54:37,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007345194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:37,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 05:54:37,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:37,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291209419] [2022-04-15 05:54:37,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291209419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:37,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 05:54:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575480965] [2022-04-15 05:54:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:37,492 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-15 05:54:37,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:37,492 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-15 05:54:37,569 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-15 05:54:37,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 05:54:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 05:54:37,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 05:54:37,571 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-15 05:54:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:38,515 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:54:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 05:54:38,515 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-15 05:54:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:38,515 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-15 05:54:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 05:54:38,516 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-15 05:54:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-15 05:54:38,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-15 05:54:38,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:38,595 INFO L225 Difference]: With dead ends: 80 [2022-04-15 05:54:38,595 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 05:54:38,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 05:54:38,597 INFO L913 BasicCegarLoop]: 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-15 05:54:38,598 INFO L914 BasicCegarLoop]: 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-15 05:54:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 05:54:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-15 05:54:38,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:38,815 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-15 05:54:38,815 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-15 05:54:38,815 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-15 05:54:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:38,816 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:54:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 05:54:38,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:38,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:38,817 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-15 05:54:38,817 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-15 05:54:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:38,818 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 05:54:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 05:54:38,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:38,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:38,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:38,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:38,819 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-15 05:54:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-15 05:54:38,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2022-04-15 05:54:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:38,820 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-15 05:54:38,821 INFO L479 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-15 05:54:38,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-15 05:54:38,922 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-15 05:54:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-15 05:54:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 05:54:38,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:38,923 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:38,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:39,147 WARN L460 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-15 05:54:39,147 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1832916298, now seen corresponding path program 59 times [2022-04-15 05:54:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:39,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132125738] [2022-04-15 05:54:39,150 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:39,150 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:39,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1832916298, now seen corresponding path program 60 times [2022-04-15 05:54:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378177276] [2022-04-15 05:54:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:39,603 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-15 05:54:39,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-15 05:54:39,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-15 05:54:39,604 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-15 05:54:39,604 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-15 05:54:39,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-15 05:54:39,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-15 05:54:39,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-15 05:54:39,604 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-15 05:54:39,605 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-15 05:54:39,605 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-15 05:54:39,605 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-15 05:54:39,606 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-15 05:54:39,606 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-15 05:54:39,606 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-15 05:54:39,607 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-15 05:54:39,607 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-15 05:54:39,607 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-15 05:54:39,608 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-15 05:54:39,608 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-15 05:54:39,608 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-15 05:54:39,609 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-15 05:54:39,609 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-15 05:54:39,609 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-15 05:54:39,610 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-15 05:54:39,610 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-15 05:54:39,610 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-15 05:54:39,611 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-15 05:54:39,614 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-15 05:54:39,615 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-15 05:54:39,615 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-15 05:54:39,615 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-15 05:54:39,616 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-15 05:54:39,616 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-15 05:54:39,616 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-15 05:54:39,617 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-15 05:54:39,617 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-15 05:54:39,617 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-15 05:54:39,618 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-15 05:54:39,618 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-15 05:54:39,618 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-15 05:54:39,619 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-15 05:54:39,619 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-15 05:54:39,619 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-15 05:54:39,620 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-15 05:54:39,620 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-15 05:54:39,620 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-15 05:54:39,621 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-15 05:54:39,621 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-15 05:54:39,621 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-15 05:54:39,622 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-15 05:54:39,622 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-15 05:54:39,622 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-15 05:54:39,623 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-15 05:54:39,623 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-15 05:54:39,623 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-15 05:54:39,624 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-15 05:54:39,624 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-15 05:54:39,624 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-15 05:54:39,625 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-15 05:54:39,625 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-15 05:54:39,627 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-15 05:54:39,628 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-15 05:54:39,628 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-15 05:54:39,629 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-15 05:54:39,629 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-15 05:54:39,629 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-15 05:54:39,630 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-15 05:54:39,630 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-15 05:54:39,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {17940#(<= main_~i~0 30)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-15 05:54:39,631 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-15 05:54:39,631 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-15 05:54:39,631 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-15 05:54:39,631 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-15 05:54:39,631 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-15 05:54:39,632 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-15 05:54:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378177276] [2022-04-15 05:54:39,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378177276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:39,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048654712] [2022-04-15 05:54:39,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:39,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:39,640 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-15 05:54:39,641 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-15 05:54:44,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-15 05:54:44,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:44,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 05:54:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:44,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:44,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {17905#true} call ULTIMATE.init(); {17905#true} is VALID [2022-04-15 05:54:44,559 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-15 05:54:44,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-15 05:54:44,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-15 05:54:44,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-15 05:54:44,561 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-15 05:54:44,561 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-15 05:54:44,561 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-15 05:54:44,562 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-15 05:54:44,562 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-15 05:54:44,563 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-15 05:54:44,563 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-15 05:54:44,563 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-15 05:54:44,564 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-15 05:54:44,564 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-15 05:54:44,565 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-15 05:54:44,565 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-15 05:54:44,565 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-15 05:54:44,566 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-15 05:54:44,566 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-15 05:54:44,566 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-15 05:54:44,567 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-15 05:54:44,567 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-15 05:54:44,567 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-15 05:54:44,568 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-15 05:54:44,568 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-15 05:54:44,568 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-15 05:54:44,569 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-15 05:54:44,569 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-15 05:54:44,569 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-15 05:54:44,569 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-15 05:54:44,570 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-15 05:54:44,570 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-15 05:54:44,571 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-15 05:54:44,571 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-15 05:54:44,571 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-15 05:54:44,571 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-15 05:54:44,572 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-15 05:54:44,572 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-15 05:54:44,573 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-15 05:54:44,573 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-15 05:54:44,573 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-15 05:54:44,573 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-15 05:54:44,574 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-15 05:54:44,574 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-15 05:54:44,575 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-15 05:54:44,575 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-15 05:54:44,575 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-15 05:54:44,575 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-15 05:54:44,576 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-15 05:54:44,576 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-15 05:54:44,577 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-15 05:54:44,577 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-15 05:54:44,577 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-15 05:54:44,577 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-15 05:54:44,578 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-15 05:54:44,578 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-15 05:54:44,579 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-15 05:54:44,579 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-15 05:54:44,579 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-15 05:54:44,579 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-15 05:54:44,580 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-15 05:54:44,580 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-15 05:54:44,581 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-15 05:54:44,581 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-15 05:54:44,581 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-15 05:54:44,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {17940#(<= main_~i~0 30)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-15 05:54:44,582 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-15 05:54:44,582 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-15 05:54:44,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-15 05:54:44,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-15 05:54:44,582 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-15 05:54:44,582 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-15 05:54:44,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:45,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {17906#false} assume !false; {17906#false} is VALID [2022-04-15 05:54:45,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {17906#false} assume 0 == ~cond; {17906#false} is VALID [2022-04-15 05:54:45,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {17906#false} ~cond := #in~cond; {17906#false} is VALID [2022-04-15 05:54:45,905 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-15 05:54:45,905 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-15 05:54:45,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {18174#(< main_~i~0 2048)} assume !(~i~0 < 2048); {17906#false} is VALID [2022-04-15 05:54:45,906 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-15 05:54:45,906 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-15 05:54:45,907 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-15 05:54:45,907 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-15 05:54:45,907 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-15 05:54:45,908 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-15 05:54:45,908 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-15 05:54:45,908 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-15 05:54:45,909 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-15 05:54:45,909 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-15 05:54:45,909 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-15 05:54:45,910 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-15 05:54:45,910 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-15 05:54:45,910 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-15 05:54:45,911 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-15 05:54:45,911 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-15 05:54:45,911 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-15 05:54:45,912 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-15 05:54:45,912 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-15 05:54:45,912 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-15 05:54:45,913 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-15 05:54:45,913 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-15 05:54:45,913 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-15 05:54:45,914 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-15 05:54:45,914 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-15 05:54:45,914 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-15 05:54:45,915 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-15 05:54:45,915 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-15 05:54:45,916 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-15 05:54:45,916 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-15 05:54:45,916 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-15 05:54:45,916 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-15 05:54:45,917 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-15 05:54:45,917 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-15 05:54:45,918 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-15 05:54:45,918 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-15 05:54:45,918 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-15 05:54:45,918 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-15 05:54:45,919 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-15 05:54:45,919 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-15 05:54:45,920 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-15 05:54:45,920 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-15 05:54:45,920 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-15 05:54:45,921 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-15 05:54:45,921 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-15 05:54:45,921 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-15 05:54:45,922 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-15 05:54:45,922 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-15 05:54:45,922 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-15 05:54:45,923 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-15 05:54:45,923 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-15 05:54:45,923 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-15 05:54:45,924 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-15 05:54:45,924 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-15 05:54:45,924 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-15 05:54:45,925 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-15 05:54:45,925 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-15 05:54:45,925 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-15 05:54:45,926 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-15 05:54:45,926 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-15 05:54:45,927 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-15 05:54:45,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {17905#true} call #t~ret5 := main(); {17905#true} is VALID [2022-04-15 05:54:45,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17905#true} {17905#true} #44#return; {17905#true} is VALID [2022-04-15 05:54:45,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {17905#true} assume true; {17905#true} is VALID [2022-04-15 05:54:45,927 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-15 05:54:45,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {17905#true} call ULTIMATE.init(); {17905#true} is VALID [2022-04-15 05:54:45,928 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-15 05:54:45,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048654712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:45,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:45,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 05:54:45,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:45,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132125738] [2022-04-15 05:54:45,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132125738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:45,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:45,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 05:54:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153038887] [2022-04-15 05:54:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:45,929 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-15 05:54:45,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:45,930 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-15 05:54:45,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:45,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 05:54:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:45,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 05:54:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 05:54:45,984 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-15 05:54:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:46,964 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:54:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 05:54:46,965 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-15 05:54:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:46,965 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-15 05:54:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-15 05:54:46,966 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-15 05:54:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-15 05:54:46,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 82 transitions. [2022-04-15 05:54:47,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:47,047 INFO L225 Difference]: With dead ends: 82 [2022-04-15 05:54:47,047 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 05:54:47,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 05:54:47,048 INFO L913 BasicCegarLoop]: 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-15 05:54:47,049 INFO L914 BasicCegarLoop]: 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-15 05:54:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 05:54:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-04-15 05:54:47,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:47,275 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-15 05:54:47,275 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-15 05:54:47,275 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-15 05:54:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:47,276 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:54:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 05:54:47,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:47,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:47,277 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-15 05:54:47,277 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-15 05:54:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:47,278 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 05:54:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 05:54:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:47,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:47,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:47,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:47,279 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-15 05:54:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-15 05:54:47,280 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2022-04-15 05:54:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:47,280 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-15 05:54:47,281 INFO L479 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-15 05:54:47,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-15 05:54:47,387 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-15 05:54:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 05:54:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 05:54:47,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:47,387 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:47,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:47,615 WARN L460 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-15 05:54:47,615 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1370058408, now seen corresponding path program 61 times [2022-04-15 05:54:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:47,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583266027] [2022-04-15 05:54:47,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:47,620 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:47,620 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1370058408, now seen corresponding path program 62 times [2022-04-15 05:54:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024730574] [2022-04-15 05:54:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:48,121 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-15 05:54:48,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-15 05:54:48,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-15 05:54:48,121 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-15 05:54:48,121 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-15 05:54:48,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-15 05:54:48,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-15 05:54:48,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-15 05:54:48,122 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-15 05:54:48,122 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-15 05:54:48,123 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-15 05:54:48,123 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-15 05:54:48,123 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-15 05:54:48,124 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-15 05:54:48,124 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-15 05:54:48,124 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-15 05:54:48,125 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-15 05:54:48,125 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-15 05:54:48,125 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-15 05:54:48,125 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-15 05:54:48,126 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-15 05:54:48,126 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-15 05:54:48,127 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-15 05:54:48,127 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-15 05:54:48,127 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-15 05:54:48,127 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-15 05:54:48,128 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-15 05:54:48,128 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-15 05:54:48,129 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-15 05:54:48,129 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-15 05:54:48,129 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-15 05:54:48,129 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-15 05:54:48,130 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-15 05:54:48,130 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-15 05:54:48,131 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-15 05:54:48,131 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-15 05:54:48,131 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-15 05:54:48,131 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-15 05:54:48,133 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-15 05:54:48,134 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-15 05:54:48,134 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-15 05:54:48,134 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-15 05:54:48,135 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-15 05:54:48,135 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-15 05:54:48,136 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-15 05:54:48,136 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-15 05:54:48,136 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-15 05:54:48,137 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-15 05:54:48,137 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-15 05:54:48,137 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-15 05:54:48,138 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-15 05:54:48,138 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-15 05:54:48,138 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-15 05:54:48,139 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-15 05:54:48,139 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-15 05:54:48,139 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-15 05:54:48,140 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-15 05:54:48,140 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-15 05:54:48,140 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-15 05:54:48,141 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-15 05:54:48,141 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-15 05:54:48,141 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-15 05:54:48,142 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-15 05:54:48,142 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-15 05:54:48,142 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-15 05:54:48,143 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-15 05:54:48,143 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-15 05:54:48,143 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-15 05:54:48,144 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-15 05:54:48,144 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-15 05:54:48,144 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-15 05:54:48,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 31)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-15 05:54:48,145 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-15 05:54:48,145 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-15 05:54:48,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-15 05:54:48,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-15 05:54:48,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-15 05:54:48,145 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-15 05:54:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024730574] [2022-04-15 05:54:48,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024730574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587917424] [2022-04-15 05:54:48,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:48,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:48,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:48,148 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-15 05:54:48,150 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-15 05:54:48,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:48,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:48,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:54:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:48,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {18933#true} call ULTIMATE.init(); {18933#true} is VALID [2022-04-15 05:54:48,763 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-15 05:54:48,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-15 05:54:48,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-15 05:54:48,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-15 05:54:48,764 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-15 05:54:48,764 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-15 05:54:48,764 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-15 05:54:48,765 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-15 05:54:48,765 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-15 05:54:48,765 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-15 05:54:48,766 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-15 05:54:48,766 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-15 05:54:48,766 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-15 05:54:48,767 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-15 05:54:48,767 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-15 05:54:48,767 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-15 05:54:48,768 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-15 05:54:48,768 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-15 05:54:48,768 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-15 05:54:48,769 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-15 05:54:48,769 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-15 05:54:48,769 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-15 05:54:48,770 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-15 05:54:48,770 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-15 05:54:48,770 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-15 05:54:48,771 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-15 05:54:48,771 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-15 05:54:48,771 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-15 05:54:48,772 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-15 05:54:48,772 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-15 05:54:48,772 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-15 05:54:48,773 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-15 05:54:48,773 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-15 05:54:48,773 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-15 05:54:48,774 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-15 05:54:48,774 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-15 05:54:48,774 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-15 05:54:48,774 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-15 05:54:48,775 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-15 05:54:48,775 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-15 05:54:48,776 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-15 05:54:48,776 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-15 05:54:48,776 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-15 05:54:48,776 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-15 05:54:48,777 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-15 05:54:48,777 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-15 05:54:48,777 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-15 05:54:48,778 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-15 05:54:48,778 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-15 05:54:48,778 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-15 05:54:48,779 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-15 05:54:48,779 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-15 05:54:48,779 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-15 05:54:48,780 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-15 05:54:48,780 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-15 05:54:48,780 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-15 05:54:48,781 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-15 05:54:48,781 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-15 05:54:48,781 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-15 05:54:48,782 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-15 05:54:48,782 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-15 05:54:48,782 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-15 05:54:48,783 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-15 05:54:48,783 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-15 05:54:48,783 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-15 05:54:48,784 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-15 05:54:48,784 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-15 05:54:48,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 31)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-15 05:54:48,785 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-15 05:54:48,785 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-15 05:54:48,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-15 05:54:48,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-15 05:54:48,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-15 05:54:48,786 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-15 05:54:48,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:50,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {18934#false} assume !false; {18934#false} is VALID [2022-04-15 05:54:50,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {18934#false} assume 0 == ~cond; {18934#false} is VALID [2022-04-15 05:54:50,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {18934#false} ~cond := #in~cond; {18934#false} is VALID [2022-04-15 05:54:50,188 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-15 05:54:50,189 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-15 05:54:50,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {19209#(< main_~i~0 2048)} assume !(~i~0 < 2048); {18934#false} is VALID [2022-04-15 05:54:50,189 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-15 05:54:50,190 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-15 05:54:50,190 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-15 05:54:50,190 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-15 05:54:50,191 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-15 05:54:50,191 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-15 05:54:50,191 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-15 05:54:50,192 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-15 05:54:50,192 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-15 05:54:50,192 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-15 05:54:50,193 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-15 05:54:50,193 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-15 05:54:50,193 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-15 05:54:50,194 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-15 05:54:50,194 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-15 05:54:50,194 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-15 05:54:50,195 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-15 05:54:50,195 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-15 05:54:50,195 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-15 05:54:50,196 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-15 05:54:50,196 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-15 05:54:50,196 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-15 05:54:50,197 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-15 05:54:50,197 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-15 05:54:50,197 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-15 05:54:50,198 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-15 05:54:50,198 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-15 05:54:50,198 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-15 05:54:50,199 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-15 05:54:50,199 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-15 05:54:50,199 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-15 05:54:50,200 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-15 05:54:50,200 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-15 05:54:50,200 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-15 05:54:50,201 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-15 05:54:50,201 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-15 05:54:50,201 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-15 05:54:50,202 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-15 05:54:50,202 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-15 05:54:50,202 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-15 05:54:50,203 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-15 05:54:50,203 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-15 05:54:50,204 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-15 05:54:50,204 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-15 05:54:50,204 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-15 05:54:50,204 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-15 05:54:50,205 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-15 05:54:50,205 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-15 05:54:50,206 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-15 05:54:50,206 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-15 05:54:50,206 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-15 05:54:50,207 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-15 05:54:50,207 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-15 05:54:50,207 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-15 05:54:50,208 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-15 05:54:50,208 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-15 05:54:50,208 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-15 05:54:50,209 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-15 05:54:50,209 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-15 05:54:50,209 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-15 05:54:50,210 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-15 05:54:50,210 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-15 05:54:50,210 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-15 05:54:50,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {18933#true} call #t~ret5 := main(); {18933#true} is VALID [2022-04-15 05:54:50,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18933#true} {18933#true} #44#return; {18933#true} is VALID [2022-04-15 05:54:50,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {18933#true} assume true; {18933#true} is VALID [2022-04-15 05:54:50,211 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-15 05:54:50,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {18933#true} call ULTIMATE.init(); {18933#true} is VALID [2022-04-15 05:54:50,211 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-15 05:54:50,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587917424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:50,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:50,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 05:54:50,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:50,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583266027] [2022-04-15 05:54:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583266027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:50,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 05:54:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915155014] [2022-04-15 05:54:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:50,216 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-15 05:54:50,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:50,216 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-15 05:54:50,264 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-15 05:54:50,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 05:54:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 05:54:50,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 05:54:50,266 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-15 05:54:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:51,236 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:54:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 05:54:51,236 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-15 05:54:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:51,237 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-15 05:54:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-15 05:54:51,237 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-15 05:54:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 84 transitions. [2022-04-15 05:54:51,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 84 transitions. [2022-04-15 05:54:51,314 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-15 05:54:51,314 INFO L225 Difference]: With dead ends: 84 [2022-04-15 05:54:51,315 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 05:54:51,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:54:51,319 INFO L913 BasicCegarLoop]: 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-15 05:54:51,319 INFO L914 BasicCegarLoop]: 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-15 05:54:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 05:54:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-04-15 05:54:51,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:51,557 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-15 05:54:51,557 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-15 05:54:51,557 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-15 05:54:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:51,558 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:54:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 05:54:51,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:51,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:51,559 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-15 05:54:51,559 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-15 05:54:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:51,560 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 05:54:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 05:54:51,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:51,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:51,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:51,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:51,560 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-15 05:54:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-15 05:54:51,561 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2022-04-15 05:54:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:51,562 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-15 05:54:51,562 INFO L479 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-15 05:54:51,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-15 05:54:51,637 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-15 05:54:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-15 05:54:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 05:54:51,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:51,638 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:51,656 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-15 05:54:51,838 WARN L460 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-15 05:54:51,839 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1054742394, now seen corresponding path program 63 times [2022-04-15 05:54:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:51,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469647774] [2022-04-15 05:54:51,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:51,842 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:51,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1054742394, now seen corresponding path program 64 times [2022-04-15 05:54:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:51,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162089451] [2022-04-15 05:54:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:52,372 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-15 05:54:52,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-15 05:54:52,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-15 05:54:52,373 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-15 05:54:52,373 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-15 05:54:52,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-15 05:54:52,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-15 05:54:52,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-15 05:54:52,373 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-15 05:54:52,374 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-15 05:54:52,374 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-15 05:54:52,375 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-15 05:54:52,375 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-15 05:54:52,375 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-15 05:54:52,376 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-15 05:54:52,376 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-15 05:54:52,377 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-15 05:54:52,377 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-15 05:54:52,378 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-15 05:54:52,378 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-15 05:54:52,378 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-15 05:54:52,379 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-15 05:54:52,379 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-15 05:54:52,379 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-15 05:54:52,380 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-15 05:54:52,380 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-15 05:54:52,381 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-15 05:54:52,381 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-15 05:54:52,382 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-15 05:54:52,382 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-15 05:54:52,382 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-15 05:54:52,383 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-15 05:54:52,383 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-15 05:54:52,383 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-15 05:54:52,384 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-15 05:54:52,384 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-15 05:54:52,385 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-15 05:54:52,385 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-15 05:54:52,385 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-15 05:54:52,386 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-15 05:54:52,386 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-15 05:54:52,387 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-15 05:54:52,387 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-15 05:54:52,387 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-15 05:54:52,388 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-15 05:54:52,388 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-15 05:54:52,389 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-15 05:54:52,389 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-15 05:54:52,390 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-15 05:54:52,390 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-15 05:54:52,390 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-15 05:54:52,391 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-15 05:54:52,391 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-15 05:54:52,391 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-15 05:54:52,392 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-15 05:54:52,392 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-15 05:54:52,393 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-15 05:54:52,393 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-15 05:54:52,393 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-15 05:54:52,394 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-15 05:54:52,394 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-15 05:54:52,395 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-15 05:54:52,395 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-15 05:54:52,395 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-15 05:54:52,396 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-15 05:54:52,396 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-15 05:54:52,397 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-15 05:54:52,397 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-15 05:54:52,397 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-15 05:54:52,398 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-15 05:54:52,398 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-15 05:54:52,399 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-15 05:54:52,399 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-15 05:54:52,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {20026#(<= main_~i~0 32)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-15 05:54:52,400 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-15 05:54:52,400 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-15 05:54:52,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-15 05:54:52,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-15 05:54:52,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-15 05:54:52,401 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-15 05:54:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:52,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162089451] [2022-04-15 05:54:52,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162089451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:52,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798367013] [2022-04-15 05:54:52,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:52,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:52,403 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-15 05:54:52,404 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-15 05:54:52,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:52,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:52,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 05:54:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:52,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:53,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {19989#true} call ULTIMATE.init(); {19989#true} is VALID [2022-04-15 05:54:53,083 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-15 05:54:53,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-15 05:54:53,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-15 05:54:53,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-15 05:54:53,084 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-15 05:54:53,084 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-15 05:54:53,084 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-15 05:54:53,085 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-15 05:54:53,085 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-15 05:54:53,085 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-15 05:54:53,086 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-15 05:54:53,086 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-15 05:54:53,086 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-15 05:54:53,087 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-15 05:54:53,087 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-15 05:54:53,087 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-15 05:54:53,088 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-15 05:54:53,088 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-15 05:54:53,088 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-15 05:54:53,089 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-15 05:54:53,089 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-15 05:54:53,089 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-15 05:54:53,090 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-15 05:54:53,090 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-15 05:54:53,090 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-15 05:54:53,091 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-15 05:54:53,091 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-15 05:54:53,091 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-15 05:54:53,092 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-15 05:54:53,092 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-15 05:54:53,092 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-15 05:54:53,093 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-15 05:54:53,093 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-15 05:54:53,093 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-15 05:54:53,094 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-15 05:54:53,094 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-15 05:54:53,094 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-15 05:54:53,095 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-15 05:54:53,095 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-15 05:54:53,095 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-15 05:54:53,096 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-15 05:54:53,096 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-15 05:54:53,096 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-15 05:54:53,097 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-15 05:54:53,097 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-15 05:54:53,097 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-15 05:54:53,098 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-15 05:54:53,098 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-15 05:54:53,098 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-15 05:54:53,099 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-15 05:54:53,099 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-15 05:54:53,099 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-15 05:54:53,100 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-15 05:54:53,100 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-15 05:54:53,100 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-15 05:54:53,101 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-15 05:54:53,101 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-15 05:54:53,101 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-15 05:54:53,102 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-15 05:54:53,102 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-15 05:54:53,102 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-15 05:54:53,103 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-15 05:54:53,103 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-15 05:54:53,103 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-15 05:54:53,105 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-15 05:54:53,105 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-15 05:54:53,105 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-15 05:54:53,106 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-15 05:54:53,106 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-15 05:54:53,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {20026#(<= main_~i~0 32)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-15 05:54:53,107 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-15 05:54:53,107 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-15 05:54:53,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-15 05:54:53,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-15 05:54:53,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-15 05:54:53,107 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-15 05:54:53,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:54,576 INFO L290 TraceCheckUtils]: 75: Hoare triple {19990#false} assume !false; {19990#false} is VALID [2022-04-15 05:54:54,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {19990#false} assume 0 == ~cond; {19990#false} is VALID [2022-04-15 05:54:54,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {19990#false} ~cond := #in~cond; {19990#false} is VALID [2022-04-15 05:54:54,576 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-15 05:54:54,576 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-15 05:54:54,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {20272#(< main_~i~0 2048)} assume !(~i~0 < 2048); {19990#false} is VALID [2022-04-15 05:54:54,577 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-15 05:54:54,577 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-15 05:54:54,578 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-15 05:54:54,578 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-15 05:54:54,578 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-15 05:54:54,579 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-15 05:54:54,579 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-15 05:54:54,579 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-15 05:54:54,580 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-15 05:54:54,580 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-15 05:54:54,580 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-15 05:54:54,581 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-15 05:54:54,581 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-15 05:54:54,581 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-15 05:54:54,582 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-15 05:54:54,582 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-15 05:54:54,582 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-15 05:54:54,583 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-15 05:54:54,583 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-15 05:54:54,583 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-15 05:54:54,584 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-15 05:54:54,584 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-15 05:54:54,584 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-15 05:54:54,585 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-15 05:54:54,585 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-15 05:54:54,585 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-15 05:54:54,586 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-15 05:54:54,586 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-15 05:54:54,586 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-15 05:54:54,587 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-15 05:54:54,587 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-15 05:54:54,587 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-15 05:54:54,588 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-15 05:54:54,588 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-15 05:54:54,588 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-15 05:54:54,589 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-15 05:54:54,589 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-15 05:54:54,589 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-15 05:54:54,590 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-15 05:54:54,590 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-15 05:54:54,590 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-15 05:54:54,591 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-15 05:54:54,591 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-15 05:54:54,591 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-15 05:54:54,592 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-15 05:54:54,592 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-15 05:54:54,592 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-15 05:54:54,593 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-15 05:54:54,593 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-15 05:54:54,593 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-15 05:54:54,594 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-15 05:54:54,594 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-15 05:54:54,594 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-15 05:54:54,595 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-15 05:54:54,595 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-15 05:54:54,595 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-15 05:54:54,596 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-15 05:54:54,596 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-15 05:54:54,596 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-15 05:54:54,597 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-15 05:54:54,597 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-15 05:54:54,597 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-15 05:54:54,598 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-15 05:54:54,598 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-15 05:54:54,598 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-15 05:54:54,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {19989#true} call #t~ret5 := main(); {19989#true} is VALID [2022-04-15 05:54:54,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19989#true} {19989#true} #44#return; {19989#true} is VALID [2022-04-15 05:54:54,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {19989#true} assume true; {19989#true} is VALID [2022-04-15 05:54:54,599 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-15 05:54:54,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {19989#true} call ULTIMATE.init(); {19989#true} is VALID [2022-04-15 05:54:54,599 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-15 05:54:54,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798367013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:54,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:54,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 05:54:54,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:54,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469647774] [2022-04-15 05:54:54,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469647774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:54,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:54,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 05:54:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532663838] [2022-04-15 05:54:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:54,601 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-15 05:54:54,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:54,601 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-15 05:54:54,650 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-15 05:54:54,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 05:54:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 05:54:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:54:54,651 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-15 05:54:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:55,641 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:54:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 05:54:55,641 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-15 05:54:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:55,642 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-15 05:54:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-15 05:54:55,643 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-15 05:54:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 86 transitions. [2022-04-15 05:54:55,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 86 transitions. [2022-04-15 05:54:55,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:55,734 INFO L225 Difference]: With dead ends: 86 [2022-04-15 05:54:55,734 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 05:54:55,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4626, Invalid=5880, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 05:54:55,736 INFO L913 BasicCegarLoop]: 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-15 05:54:55,736 INFO L914 BasicCegarLoop]: 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-15 05:54:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 05:54:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 05:54:56,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:56,030 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-15 05:54:56,030 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-15 05:54:56,031 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-15 05:54:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:56,032 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:54:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-15 05:54:56,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:56,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:56,032 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-15 05:54:56,032 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-15 05:54:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:56,033 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 05:54:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-15 05:54:56,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:56,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:56,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:56,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:56,034 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-15 05:54:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-15 05:54:56,035 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2022-04-15 05:54:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:56,035 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-15 05:54:56,036 INFO L479 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-15 05:54:56,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-15 05:54:56,146 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-15 05:54:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-15 05:54:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 05:54:56,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:56,147 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:56,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:56,360 WARN L460 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-15 05:54:56,360 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -878928612, now seen corresponding path program 65 times [2022-04-15 05:54:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391994622] [2022-04-15 05:54:56,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:56,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:56,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -878928612, now seen corresponding path program 66 times [2022-04-15 05:54:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:56,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881432768] [2022-04-15 05:54:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:56,884 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-15 05:54:56,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-15 05:54:56,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-15 05:54:56,885 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-15 05:54:56,885 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-15 05:54:56,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-15 05:54:56,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-15 05:54:56,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-15 05:54:56,886 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-15 05:54:56,886 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-15 05:54:56,887 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-15 05:54:56,887 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-15 05:54:56,888 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-15 05:54:56,888 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-15 05:54:56,889 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-15 05:54:56,889 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-15 05:54:56,890 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-15 05:54:56,890 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-15 05:54:56,891 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-15 05:54:56,891 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-15 05:54:56,891 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-15 05:54:56,892 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-15 05:54:56,892 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-15 05:54:56,893 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-15 05:54:56,893 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-15 05:54:56,893 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-15 05:54:56,894 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-15 05:54:56,894 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-15 05:54:56,895 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-15 05:54:56,895 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-15 05:54:56,896 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-15 05:54:56,896 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-15 05:54:56,896 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-15 05:54:56,897 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-15 05:54:56,897 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-15 05:54:56,898 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-15 05:54:56,898 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-15 05:54:56,898 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-15 05:54:56,899 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-15 05:54:56,899 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-15 05:54:56,900 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-15 05:54:56,900 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-15 05:54:56,901 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-15 05:54:56,901 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-15 05:54:56,901 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-15 05:54:56,902 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-15 05:54:56,902 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-15 05:54:56,902 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-15 05:54:56,903 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-15 05:54:56,903 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-15 05:54:56,903 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-15 05:54:56,904 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-15 05:54:56,904 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-15 05:54:56,904 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-15 05:54:56,905 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-15 05:54:56,905 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-15 05:54:56,905 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-15 05:54:56,906 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-15 05:54:56,906 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-15 05:54:56,906 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-15 05:54:56,907 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-15 05:54:56,907 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-15 05:54:56,907 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-15 05:54:56,908 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-15 05:54:56,908 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-15 05:54:56,909 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-15 05:54:56,910 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-15 05:54:56,910 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-15 05:54:56,910 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-15 05:54:56,911 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-15 05:54:56,911 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-15 05:54:56,911 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-15 05:54:56,912 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-15 05:54:56,912 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-15 05:54:56,912 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-15 05:54:56,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {21111#(<= main_~i~0 33)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-15 05:54:56,913 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-15 05:54:56,913 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-15 05:54:56,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-15 05:54:56,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-15 05:54:56,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-15 05:54:56,914 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-15 05:54:56,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:56,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881432768] [2022-04-15 05:54:56,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881432768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:56,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452024290] [2022-04-15 05:54:56,914 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:56,915 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-15 05:54:56,916 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-15 05:55:01,577 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-15 05:55:01,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:01,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 05:55:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:01,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:02,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {21073#true} call ULTIMATE.init(); {21073#true} is VALID [2022-04-15 05:55:02,062 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-15 05:55:02,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-15 05:55:02,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-15 05:55:02,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-15 05:55:02,063 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-15 05:55:02,064 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-15 05:55:02,064 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-15 05:55:02,065 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-15 05:55:02,065 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-15 05:55:02,065 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-15 05:55:02,066 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-15 05:55:02,066 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-15 05:55:02,067 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-15 05:55:02,067 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-15 05:55:02,068 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-15 05:55:02,068 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-15 05:55:02,069 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-15 05:55:02,069 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-15 05:55:02,069 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-15 05:55:02,070 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-15 05:55:02,070 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-15 05:55:02,071 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-15 05:55:02,071 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-15 05:55:02,072 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-15 05:55:02,072 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-15 05:55:02,073 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-15 05:55:02,073 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-15 05:55:02,073 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-15 05:55:02,074 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-15 05:55:02,074 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-15 05:55:02,075 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-15 05:55:02,075 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-15 05:55:02,076 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-15 05:55:02,076 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-15 05:55:02,077 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-15 05:55:02,077 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-15 05:55:02,078 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-15 05:55:02,078 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-15 05:55:02,078 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-15 05:55:02,079 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-15 05:55:02,079 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-15 05:55:02,080 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-15 05:55:02,080 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-15 05:55:02,081 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-15 05:55:02,081 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-15 05:55:02,082 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-15 05:55:02,082 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-15 05:55:02,082 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-15 05:55:02,083 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-15 05:55:02,083 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-15 05:55:02,084 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-15 05:55:02,084 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-15 05:55:02,085 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-15 05:55:02,085 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-15 05:55:02,086 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-15 05:55:02,086 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-15 05:55:02,086 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-15 05:55:02,087 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-15 05:55:02,087 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-15 05:55:02,088 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-15 05:55:02,088 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-15 05:55:02,089 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-15 05:55:02,089 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-15 05:55:02,090 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-15 05:55:02,090 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-15 05:55:02,091 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-15 05:55:02,091 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-15 05:55:02,091 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-15 05:55:02,092 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-15 05:55:02,092 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-15 05:55:02,093 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-15 05:55:02,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {21111#(<= main_~i~0 33)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-15 05:55:02,093 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-15 05:55:02,093 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-15 05:55:02,094 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-15 05:55:02,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-15 05:55:02,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-15 05:55:02,097 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-15 05:55:02,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:03,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {21074#false} assume !false; {21074#false} is VALID [2022-04-15 05:55:03,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {21074#false} assume 0 == ~cond; {21074#false} is VALID [2022-04-15 05:55:03,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {21074#false} ~cond := #in~cond; {21074#false} is VALID [2022-04-15 05:55:03,626 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-15 05:55:03,626 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-15 05:55:03,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {21363#(< main_~i~0 2048)} assume !(~i~0 < 2048); {21074#false} is VALID [2022-04-15 05:55:03,626 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-15 05:55:03,627 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-15 05:55:03,627 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-15 05:55:03,627 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-15 05:55:03,628 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-15 05:55:03,628 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-15 05:55:03,628 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-15 05:55:03,629 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-15 05:55:03,629 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-15 05:55:03,629 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-15 05:55:03,630 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-15 05:55:03,630 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-15 05:55:03,630 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-15 05:55:03,631 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-15 05:55:03,631 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-15 05:55:03,631 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-15 05:55:03,632 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-15 05:55:03,632 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-15 05:55:03,632 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-15 05:55:03,633 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-15 05:55:03,633 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-15 05:55:03,633 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-15 05:55:03,634 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-15 05:55:03,634 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-15 05:55:03,634 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-15 05:55:03,635 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-15 05:55:03,635 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-15 05:55:03,635 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-15 05:55:03,636 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-15 05:55:03,636 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-15 05:55:03,636 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-15 05:55:03,637 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-15 05:55:03,637 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-15 05:55:03,637 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-15 05:55:03,638 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-15 05:55:03,638 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-15 05:55:03,638 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-15 05:55:03,639 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-15 05:55:03,639 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-15 05:55:03,639 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-15 05:55:03,640 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-15 05:55:03,640 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-15 05:55:03,640 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-15 05:55:03,641 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-15 05:55:03,641 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-15 05:55:03,641 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-15 05:55:03,642 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-15 05:55:03,642 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-15 05:55:03,642 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-15 05:55:03,643 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-15 05:55:03,643 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-15 05:55:03,643 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-15 05:55:03,644 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-15 05:55:03,644 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-15 05:55:03,644 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-15 05:55:03,645 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-15 05:55:03,645 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-15 05:55:03,645 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-15 05:55:03,646 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-15 05:55:03,646 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-15 05:55:03,646 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-15 05:55:03,647 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-15 05:55:03,647 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-15 05:55:03,647 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-15 05:55:03,648 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-15 05:55:03,648 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-15 05:55:03,648 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-15 05:55:03,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {21073#true} call #t~ret5 := main(); {21073#true} is VALID [2022-04-15 05:55:03,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21073#true} {21073#true} #44#return; {21073#true} is VALID [2022-04-15 05:55:03,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {21073#true} assume true; {21073#true} is VALID [2022-04-15 05:55:03,649 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-15 05:55:03,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {21073#true} call ULTIMATE.init(); {21073#true} is VALID [2022-04-15 05:55:03,649 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-15 05:55:03,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452024290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:03,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:03,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 05:55:03,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:03,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391994622] [2022-04-15 05:55:03,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391994622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:03,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:03,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 05:55:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044491614] [2022-04-15 05:55:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:03,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-15 05:55:03,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:03,651 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-15 05:55:03,717 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-15 05:55:03,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 05:55:03,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:03,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 05:55:03,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 05:55:03,718 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-15 05:55:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:04,772 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:55:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 05:55:04,772 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-15 05:55:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:04,772 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-15 05:55:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-15 05:55:04,773 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-15 05:55:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 88 transitions. [2022-04-15 05:55:04,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 88 transitions. [2022-04-15 05:55:04,844 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-15 05:55:04,845 INFO L225 Difference]: With dead ends: 88 [2022-04-15 05:55:04,845 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 05:55:04,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 05:55:04,846 INFO L913 BasicCegarLoop]: 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-15 05:55:04,846 INFO L914 BasicCegarLoop]: 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-15 05:55:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 05:55:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-04-15 05:55:05,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:05,113 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-15 05:55:05,113 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-15 05:55:05,113 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-15 05:55:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:05,114 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:55:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-15 05:55:05,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:05,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:05,115 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-15 05:55:05,115 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-15 05:55:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:05,116 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 05:55:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-15 05:55:05,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:05,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:05,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:05,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:05,117 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-15 05:55:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-04-15 05:55:05,118 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2022-04-15 05:55:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:05,118 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-04-15 05:55:05,119 INFO L479 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-15 05:55:05,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 81 transitions. [2022-04-15 05:55:05,208 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-15 05:55:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-15 05:55:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 05:55:05,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:05,208 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:05,230 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-15 05:55:05,411 WARN L460 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-15 05:55:05,411 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash 584073790, now seen corresponding path program 67 times [2022-04-15 05:55:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:05,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421608978] [2022-04-15 05:55:05,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:05,414 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:05,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash 584073790, now seen corresponding path program 68 times [2022-04-15 05:55:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:05,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027481495] [2022-04-15 05:55:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:05,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:06,004 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-15 05:55:06,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-15 05:55:06,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-15 05:55:06,005 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-15 05:55:06,006 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-15 05:55:06,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-15 05:55:06,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-15 05:55:06,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-15 05:55:06,006 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-15 05:55:06,007 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-15 05:55:06,007 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-15 05:55:06,008 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-15 05:55:06,008 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-15 05:55:06,009 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-15 05:55:06,009 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-15 05:55:06,010 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-15 05:55:06,010 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-15 05:55:06,010 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-15 05:55:06,011 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-15 05:55:06,011 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-15 05:55:06,012 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-15 05:55:06,012 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-15 05:55:06,013 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-15 05:55:06,013 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-15 05:55:06,014 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-15 05:55:06,014 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-15 05:55:06,014 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-15 05:55:06,015 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-15 05:55:06,015 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-15 05:55:06,016 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-15 05:55:06,016 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-15 05:55:06,017 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-15 05:55:06,017 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-15 05:55:06,017 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-15 05:55:06,018 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-15 05:55:06,018 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-15 05:55:06,019 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-15 05:55:06,019 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-15 05:55:06,019 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-15 05:55:06,020 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-15 05:55:06,020 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-15 05:55:06,021 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-15 05:55:06,021 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-15 05:55:06,021 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-15 05:55:06,022 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-15 05:55:06,022 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-15 05:55:06,023 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-15 05:55:06,023 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-15 05:55:06,024 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-15 05:55:06,024 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-15 05:55:06,024 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-15 05:55:06,025 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-15 05:55:06,025 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-15 05:55:06,026 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-15 05:55:06,026 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-15 05:55:06,026 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-15 05:55:06,027 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-15 05:55:06,027 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-15 05:55:06,028 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-15 05:55:06,028 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-15 05:55:06,029 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-15 05:55:06,029 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-15 05:55:06,029 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-15 05:55:06,030 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-15 05:55:06,030 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-15 05:55:06,031 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-15 05:55:06,031 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-15 05:55:06,031 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-15 05:55:06,032 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-15 05:55:06,032 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-15 05:55:06,033 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-15 05:55:06,033 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-15 05:55:06,034 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-15 05:55:06,034 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-15 05:55:06,034 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-15 05:55:06,035 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-15 05:55:06,035 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-15 05:55:06,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {22224#(<= main_~i~0 34)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-15 05:55:06,036 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-15 05:55:06,036 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-15 05:55:06,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-15 05:55:06,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-15 05:55:06,036 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-15 05:55:06,037 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-15 05:55:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027481495] [2022-04-15 05:55:06,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027481495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968218971] [2022-04-15 05:55:06,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:55:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:06,040 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-15 05:55:06,041 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-15 05:55:06,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:55:06,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:06,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 05:55:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:06,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:06,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {22185#true} call ULTIMATE.init(); {22185#true} is VALID [2022-04-15 05:55:06,753 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-15 05:55:06,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-15 05:55:06,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-15 05:55:06,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-15 05:55:06,754 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-15 05:55:06,754 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-15 05:55:06,755 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-15 05:55:06,755 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-15 05:55:06,755 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-15 05:55:06,756 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-15 05:55:06,756 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-15 05:55:06,756 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-15 05:55:06,757 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-15 05:55:06,757 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-15 05:55:06,757 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-15 05:55:06,758 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-15 05:55:06,758 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-15 05:55:06,758 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-15 05:55:06,759 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-15 05:55:06,759 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-15 05:55:06,759 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-15 05:55:06,760 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-15 05:55:06,760 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-15 05:55:06,760 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-15 05:55:06,761 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-15 05:55:06,761 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-15 05:55:06,761 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-15 05:55:06,761 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-15 05:55:06,762 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-15 05:55:06,762 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-15 05:55:06,763 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-15 05:55:06,763 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-15 05:55:06,763 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-15 05:55:06,764 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-15 05:55:06,764 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-15 05:55:06,764 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-15 05:55:06,765 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-15 05:55:06,765 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-15 05:55:06,765 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-15 05:55:06,766 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-15 05:55:06,766 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-15 05:55:06,766 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-15 05:55:06,767 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-15 05:55:06,767 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-15 05:55:06,767 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-15 05:55:06,768 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-15 05:55:06,768 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-15 05:55:06,768 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-15 05:55:06,769 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-15 05:55:06,769 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-15 05:55:06,769 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-15 05:55:06,769 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-15 05:55:06,770 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-15 05:55:06,770 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-15 05:55:06,771 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-15 05:55:06,771 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-15 05:55:06,771 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-15 05:55:06,772 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-15 05:55:06,772 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-15 05:55:06,772 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-15 05:55:06,773 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-15 05:55:06,773 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-15 05:55:06,773 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-15 05:55:06,773 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-15 05:55:06,774 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-15 05:55:06,774 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-15 05:55:06,775 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-15 05:55:06,775 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-15 05:55:06,775 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-15 05:55:06,775 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-15 05:55:06,776 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-15 05:55:06,776 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-15 05:55:06,777 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-15 05:55:06,777 INFO L290 TraceCheckUtils]: 74: Hoare triple {22224#(<= main_~i~0 34)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-15 05:55:06,777 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-15 05:55:06,777 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-15 05:55:06,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-15 05:55:06,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-15 05:55:06,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-15 05:55:06,778 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-15 05:55:06,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:08,396 INFO L290 TraceCheckUtils]: 79: Hoare triple {22186#false} assume !false; {22186#false} is VALID [2022-04-15 05:55:08,396 INFO L290 TraceCheckUtils]: 78: Hoare triple {22186#false} assume 0 == ~cond; {22186#false} is VALID [2022-04-15 05:55:08,396 INFO L290 TraceCheckUtils]: 77: Hoare triple {22186#false} ~cond := #in~cond; {22186#false} is VALID [2022-04-15 05:55:08,396 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-15 05:55:08,396 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-15 05:55:08,396 INFO L290 TraceCheckUtils]: 74: Hoare triple {22482#(< main_~i~0 2048)} assume !(~i~0 < 2048); {22186#false} is VALID [2022-04-15 05:55:08,397 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-15 05:55:08,397 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-15 05:55:08,398 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-15 05:55:08,398 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-15 05:55:08,398 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-15 05:55:08,398 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-15 05:55:08,399 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-15 05:55:08,399 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-15 05:55:08,400 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-15 05:55:08,400 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-15 05:55:08,400 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-15 05:55:08,401 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-15 05:55:08,401 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-15 05:55:08,401 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-15 05:55:08,402 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-15 05:55:08,402 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-15 05:55:08,402 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-15 05:55:08,402 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-15 05:55:08,403 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-15 05:55:08,403 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-15 05:55:08,404 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-15 05:55:08,404 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-15 05:55:08,404 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-15 05:55:08,404 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-15 05:55:08,405 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-15 05:55:08,405 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-15 05:55:08,405 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-15 05:55:08,406 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-15 05:55:08,406 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-15 05:55:08,406 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-15 05:55:08,407 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-15 05:55:08,407 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-15 05:55:08,407 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-15 05:55:08,408 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-15 05:55:08,408 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-15 05:55:08,408 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-15 05:55:08,409 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-15 05:55:08,409 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-15 05:55:08,409 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-15 05:55:08,410 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-15 05:55:08,410 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-15 05:55:08,410 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-15 05:55:08,411 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-15 05:55:08,411 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-15 05:55:08,411 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-15 05:55:08,412 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-15 05:55:08,412 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-15 05:55:08,412 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-15 05:55:08,413 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-15 05:55:08,413 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-15 05:55:08,413 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-15 05:55:08,414 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-15 05:55:08,414 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-15 05:55:08,414 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-15 05:55:08,415 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-15 05:55:08,415 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-15 05:55:08,423 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-15 05:55:08,424 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-15 05:55:08,424 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-15 05:55:08,425 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-15 05:55:08,425 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-15 05:55:08,425 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-15 05:55:08,426 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-15 05:55:08,426 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-15 05:55:08,426 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-15 05:55:08,427 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-15 05:55:08,427 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-15 05:55:08,427 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-15 05:55:08,428 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-15 05:55:08,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {22185#true} call #t~ret5 := main(); {22185#true} is VALID [2022-04-15 05:55:08,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22185#true} {22185#true} #44#return; {22185#true} is VALID [2022-04-15 05:55:08,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {22185#true} assume true; {22185#true} is VALID [2022-04-15 05:55:08,428 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-15 05:55:08,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {22185#true} call ULTIMATE.init(); {22185#true} is VALID [2022-04-15 05:55:08,429 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-15 05:55:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968218971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:08,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:08,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 05:55:08,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421608978] [2022-04-15 05:55:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421608978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:08,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:08,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 05:55:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900982480] [2022-04-15 05:55:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:08,430 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-15 05:55:08,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:08,430 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-15 05:55:08,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:08,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 05:55:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 05:55:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 05:55:08,485 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-15 05:55:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:09,624 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:55:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 05:55:09,624 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-15 05:55:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:09,624 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-15 05:55:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-15 05:55:09,625 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-15 05:55:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 90 transitions. [2022-04-15 05:55:09,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 90 transitions. [2022-04-15 05:55:09,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:09,692 INFO L225 Difference]: With dead ends: 90 [2022-04-15 05:55:09,692 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 05:55:09,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 05:55:09,693 INFO L913 BasicCegarLoop]: 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-15 05:55:09,693 INFO L914 BasicCegarLoop]: 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-15 05:55:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 05:55:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-04-15 05:55:09,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:09,981 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-15 05:55:09,981 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-15 05:55:09,981 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-15 05:55:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:09,984 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:55:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-15 05:55:09,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:09,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:09,986 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-15 05:55:09,986 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-15 05:55:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:09,987 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-15 05:55:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-15 05:55:09,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:09,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:09,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:09,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:09,988 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-15 05:55:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2022-04-15 05:55:09,989 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2022-04-15 05:55:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:09,989 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2022-04-15 05:55:09,990 INFO L479 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-15 05:55:09,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 83 transitions. [2022-04-15 05:55:10,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-15 05:55:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 05:55:10,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:10,079 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:10,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 05:55:10,279 WARN L460 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-15 05:55:10,279 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2075076320, now seen corresponding path program 69 times [2022-04-15 05:55:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:10,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695905282] [2022-04-15 05:55:10,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:10,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:10,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2075076320, now seen corresponding path program 70 times [2022-04-15 05:55:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:10,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046731682] [2022-04-15 05:55:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:10,870 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-15 05:55:10,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-15 05:55:10,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-15 05:55:10,870 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-15 05:55:10,871 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-15 05:55:10,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-15 05:55:10,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-15 05:55:10,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-15 05:55:10,871 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-15 05:55:10,871 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-15 05:55:10,872 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-15 05:55:10,872 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-15 05:55:10,872 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-15 05:55:10,873 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-15 05:55:10,873 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-15 05:55:10,873 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-15 05:55:10,874 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-15 05:55:10,874 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-15 05:55:10,874 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-15 05:55:10,875 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-15 05:55:10,875 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-15 05:55:10,875 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-15 05:55:10,876 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-15 05:55:10,876 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-15 05:55:10,876 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-15 05:55:10,877 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-15 05:55:10,877 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-15 05:55:10,877 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-15 05:55:10,878 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-15 05:55:10,878 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-15 05:55:10,878 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-15 05:55:10,879 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-15 05:55:10,879 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-15 05:55:10,879 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-15 05:55:10,880 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-15 05:55:10,880 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-15 05:55:10,880 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-15 05:55:10,881 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-15 05:55:10,881 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-15 05:55:10,881 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-15 05:55:10,882 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-15 05:55:10,882 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-15 05:55:10,882 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-15 05:55:10,883 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-15 05:55:10,891 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-15 05:55:10,891 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-15 05:55:10,891 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-15 05:55:10,892 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-15 05:55:10,892 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-15 05:55:10,892 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-15 05:55:10,893 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-15 05:55:10,893 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-15 05:55:10,893 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-15 05:55:10,894 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-15 05:55:10,894 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-15 05:55:10,894 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-15 05:55:10,895 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-15 05:55:10,895 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-15 05:55:10,895 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-15 05:55:10,896 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-15 05:55:10,896 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-15 05:55:10,896 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-15 05:55:10,897 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-15 05:55:10,897 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-15 05:55:10,897 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-15 05:55:10,898 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-15 05:55:10,898 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-15 05:55:10,898 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-15 05:55:10,899 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-15 05:55:10,899 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-15 05:55:10,899 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-15 05:55:10,900 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-15 05:55:10,900 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-15 05:55:10,900 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-15 05:55:10,901 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-15 05:55:10,901 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-15 05:55:10,901 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-15 05:55:10,902 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-15 05:55:10,902 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-15 05:55:10,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {23365#(<= main_~i~0 35)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-15 05:55:10,902 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-15 05:55:10,903 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-15 05:55:10,903 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-15 05:55:10,903 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-15 05:55:10,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-15 05:55:10,903 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-15 05:55:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046731682] [2022-04-15 05:55:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046731682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716362006] [2022-04-15 05:55:10,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:55:10,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:10,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:10,905 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-15 05:55:10,905 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-15 05:55:11,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:55:11,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:11,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 05:55:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:11,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:11,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {23325#true} call ULTIMATE.init(); {23325#true} is VALID [2022-04-15 05:55:11,623 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-15 05:55:11,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-15 05:55:11,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-15 05:55:11,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-15 05:55:11,624 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-15 05:55:11,624 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-15 05:55:11,625 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-15 05:55:11,625 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-15 05:55:11,625 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-15 05:55:11,626 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-15 05:55:11,626 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-15 05:55:11,626 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-15 05:55:11,627 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-15 05:55:11,627 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-15 05:55:11,627 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-15 05:55:11,628 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-15 05:55:11,628 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-15 05:55:11,628 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-15 05:55:11,629 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-15 05:55:11,629 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-15 05:55:11,629 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-15 05:55:11,630 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-15 05:55:11,630 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-15 05:55:11,630 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-15 05:55:11,631 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-15 05:55:11,631 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-15 05:55:11,631 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-15 05:55:11,632 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-15 05:55:11,632 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-15 05:55:11,632 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-15 05:55:11,633 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-15 05:55:11,633 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-15 05:55:11,633 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-15 05:55:11,634 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-15 05:55:11,634 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-15 05:55:11,634 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-15 05:55:11,635 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-15 05:55:11,635 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-15 05:55:11,635 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-15 05:55:11,636 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-15 05:55:11,636 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-15 05:55:11,636 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-15 05:55:11,637 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-15 05:55:11,637 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-15 05:55:11,637 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-15 05:55:11,637 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-15 05:55:11,638 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-15 05:55:11,638 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-15 05:55:11,638 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-15 05:55:11,639 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-15 05:55:11,639 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-15 05:55:11,639 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-15 05:55:11,640 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-15 05:55:11,640 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-15 05:55:11,640 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-15 05:55:11,641 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-15 05:55:11,641 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-15 05:55:11,641 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-15 05:55:11,642 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-15 05:55:11,642 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-15 05:55:11,642 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-15 05:55:11,643 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-15 05:55:11,643 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-15 05:55:11,643 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-15 05:55:11,644 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-15 05:55:11,644 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-15 05:55:11,644 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-15 05:55:11,645 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-15 05:55:11,645 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-15 05:55:11,645 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-15 05:55:11,646 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-15 05:55:11,646 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-15 05:55:11,646 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-15 05:55:11,647 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-15 05:55:11,647 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-15 05:55:11,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {23365#(<= main_~i~0 35)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-15 05:55:11,648 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-15 05:55:11,648 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-15 05:55:11,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-15 05:55:11,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-15 05:55:11,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-15 05:55:11,648 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-15 05:55:11,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:13,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {23326#false} assume !false; {23326#false} is VALID [2022-04-15 05:55:13,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {23326#false} assume 0 == ~cond; {23326#false} is VALID [2022-04-15 05:55:13,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {23326#false} ~cond := #in~cond; {23326#false} is VALID [2022-04-15 05:55:13,376 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-15 05:55:13,376 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-15 05:55:13,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {23629#(< main_~i~0 2048)} assume !(~i~0 < 2048); {23326#false} is VALID [2022-04-15 05:55:13,377 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-15 05:55:13,377 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-15 05:55:13,378 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-15 05:55:13,378 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-15 05:55:13,379 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-15 05:55:13,379 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-15 05:55:13,379 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-15 05:55:13,380 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-15 05:55:13,380 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-15 05:55:13,380 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-15 05:55:13,381 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-15 05:55:13,381 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-15 05:55:13,381 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-15 05:55:13,382 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-15 05:55:13,382 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-15 05:55:13,382 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-15 05:55:13,383 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-15 05:55:13,383 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-15 05:55:13,383 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-15 05:55:13,384 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-15 05:55:13,384 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-15 05:55:13,384 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-15 05:55:13,385 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-15 05:55:13,385 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-15 05:55:13,385 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-15 05:55:13,386 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-15 05:55:13,386 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-15 05:55:13,386 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-15 05:55:13,387 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-15 05:55:13,387 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-15 05:55:13,387 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-15 05:55:13,388 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-15 05:55:13,388 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-15 05:55:13,388 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-15 05:55:13,389 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-15 05:55:13,389 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-15 05:55:13,389 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-15 05:55:13,390 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-15 05:55:13,390 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-15 05:55:13,390 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-15 05:55:13,391 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-15 05:55:13,391 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-15 05:55:13,392 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-15 05:55:13,392 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-15 05:55:13,392 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-15 05:55:13,392 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-15 05:55:13,393 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-15 05:55:13,393 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-15 05:55:13,394 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-15 05:55:13,394 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-15 05:55:13,394 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-15 05:55:13,395 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-15 05:55:13,395 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-15 05:55:13,395 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-15 05:55:13,396 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-15 05:55:13,396 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-15 05:55:13,396 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-15 05:55:13,397 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-15 05:55:13,397 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-15 05:55:13,397 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-15 05:55:13,398 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-15 05:55:13,398 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-15 05:55:13,398 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-15 05:55:13,399 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-15 05:55:13,399 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-15 05:55:13,399 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-15 05:55:13,400 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-15 05:55:13,400 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-15 05:55:13,400 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-15 05:55:13,401 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-15 05:55:13,404 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-15 05:55:13,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {23325#true} call #t~ret5 := main(); {23325#true} is VALID [2022-04-15 05:55:13,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23325#true} {23325#true} #44#return; {23325#true} is VALID [2022-04-15 05:55:13,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-04-15 05:55:13,404 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-15 05:55:13,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {23325#true} call ULTIMATE.init(); {23325#true} is VALID [2022-04-15 05:55:13,405 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-15 05:55:13,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716362006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:13,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:13,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 05:55:13,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:13,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695905282] [2022-04-15 05:55:13,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695905282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:13,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:13,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 05:55:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705604550] [2022-04-15 05:55:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:13,406 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-15 05:55:13,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:13,407 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-15 05:55:13,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:13,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 05:55:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 05:55:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 05:55:13,464 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-15 05:55:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:14,602 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:55:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 05:55:14,603 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-15 05:55:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:14,603 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-15 05:55:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-15 05:55:14,604 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-15 05:55:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 92 transitions. [2022-04-15 05:55:14,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 92 transitions. [2022-04-15 05:55:14,676 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-15 05:55:14,677 INFO L225 Difference]: With dead ends: 92 [2022-04-15 05:55:14,677 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 05:55:14,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5478, Invalid=6954, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 05:55:14,678 INFO L913 BasicCegarLoop]: 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-15 05:55:14,678 INFO L914 BasicCegarLoop]: 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-15 05:55:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 05:55:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-15 05:55:14,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:14,995 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-15 05:55:14,995 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-15 05:55:14,996 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-15 05:55:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:15,000 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:55:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-15 05:55:15,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:15,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:15,001 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-15 05:55:15,001 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-15 05:55:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:15,002 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-15 05:55:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-15 05:55:15,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:15,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:15,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:15,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:15,003 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-15 05:55:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2022-04-15 05:55:15,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2022-04-15 05:55:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:15,004 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2022-04-15 05:55:15,004 INFO L479 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-15 05:55:15,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 85 transitions. [2022-04-15 05:55:15,102 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-15 05:55:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-15 05:55:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 05:55:15,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:15,102 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:15,121 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-15 05:55:15,307 WARN L460 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-15 05:55:15,307 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 409430786, now seen corresponding path program 71 times [2022-04-15 05:55:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:15,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961304085] [2022-04-15 05:55:15,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:15,311 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:15,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash 409430786, now seen corresponding path program 72 times [2022-04-15 05:55:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:15,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270751247] [2022-04-15 05:55:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:15,932 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-15 05:55:15,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-15 05:55:15,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-15 05:55:15,933 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-15 05:55:15,933 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-15 05:55:15,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-15 05:55:15,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-15 05:55:15,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-15 05:55:15,933 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-15 05:55:15,933 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-15 05:55:15,934 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-15 05:55:15,934 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-15 05:55:15,935 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-15 05:55:15,935 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-15 05:55:15,935 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-15 05:55:15,936 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-15 05:55:15,936 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-15 05:55:15,936 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-15 05:55:15,937 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-15 05:55:15,937 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-15 05:55:15,937 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-15 05:55:15,937 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-15 05:55:15,938 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-15 05:55:15,938 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-15 05:55:15,939 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-15 05:55:15,939 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-15 05:55:15,939 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-15 05:55:15,939 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-15 05:55:15,940 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-15 05:55:15,940 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-15 05:55:15,941 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-15 05:55:15,941 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-15 05:55:15,941 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-15 05:55:15,941 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-15 05:55:15,942 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-15 05:55:15,942 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-15 05:55:15,942 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-15 05:55:15,943 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-15 05:55:15,943 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-15 05:55:15,943 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-15 05:55:15,944 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-15 05:55:15,944 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-15 05:55:15,945 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-15 05:55:15,945 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-15 05:55:15,945 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-15 05:55:15,945 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-15 05:55:15,946 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-15 05:55:15,946 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-15 05:55:15,946 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-15 05:55:15,947 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-15 05:55:15,947 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-15 05:55:15,947 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-15 05:55:15,948 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-15 05:55:15,948 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-15 05:55:15,948 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-15 05:55:15,949 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-15 05:55:15,949 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-15 05:55:15,949 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-15 05:55:15,950 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-15 05:55:15,950 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-15 05:55:15,950 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-15 05:55:15,951 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-15 05:55:15,951 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-15 05:55:15,951 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-15 05:55:15,952 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-15 05:55:15,952 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-15 05:55:15,952 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-15 05:55:15,953 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-15 05:55:15,953 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-15 05:55:15,953 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-15 05:55:15,954 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-15 05:55:15,954 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-15 05:55:15,955 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-15 05:55:15,955 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-15 05:55:15,955 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-15 05:55:15,955 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-15 05:55:15,956 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-15 05:55:15,956 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-15 05:55:15,957 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-15 05:55:15,957 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-15 05:55:15,957 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-15 05:55:15,958 INFO L290 TraceCheckUtils]: 78: Hoare triple {24534#(<= main_~i~0 36)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-15 05:55:15,958 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-15 05:55:15,958 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-15 05:55:15,958 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-15 05:55:15,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-15 05:55:15,958 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-15 05:55:15,958 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-15 05:55:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:15,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270751247] [2022-04-15 05:55:15,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270751247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:15,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55286471] [2022-04-15 05:55:15,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:55:15,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:15,968 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-15 05:55:15,969 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-15 05:55:24,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-15 05:55:24,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:24,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 05:55:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:24,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:25,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {24493#true} call ULTIMATE.init(); {24493#true} is VALID [2022-04-15 05:55:25,470 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-15 05:55:25,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-15 05:55:25,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-15 05:55:25,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-15 05:55:25,471 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-15 05:55:25,471 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-15 05:55:25,472 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-15 05:55:25,472 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-15 05:55:25,472 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-15 05:55:25,473 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-15 05:55:25,473 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-15 05:55:25,473 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-15 05:55:25,474 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-15 05:55:25,474 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-15 05:55:25,474 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-15 05:55:25,475 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-15 05:55:25,475 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-15 05:55:25,475 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-15 05:55:25,476 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-15 05:55:25,476 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-15 05:55:25,476 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-15 05:55:25,477 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-15 05:55:25,477 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-15 05:55:25,477 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-15 05:55:25,478 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-15 05:55:25,478 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-15 05:55:25,478 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-15 05:55:25,479 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-15 05:55:25,479 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-15 05:55:25,479 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-15 05:55:25,480 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-15 05:55:25,480 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-15 05:55:25,480 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-15 05:55:25,481 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-15 05:55:25,481 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-15 05:55:25,481 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-15 05:55:25,482 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-15 05:55:25,482 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-15 05:55:25,482 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-15 05:55:25,483 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-15 05:55:25,483 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-15 05:55:25,483 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-15 05:55:25,484 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-15 05:55:25,484 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-15 05:55:25,484 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-15 05:55:25,485 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-15 05:55:25,485 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-15 05:55:25,485 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-15 05:55:25,486 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-15 05:55:25,486 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-15 05:55:25,486 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-15 05:55:25,487 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-15 05:55:25,487 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-15 05:55:25,487 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-15 05:55:25,488 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-15 05:55:25,488 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-15 05:55:25,488 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-15 05:55:25,489 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-15 05:55:25,489 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-15 05:55:25,489 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-15 05:55:25,490 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-15 05:55:25,491 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-15 05:55:25,492 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-15 05:55:25,492 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-15 05:55:25,492 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-15 05:55:25,493 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-15 05:55:25,493 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-15 05:55:25,494 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-15 05:55:25,494 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-15 05:55:25,495 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-15 05:55:25,495 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-15 05:55:25,495 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-15 05:55:25,496 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-15 05:55:25,496 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-15 05:55:25,497 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-15 05:55:25,497 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-15 05:55:25,498 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-15 05:55:25,498 INFO L290 TraceCheckUtils]: 78: Hoare triple {24534#(<= main_~i~0 36)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-15 05:55:25,498 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-15 05:55:25,498 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-15 05:55:25,498 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-15 05:55:25,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-15 05:55:25,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-15 05:55:25,499 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-15 05:55:25,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:27,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {24494#false} assume !false; {24494#false} is VALID [2022-04-15 05:55:27,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {24494#false} assume 0 == ~cond; {24494#false} is VALID [2022-04-15 05:55:27,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {24494#false} ~cond := #in~cond; {24494#false} is VALID [2022-04-15 05:55:27,291 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-15 05:55:27,291 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-15 05:55:27,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {24804#(< main_~i~0 2048)} assume !(~i~0 < 2048); {24494#false} is VALID [2022-04-15 05:55:27,292 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-15 05:55:27,292 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-15 05:55:27,293 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-15 05:55:27,293 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-15 05:55:27,294 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-15 05:55:27,294 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-15 05:55:27,294 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-15 05:55:27,294 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-15 05:55:27,295 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-15 05:55:27,295 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-15 05:55:27,296 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-15 05:55:27,296 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-15 05:55:27,296 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-15 05:55:27,296 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-15 05:55:27,297 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-15 05:55:27,297 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-15 05:55:27,298 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-15 05:55:27,298 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-15 05:55:27,298 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-15 05:55:27,299 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-15 05:55:27,299 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-15 05:55:27,299 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-15 05:55:27,303 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-15 05:55:27,304 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-15 05:55:27,305 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-15 05:55:27,305 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-15 05:55:27,305 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-15 05:55:27,306 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-15 05:55:27,306 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-15 05:55:27,307 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-15 05:55:27,307 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-15 05:55:27,308 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-15 05:55:27,308 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-15 05:55:27,308 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-15 05:55:27,309 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-15 05:55:27,309 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-15 05:55:27,310 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-15 05:55:27,310 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-15 05:55:27,311 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-15 05:55:27,311 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-15 05:55:27,311 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-15 05:55:27,312 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-15 05:55:27,312 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-15 05:55:27,313 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-15 05:55:27,313 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-15 05:55:27,314 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-15 05:55:27,314 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-15 05:55:27,314 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-15 05:55:27,315 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-15 05:55:27,315 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-15 05:55:27,316 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-15 05:55:27,316 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-15 05:55:27,317 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-15 05:55:27,317 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-15 05:55:27,318 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-15 05:55:27,318 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-15 05:55:27,318 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-15 05:55:27,319 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-15 05:55:27,319 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-15 05:55:27,320 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-15 05:55:27,320 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-15 05:55:27,321 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-15 05:55:27,321 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-15 05:55:27,321 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-15 05:55:27,322 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-15 05:55:27,322 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-15 05:55:27,323 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-15 05:55:27,323 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-15 05:55:27,324 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-15 05:55:27,324 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-15 05:55:27,325 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-15 05:55:27,325 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-15 05:55:27,326 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-15 05:55:27,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {24493#true} call #t~ret5 := main(); {24493#true} is VALID [2022-04-15 05:55:27,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24493#true} {24493#true} #44#return; {24493#true} is VALID [2022-04-15 05:55:27,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {24493#true} assume true; {24493#true} is VALID [2022-04-15 05:55:27,326 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-15 05:55:27,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {24493#true} call ULTIMATE.init(); {24493#true} is VALID [2022-04-15 05:55:27,327 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-15 05:55:27,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55286471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:27,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:27,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 05:55:27,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961304085] [2022-04-15 05:55:27,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961304085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:27,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:27,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 05:55:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795126480] [2022-04-15 05:55:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:27,328 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-15 05:55:27,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:27,329 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-15 05:55:27,396 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-15 05:55:27,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 05:55:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 05:55:27,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 05:55:27,398 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-15 05:55:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:28,605 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:55:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 05:55:28,605 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-15 05:55:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:28,605 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-15 05:55:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-15 05:55:28,606 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-15 05:55:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2022-04-15 05:55:28,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 94 transitions. [2022-04-15 05:55:28,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:28,677 INFO L225 Difference]: With dead ends: 94 [2022-04-15 05:55:28,678 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 05:55:28,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 05:55:28,679 INFO L913 BasicCegarLoop]: 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-15 05:55:28,679 INFO L914 BasicCegarLoop]: 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-15 05:55:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 05:55:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-15 05:55:29,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:29,014 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-15 05:55:29,014 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-15 05:55:29,014 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-15 05:55:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:29,021 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:55:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-15 05:55:29,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:29,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:29,021 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-15 05:55:29,022 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-15 05:55:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:29,023 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-15 05:55:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-15 05:55:29,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:29,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:29,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:29,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:29,023 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-15 05:55:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-04-15 05:55:29,024 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2022-04-15 05:55:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:29,025 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-04-15 05:55:29,025 INFO L479 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-15 05:55:29,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 87 transitions. [2022-04-15 05:55:29,141 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-15 05:55:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-15 05:55:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 05:55:29,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:29,142 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:29,178 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-15 05:55:29,367 WARN L460 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-15 05:55:29,367 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1746874020, now seen corresponding path program 73 times [2022-04-15 05:55:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119597748] [2022-04-15 05:55:29,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:29,370 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:29,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1746874020, now seen corresponding path program 74 times [2022-04-15 05:55:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:29,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480344927] [2022-04-15 05:55:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:30,064 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-15 05:55:30,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-15 05:55:30,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-15 05:55:30,065 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-15 05:55:30,065 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-15 05:55:30,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-15 05:55:30,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-15 05:55:30,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-15 05:55:30,066 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-15 05:55:30,067 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-15 05:55:30,067 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-15 05:55:30,067 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-15 05:55:30,068 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-15 05:55:30,068 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-15 05:55:30,069 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-15 05:55:30,069 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-15 05:55:30,070 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-15 05:55:30,070 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-15 05:55:30,071 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-15 05:55:30,071 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-15 05:55:30,072 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-15 05:55:30,072 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-15 05:55:30,073 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-15 05:55:30,073 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-15 05:55:30,073 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-15 05:55:30,074 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-15 05:55:30,074 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-15 05:55:30,075 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-15 05:55:30,075 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-15 05:55:30,076 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-15 05:55:30,076 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-15 05:55:30,076 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-15 05:55:30,077 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-15 05:55:30,077 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-15 05:55:30,078 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-15 05:55:30,078 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-15 05:55:30,079 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-15 05:55:30,079 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-15 05:55:30,079 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-15 05:55:30,080 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-15 05:55:30,080 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-15 05:55:30,081 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-15 05:55:30,081 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-15 05:55:30,082 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-15 05:55:30,082 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-15 05:55:30,082 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-15 05:55:30,083 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-15 05:55:30,083 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-15 05:55:30,084 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-15 05:55:30,084 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-15 05:55:30,085 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-15 05:55:30,085 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-15 05:55:30,085 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-15 05:55:30,086 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-15 05:55:30,086 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-15 05:55:30,087 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-15 05:55:30,087 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-15 05:55:30,088 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-15 05:55:30,088 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-15 05:55:30,088 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-15 05:55:30,089 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-15 05:55:30,089 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-15 05:55:30,090 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-15 05:55:30,090 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-15 05:55:30,091 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-15 05:55:30,091 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-15 05:55:30,092 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-15 05:55:30,092 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-15 05:55:30,092 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-15 05:55:30,093 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-15 05:55:30,093 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-15 05:55:30,093 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-15 05:55:30,094 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-15 05:55:30,094 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-15 05:55:30,094 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-15 05:55:30,095 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-15 05:55:30,095 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-15 05:55:30,095 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-15 05:55:30,096 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-15 05:55:30,096 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-15 05:55:30,096 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-15 05:55:30,097 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-15 05:55:30,097 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-15 05:55:30,097 INFO L290 TraceCheckUtils]: 80: Hoare triple {25731#(<= main_~i~0 37)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-15 05:55:30,097 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-15 05:55:30,097 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-15 05:55:30,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-15 05:55:30,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-15 05:55:30,098 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-15 05:55:30,098 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-15 05:55:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480344927] [2022-04-15 05:55:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480344927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341846835] [2022-04-15 05:55:30,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:55:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:30,100 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-15 05:55:30,100 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-15 05:55:30,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:55:30,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:30,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 05:55:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:30,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:30,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {25689#true} call ULTIMATE.init(); {25689#true} is VALID [2022-04-15 05:55:30,865 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-15 05:55:30,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-15 05:55:30,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-15 05:55:30,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-15 05:55:30,866 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-15 05:55:30,866 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-15 05:55:30,867 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-15 05:55:30,867 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-15 05:55:30,867 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-15 05:55:30,867 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-15 05:55:30,868 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-15 05:55:30,868 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-15 05:55:30,869 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-15 05:55:30,869 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-15 05:55:30,869 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-15 05:55:30,869 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-15 05:55:30,870 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-15 05:55:30,870 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-15 05:55:30,870 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-15 05:55:30,871 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-15 05:55:30,871 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-15 05:55:30,871 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-15 05:55:30,872 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-15 05:55:30,872 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-15 05:55:30,872 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-15 05:55:30,873 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-15 05:55:30,873 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-15 05:55:30,873 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-15 05:55:30,874 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-15 05:55:30,874 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-15 05:55:30,874 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-15 05:55:30,875 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-15 05:55:30,875 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-15 05:55:30,875 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-15 05:55:30,876 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-15 05:55:30,876 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-15 05:55:30,876 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-15 05:55:30,877 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-15 05:55:30,877 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-15 05:55:30,877 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-15 05:55:30,878 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-15 05:55:30,878 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-15 05:55:30,878 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-15 05:55:30,879 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-15 05:55:30,879 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-15 05:55:30,879 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-15 05:55:30,880 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-15 05:55:30,880 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-15 05:55:30,880 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-15 05:55:30,881 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-15 05:55:30,881 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-15 05:55:30,881 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-15 05:55:30,882 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-15 05:55:30,882 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-15 05:55:30,882 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-15 05:55:30,883 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-15 05:55:30,883 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-15 05:55:30,883 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-15 05:55:30,884 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-15 05:55:30,884 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-15 05:55:30,884 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-15 05:55:30,885 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-15 05:55:30,885 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-15 05:55:30,885 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-15 05:55:30,886 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-15 05:55:30,886 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-15 05:55:30,886 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-15 05:55:30,887 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-15 05:55:30,887 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-15 05:55:30,887 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-15 05:55:30,888 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-15 05:55:30,888 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-15 05:55:30,888 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-15 05:55:30,889 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-15 05:55:30,889 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-15 05:55:30,889 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-15 05:55:30,890 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-15 05:55:30,890 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-15 05:55:30,890 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-15 05:55:30,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {25731#(<= main_~i~0 37)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-15 05:55:30,891 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-15 05:55:30,891 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-15 05:55:30,891 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-15 05:55:30,891 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-15 05:55:30,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-15 05:55:30,895 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-15 05:55:30,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:32,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {25690#false} assume !false; {25690#false} is VALID [2022-04-15 05:55:32,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {25690#false} assume 0 == ~cond; {25690#false} is VALID [2022-04-15 05:55:32,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {25690#false} ~cond := #in~cond; {25690#false} is VALID [2022-04-15 05:55:32,800 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-15 05:55:32,800 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-15 05:55:32,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {26007#(< main_~i~0 2048)} assume !(~i~0 < 2048); {25690#false} is VALID [2022-04-15 05:55:32,800 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-15 05:55:32,801 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-15 05:55:32,801 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-15 05:55:32,801 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-15 05:55:32,802 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-15 05:55:32,802 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-15 05:55:32,802 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-15 05:55:32,803 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-15 05:55:32,803 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-15 05:55:32,803 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-15 05:55:32,804 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-15 05:55:32,804 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-15 05:55:32,804 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-15 05:55:32,805 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-15 05:55:32,805 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-15 05:55:32,805 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-15 05:55:32,806 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-15 05:55:32,806 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-15 05:55:32,806 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-15 05:55:32,807 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-15 05:55:32,807 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-15 05:55:32,807 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-15 05:55:32,808 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-15 05:55:32,808 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-15 05:55:32,808 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-15 05:55:32,809 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-15 05:55:32,809 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-15 05:55:32,809 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-15 05:55:32,810 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-15 05:55:32,810 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-15 05:55:32,810 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-15 05:55:32,811 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-15 05:55:32,811 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-15 05:55:32,811 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-15 05:55:32,812 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-15 05:55:32,812 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-15 05:55:32,812 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-15 05:55:32,813 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-15 05:55:32,813 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-15 05:55:32,813 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-15 05:55:32,814 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-15 05:55:32,814 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-15 05:55:32,814 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-15 05:55:32,815 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-15 05:55:32,815 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-15 05:55:32,815 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-15 05:55:32,816 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-15 05:55:32,816 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-15 05:55:32,816 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-15 05:55:32,817 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-15 05:55:32,817 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-15 05:55:32,817 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-15 05:55:32,818 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-15 05:55:32,818 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-15 05:55:32,818 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-15 05:55:32,819 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-15 05:55:32,819 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-15 05:55:32,819 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-15 05:55:32,820 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-15 05:55:32,820 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-15 05:55:32,820 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-15 05:55:32,821 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-15 05:55:32,821 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-15 05:55:32,821 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-15 05:55:32,822 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-15 05:55:32,822 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-15 05:55:32,822 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-15 05:55:32,823 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-15 05:55:32,823 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-15 05:55:32,823 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-15 05:55:32,824 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-15 05:55:32,824 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-15 05:55:32,824 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-15 05:55:32,825 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-15 05:55:32,825 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-15 05:55:32,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {25689#true} call #t~ret5 := main(); {25689#true} is VALID [2022-04-15 05:55:32,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25689#true} {25689#true} #44#return; {25689#true} is VALID [2022-04-15 05:55:32,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {25689#true} assume true; {25689#true} is VALID [2022-04-15 05:55:32,826 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-15 05:55:32,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {25689#true} call ULTIMATE.init(); {25689#true} is VALID [2022-04-15 05:55:32,826 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-15 05:55:32,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341846835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:32,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:32,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 05:55:32,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:32,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119597748] [2022-04-15 05:55:32,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119597748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:32,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:32,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 05:55:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935586156] [2022-04-15 05:55:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:32,828 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-15 05:55:32,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:32,828 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-15 05:55:32,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:32,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 05:55:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 05:55:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 05:55:32,884 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-15 05:55:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:34,155 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:55:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 05:55:34,156 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-15 05:55:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:34,156 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-15 05:55:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 05:55:34,157 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-15 05:55:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2022-04-15 05:55:34,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 96 transitions. [2022-04-15 05:55:34,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:34,229 INFO L225 Difference]: With dead ends: 96 [2022-04-15 05:55:34,229 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 05:55:34,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 05:55:34,231 INFO L913 BasicCegarLoop]: 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-15 05:55:34,231 INFO L914 BasicCegarLoop]: 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-15 05:55:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 05:55:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-15 05:55:34,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:34,564 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-15 05:55:34,564 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-15 05:55:34,564 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-15 05:55:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:34,565 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:55:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-15 05:55:34,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:34,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:34,565 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-15 05:55:34,565 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-15 05:55:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:34,566 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-15 05:55:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-15 05:55:34,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:34,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:34,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:34,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:34,567 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-15 05:55:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-04-15 05:55:34,568 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2022-04-15 05:55:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:34,568 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-04-15 05:55:34,568 INFO L479 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-15 05:55:34,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 89 transitions. [2022-04-15 05:55:34,700 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-15 05:55:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-15 05:55:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 05:55:34,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:34,701 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:34,729 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-15 05:55:34,925 WARN L460 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-15 05:55:34,925 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1460366906, now seen corresponding path program 75 times [2022-04-15 05:55:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:34,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86816221] [2022-04-15 05:55:34,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:34,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:34,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1460366906, now seen corresponding path program 76 times [2022-04-15 05:55:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:34,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007916144] [2022-04-15 05:55:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:35,680 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-15 05:55:35,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-15 05:55:35,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-15 05:55:35,681 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-15 05:55:35,682 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-15 05:55:35,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-15 05:55:35,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-15 05:55:35,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-15 05:55:35,682 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-15 05:55:35,683 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-15 05:55:35,683 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-15 05:55:35,684 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-15 05:55:35,684 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-15 05:55:35,685 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-15 05:55:35,685 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-15 05:55:35,686 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-15 05:55:35,686 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-15 05:55:35,686 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-15 05:55:35,687 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-15 05:55:35,687 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-15 05:55:35,688 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-15 05:55:35,688 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-15 05:55:35,689 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-15 05:55:35,689 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-15 05:55:35,690 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-15 05:55:35,690 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-15 05:55:35,691 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-15 05:55:35,691 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-15 05:55:35,692 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-15 05:55:35,692 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-15 05:55:35,693 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-15 05:55:35,693 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-15 05:55:35,694 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-15 05:55:35,694 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-15 05:55:35,694 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-15 05:55:35,695 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-15 05:55:35,695 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-15 05:55:35,695 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-15 05:55:35,696 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-15 05:55:35,696 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-15 05:55:35,696 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-15 05:55:35,697 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-15 05:55:35,697 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-15 05:55:35,697 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-15 05:55:35,698 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-15 05:55:35,698 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-15 05:55:35,698 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-15 05:55:35,699 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-15 05:55:35,699 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-15 05:55:35,699 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-15 05:55:35,700 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-15 05:55:35,700 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-15 05:55:35,700 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-15 05:55:35,700 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-15 05:55:35,701 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-15 05:55:35,701 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-15 05:55:35,702 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-15 05:55:35,702 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-15 05:55:35,702 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-15 05:55:35,702 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-15 05:55:35,703 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-15 05:55:35,703 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-15 05:55:35,703 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-15 05:55:35,704 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-15 05:55:35,704 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-15 05:55:35,704 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-15 05:55:35,705 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-15 05:55:35,705 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-15 05:55:35,705 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-15 05:55:35,706 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-15 05:55:35,706 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-15 05:55:35,706 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-15 05:55:35,707 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-15 05:55:35,707 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-15 05:55:35,707 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-15 05:55:35,708 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-15 05:55:35,708 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-15 05:55:35,708 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-15 05:55:35,709 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-15 05:55:35,709 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-15 05:55:35,709 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-15 05:55:35,710 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-15 05:55:35,710 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-15 05:55:35,710 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-15 05:55:35,711 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-15 05:55:35,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {26956#(<= main_~i~0 38)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-15 05:55:35,711 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-15 05:55:35,711 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-15 05:55:35,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-15 05:55:35,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-15 05:55:35,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-15 05:55:35,712 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-15 05:55:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007916144] [2022-04-15 05:55:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007916144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705203548] [2022-04-15 05:55:35,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:55:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:35,713 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-15 05:55:35,714 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-15 05:55:35,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:55:35,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:35,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 05:55:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:35,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:36,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26913#true} is VALID [2022-04-15 05:55:36,483 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-15 05:55:36,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-15 05:55:36,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-15 05:55:36,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-15 05:55:36,484 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-15 05:55:36,484 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-15 05:55:36,485 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-15 05:55:36,485 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-15 05:55:36,485 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-15 05:55:36,486 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-15 05:55:36,486 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-15 05:55:36,486 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-15 05:55:36,487 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-15 05:55:36,487 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-15 05:55:36,487 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-15 05:55:36,488 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-15 05:55:36,488 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-15 05:55:36,488 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-15 05:55:36,489 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-15 05:55:36,489 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-15 05:55:36,489 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-15 05:55:36,490 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-15 05:55:36,490 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-15 05:55:36,490 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-15 05:55:36,491 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-15 05:55:36,491 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-15 05:55:36,491 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-15 05:55:36,491 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-15 05:55:36,492 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-15 05:55:36,492 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-15 05:55:36,493 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-15 05:55:36,493 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-15 05:55:36,493 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-15 05:55:36,493 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-15 05:55:36,494 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-15 05:55:36,494 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-15 05:55:36,494 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-15 05:55:36,495 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-15 05:55:36,495 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-15 05:55:36,495 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-15 05:55:36,496 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-15 05:55:36,496 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-15 05:55:36,496 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-15 05:55:36,497 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-15 05:55:36,497 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-15 05:55:36,497 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-15 05:55:36,498 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-15 05:55:36,498 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-15 05:55:36,498 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-15 05:55:36,499 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-15 05:55:36,499 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-15 05:55:36,499 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-15 05:55:36,500 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-15 05:55:36,500 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-15 05:55:36,501 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-15 05:55:36,501 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-15 05:55:36,501 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-15 05:55:36,501 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-15 05:55:36,502 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-15 05:55:36,502 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-15 05:55:36,503 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-15 05:55:36,503 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-15 05:55:36,503 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-15 05:55:36,503 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-15 05:55:36,504 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-15 05:55:36,504 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-15 05:55:36,505 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-15 05:55:36,505 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-15 05:55:36,505 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-15 05:55:36,505 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-15 05:55:36,506 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-15 05:55:36,506 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-15 05:55:36,506 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-15 05:55:36,507 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-15 05:55:36,507 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-15 05:55:36,507 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-15 05:55:36,508 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-15 05:55:36,508 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-15 05:55:36,508 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-15 05:55:36,509 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-15 05:55:36,509 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-15 05:55:36,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {26956#(<= main_~i~0 38)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-15 05:55:36,510 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-15 05:55:36,510 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-15 05:55:36,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-15 05:55:36,510 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-15 05:55:36,510 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-15 05:55:36,510 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-15 05:55:36,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:38,448 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-15 05:55:38,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume 0 == ~cond; {26914#false} is VALID [2022-04-15 05:55:38,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} ~cond := #in~cond; {26914#false} is VALID [2022-04-15 05:55:38,449 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-15 05:55:38,449 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-15 05:55:38,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {27238#(< main_~i~0 2048)} assume !(~i~0 < 2048); {26914#false} is VALID [2022-04-15 05:55:38,450 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-15 05:55:38,451 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-15 05:55:38,451 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-15 05:55:38,452 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-15 05:55:38,452 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-15 05:55:38,452 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-15 05:55:38,453 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-15 05:55:38,453 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-15 05:55:38,453 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-15 05:55:38,454 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-15 05:55:38,454 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-15 05:55:38,454 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-15 05:55:38,455 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-15 05:55:38,455 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-15 05:55:38,455 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-15 05:55:38,456 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-15 05:55:38,456 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-15 05:55:38,456 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-15 05:55:38,457 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-15 05:55:38,457 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-15 05:55:38,457 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-15 05:55:38,458 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-15 05:55:38,458 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-15 05:55:38,458 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-15 05:55:38,459 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-15 05:55:38,459 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-15 05:55:38,459 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-15 05:55:38,460 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-15 05:55:38,460 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-15 05:55:38,460 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-15 05:55:38,461 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-15 05:55:38,461 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-15 05:55:38,461 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-15 05:55:38,462 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-15 05:55:38,462 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-15 05:55:38,462 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-15 05:55:38,463 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-15 05:55:38,463 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-15 05:55:38,463 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-15 05:55:38,464 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-15 05:55:38,464 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-15 05:55:38,464 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-15 05:55:38,465 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-15 05:55:38,465 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-15 05:55:38,465 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-15 05:55:38,466 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-15 05:55:38,466 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-15 05:55:38,466 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-15 05:55:38,467 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-15 05:55:38,467 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-15 05:55:38,467 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-15 05:55:38,468 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-15 05:55:38,468 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-15 05:55:38,468 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-15 05:55:38,469 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-15 05:55:38,469 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-15 05:55:38,469 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-15 05:55:38,470 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-15 05:55:38,470 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-15 05:55:38,470 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-15 05:55:38,471 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-15 05:55:38,471 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-15 05:55:38,471 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-15 05:55:38,472 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-15 05:55:38,472 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-15 05:55:38,472 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-15 05:55:38,473 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-15 05:55:38,473 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-15 05:55:38,473 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-15 05:55:38,474 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-15 05:55:38,474 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-15 05:55:38,474 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-15 05:55:38,475 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-15 05:55:38,475 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-15 05:55:38,475 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-15 05:55:38,476 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-15 05:55:38,476 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-15 05:55:38,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret5 := main(); {26913#true} is VALID [2022-04-15 05:55:38,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #44#return; {26913#true} is VALID [2022-04-15 05:55:38,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-15 05:55:38,476 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-15 05:55:38,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26913#true} is VALID [2022-04-15 05:55:38,477 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-15 05:55:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705203548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:38,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:38,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 05:55:38,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86816221] [2022-04-15 05:55:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86816221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:38,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:38,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 05:55:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710703120] [2022-04-15 05:55:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:38,478 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-15 05:55:38,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:38,478 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-15 05:55:38,538 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-15 05:55:38,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 05:55:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 05:55:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:55:38,540 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-15 05:55:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:39,827 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:55:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 05:55:39,827 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-15 05:55:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:39,827 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-15 05:55:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-15 05:55:39,828 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-15 05:55:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2022-04-15 05:55:39,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 98 transitions. [2022-04-15 05:55:39,908 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-15 05:55:39,909 INFO L225 Difference]: With dead ends: 98 [2022-04-15 05:55:39,909 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 05:55:39,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6402, Invalid=8118, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 05:55:39,910 INFO L913 BasicCegarLoop]: 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-15 05:55:39,910 INFO L914 BasicCegarLoop]: 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-15 05:55:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 05:55:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-15 05:55:40,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:40,269 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-15 05:55:40,269 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-15 05:55:40,269 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-15 05:55:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:40,270 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:55:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-15 05:55:40,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:40,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:40,271 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-15 05:55:40,271 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-15 05:55:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:40,272 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-15 05:55:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-15 05:55:40,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:40,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:40,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:40,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:40,272 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-15 05:55:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-04-15 05:55:40,274 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2022-04-15 05:55:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:40,274 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-04-15 05:55:40,274 INFO L479 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-15 05:55:40,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 91 transitions. [2022-04-15 05:55:40,379 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-15 05:55:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-15 05:55:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 05:55:40,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:40,379 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:40,398 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-15 05:55:40,580 WARN L460 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-15 05:55:40,580 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash 167621736, now seen corresponding path program 77 times [2022-04-15 05:55:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:40,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61445473] [2022-04-15 05:55:40,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:40,584 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:40,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 167621736, now seen corresponding path program 78 times [2022-04-15 05:55:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:40,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874339945] [2022-04-15 05:55:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:41,272 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-15 05:55:41,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-15 05:55:41,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-15 05:55:41,273 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-15 05:55:41,273 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-15 05:55:41,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-15 05:55:41,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-15 05:55:41,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-15 05:55:41,273 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-15 05:55:41,274 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-15 05:55:41,274 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-15 05:55:41,274 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-15 05:55:41,275 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-15 05:55:41,275 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-15 05:55:41,275 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-15 05:55:41,276 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-15 05:55:41,276 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-15 05:55:41,276 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-15 05:55:41,277 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-15 05:55:41,277 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-15 05:55:41,277 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-15 05:55:41,278 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-15 05:55:41,278 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-15 05:55:41,278 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-15 05:55:41,279 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-15 05:55:41,279 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-15 05:55:41,279 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-15 05:55:41,280 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-15 05:55:41,287 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-15 05:55:41,288 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-15 05:55:41,289 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-15 05:55:41,289 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-15 05:55:41,290 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-15 05:55:41,290 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-15 05:55:41,290 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-15 05:55:41,291 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-15 05:55:41,291 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-15 05:55:41,292 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-15 05:55:41,292 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-15 05:55:41,293 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-15 05:55:41,293 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-15 05:55:41,294 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-15 05:55:41,294 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-15 05:55:41,295 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-15 05:55:41,295 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-15 05:55:41,295 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-15 05:55:41,296 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-15 05:55:41,296 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-15 05:55:41,297 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-15 05:55:41,297 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-15 05:55:41,298 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-15 05:55:41,298 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-15 05:55:41,299 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-15 05:55:41,299 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-15 05:55:41,300 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-15 05:55:41,300 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-15 05:55:41,301 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-15 05:55:41,301 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-15 05:55:41,301 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-15 05:55:41,302 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-15 05:55:41,302 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-15 05:55:41,303 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-15 05:55:41,303 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-15 05:55:41,304 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-15 05:55:41,304 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-15 05:55:41,305 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-15 05:55:41,305 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-15 05:55:41,305 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-15 05:55:41,306 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-15 05:55:41,306 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-15 05:55:41,307 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-15 05:55:41,307 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-15 05:55:41,308 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-15 05:55:41,308 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-15 05:55:41,309 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-15 05:55:41,309 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-15 05:55:41,310 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-15 05:55:41,310 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-15 05:55:41,311 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-15 05:55:41,311 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-15 05:55:41,311 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-15 05:55:41,312 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-15 05:55:41,312 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-15 05:55:41,313 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-15 05:55:41,313 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-15 05:55:41,313 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-15 05:55:41,314 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-15 05:55:41,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {28209#(<= main_~i~0 39)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-15 05:55:41,314 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-15 05:55:41,315 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-15 05:55:41,315 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-15 05:55:41,315 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-15 05:55:41,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-15 05:55:41,315 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-15 05:55:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:41,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874339945] [2022-04-15 05:55:41,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874339945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:41,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948874875] [2022-04-15 05:55:41,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:55:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:41,317 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-15 05:55:41,319 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-15 05:55:54,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-15 05:55:54,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:54,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 05:55:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:54,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:54,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {28165#true} call ULTIMATE.init(); {28165#true} is VALID [2022-04-15 05:55:54,984 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-15 05:55:54,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-15 05:55:54,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-15 05:55:54,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-15 05:55:54,985 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-15 05:55:54,986 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-15 05:55:54,986 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-15 05:55:54,986 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-15 05:55:54,987 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-15 05:55:54,987 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-15 05:55:54,987 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-15 05:55:54,988 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-15 05:55:54,988 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-15 05:55:54,988 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-15 05:55:54,989 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-15 05:55:54,989 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-15 05:55:54,989 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-15 05:55:54,990 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-15 05:55:54,990 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-15 05:55:54,990 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-15 05:55:54,991 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-15 05:55:54,991 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-15 05:55:54,991 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-15 05:55:54,992 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-15 05:55:54,992 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-15 05:55:54,992 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-15 05:55:54,993 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-15 05:55:54,993 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-15 05:55:54,993 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-15 05:55:54,994 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-15 05:55:54,994 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-15 05:55:54,994 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-15 05:55:54,995 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-15 05:55:54,995 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-15 05:55:54,995 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-15 05:55:54,996 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-15 05:55:54,996 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-15 05:55:54,996 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-15 05:55:54,997 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-15 05:55:54,997 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-15 05:55:54,997 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-15 05:55:54,998 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-15 05:55:54,998 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-15 05:55:54,998 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-15 05:55:54,999 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-15 05:55:54,999 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-15 05:55:54,999 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-15 05:55:54,999 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-15 05:55:55,000 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-15 05:55:55,000 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-15 05:55:55,001 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-15 05:55:55,001 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-15 05:55:55,001 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-15 05:55:55,001 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-15 05:55:55,002 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-15 05:55:55,002 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-15 05:55:55,003 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-15 05:55:55,003 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-15 05:55:55,003 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-15 05:55:55,003 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-15 05:55:55,004 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-15 05:55:55,004 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-15 05:55:55,005 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-15 05:55:55,005 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-15 05:55:55,005 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-15 05:55:55,005 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-15 05:55:55,006 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-15 05:55:55,006 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-15 05:55:55,006 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-15 05:55:55,007 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-15 05:55:55,007 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-15 05:55:55,007 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-15 05:55:55,008 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-15 05:55:55,008 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-15 05:55:55,008 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-15 05:55:55,009 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-15 05:55:55,009 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-15 05:55:55,009 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-15 05:55:55,010 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-15 05:55:55,010 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-15 05:55:55,010 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-15 05:55:55,011 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-15 05:55:55,011 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-15 05:55:55,011 INFO L290 TraceCheckUtils]: 84: Hoare triple {28209#(<= main_~i~0 39)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-15 05:55:55,012 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-15 05:55:55,012 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-15 05:55:55,012 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-15 05:55:55,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-15 05:55:55,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-15 05:55:55,012 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-15 05:55:55,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:57,048 INFO L290 TraceCheckUtils]: 89: Hoare triple {28166#false} assume !false; {28166#false} is VALID [2022-04-15 05:55:57,049 INFO L290 TraceCheckUtils]: 88: Hoare triple {28166#false} assume 0 == ~cond; {28166#false} is VALID [2022-04-15 05:55:57,049 INFO L290 TraceCheckUtils]: 87: Hoare triple {28166#false} ~cond := #in~cond; {28166#false} is VALID [2022-04-15 05:55:57,049 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-15 05:55:57,049 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-15 05:55:57,049 INFO L290 TraceCheckUtils]: 84: Hoare triple {28497#(< main_~i~0 2048)} assume !(~i~0 < 2048); {28166#false} is VALID [2022-04-15 05:55:57,050 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-15 05:55:57,050 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-15 05:55:57,050 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-15 05:55:57,050 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-15 05:55:57,051 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-15 05:55:57,051 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-15 05:55:57,052 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-15 05:55:57,052 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-15 05:55:57,052 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-15 05:55:57,052 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-15 05:55:57,053 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-15 05:55:57,053 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-15 05:55:57,054 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-15 05:55:57,054 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-15 05:55:57,054 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-15 05:55:57,054 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-15 05:55:57,055 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-15 05:55:57,055 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-15 05:55:57,056 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-15 05:55:57,056 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-15 05:55:57,056 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-15 05:55:57,056 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-15 05:55:57,057 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-15 05:55:57,057 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-15 05:55:57,058 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-15 05:55:57,058 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-15 05:55:57,058 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-15 05:55:57,058 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-15 05:55:57,059 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-15 05:55:57,059 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-15 05:55:57,060 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-15 05:55:57,060 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-15 05:55:57,060 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-15 05:55:57,060 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-15 05:55:57,061 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-15 05:55:57,061 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-15 05:55:57,061 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-15 05:55:57,062 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-15 05:55:57,062 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-15 05:55:57,062 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-15 05:55:57,063 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-15 05:55:57,063 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-15 05:55:57,064 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-15 05:55:57,064 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-15 05:55:57,064 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-15 05:55:57,064 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-15 05:55:57,065 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-15 05:55:57,065 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-15 05:55:57,065 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-15 05:55:57,066 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-15 05:55:57,066 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-15 05:55:57,066 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-15 05:55:57,067 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-15 05:55:57,067 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-15 05:55:57,067 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-15 05:55:57,068 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-15 05:55:57,068 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-15 05:55:57,068 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-15 05:55:57,069 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-15 05:55:57,069 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-15 05:55:57,069 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-15 05:55:57,070 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-15 05:55:57,070 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-15 05:55:57,070 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-15 05:55:57,071 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-15 05:55:57,071 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-15 05:55:57,072 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-15 05:55:57,072 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-15 05:55:57,072 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-15 05:55:57,072 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-15 05:55:57,073 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-15 05:55:57,073 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-15 05:55:57,074 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-15 05:55:57,074 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-15 05:55:57,074 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-15 05:55:57,074 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-15 05:55:57,075 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-15 05:55:57,075 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-15 05:55:57,076 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-15 05:55:57,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {28165#true} call #t~ret5 := main(); {28165#true} is VALID [2022-04-15 05:55:57,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28165#true} {28165#true} #44#return; {28165#true} is VALID [2022-04-15 05:55:57,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {28165#true} assume true; {28165#true} is VALID [2022-04-15 05:55:57,076 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-15 05:55:57,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {28165#true} call ULTIMATE.init(); {28165#true} is VALID [2022-04-15 05:55:57,076 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-15 05:55:57,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948874875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:57,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:57,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 05:55:57,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:57,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61445473] [2022-04-15 05:55:57,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61445473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:57,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:57,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 05:55:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240587817] [2022-04-15 05:55:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:57,078 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-15 05:55:57,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:57,078 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-15 05:55:57,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:57,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 05:55:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 05:55:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 05:55:57,140 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-15 05:55:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:58,488 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:55:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 05:55:58,489 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-15 05:55:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:58,489 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-15 05:55:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-15 05:55:58,490 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-15 05:55:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2022-04-15 05:55:58,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 100 transitions. [2022-04-15 05:55:58,567 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-15 05:55:58,568 INFO L225 Difference]: With dead ends: 100 [2022-04-15 05:55:58,568 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 05:55:58,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 05:55:58,570 INFO L913 BasicCegarLoop]: 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-15 05:55:58,570 INFO L914 BasicCegarLoop]: 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-15 05:55:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 05:55:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-04-15 05:55:58,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:58,938 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-15 05:55:58,938 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-15 05:55:58,938 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-15 05:55:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:58,939 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:55:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-15 05:55:58,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:58,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:58,939 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-15 05:55:58,940 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-15 05:55:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:58,941 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-15 05:55:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-15 05:55:58,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:58,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:58,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:58,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:58,941 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-15 05:55:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2022-04-15 05:55:58,942 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2022-04-15 05:55:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:58,943 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2022-04-15 05:55:58,943 INFO L479 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-15 05:55:58,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 93 transitions. [2022-04-15 05:55:59,052 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-15 05:55:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-15 05:55:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 05:55:59,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:59,053 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:59,093 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-15 05:55:59,275 WARN L460 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-15 05:55:59,275 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1296610954, now seen corresponding path program 79 times [2022-04-15 05:55:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780910704] [2022-04-15 05:55:59,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:59,278 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:59,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1296610954, now seen corresponding path program 80 times [2022-04-15 05:55:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:59,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570424463] [2022-04-15 05:55:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:59,984 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-15 05:55:59,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-15 05:55:59,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-15 05:55:59,985 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-15 05:55:59,985 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-15 05:55:59,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-15 05:55:59,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-15 05:55:59,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-15 05:55:59,990 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-15 05:55:59,990 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-15 05:55:59,991 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-15 05:55:59,991 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-15 05:55:59,991 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-15 05:55:59,992 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-15 05:55:59,992 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-15 05:55:59,992 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-15 05:55:59,993 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-15 05:55:59,993 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-15 05:55:59,993 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-15 05:55:59,994 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-15 05:55:59,994 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-15 05:55:59,994 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-15 05:55:59,995 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-15 05:55:59,995 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-15 05:55:59,995 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-15 05:55:59,996 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-15 05:55:59,996 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-15 05:55:59,996 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-15 05:55:59,997 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-15 05:55:59,997 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-15 05:55:59,997 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-15 05:55:59,998 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-15 05:55:59,998 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-15 05:55:59,998 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-15 05:55:59,999 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-15 05:55:59,999 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-15 05:55:59,999 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-15 05:56:00,000 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-15 05:56:00,000 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-15 05:56:00,000 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-15 05:56:00,001 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-15 05:56:00,001 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-15 05:56:00,001 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-15 05:56:00,002 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-15 05:56:00,002 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-15 05:56:00,002 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-15 05:56:00,003 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-15 05:56:00,003 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-15 05:56:00,003 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-15 05:56:00,004 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-15 05:56:00,004 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-15 05:56:00,004 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-15 05:56:00,005 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-15 05:56:00,005 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-15 05:56:00,005 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-15 05:56:00,006 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-15 05:56:00,006 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-15 05:56:00,006 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-15 05:56:00,007 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-15 05:56:00,007 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-15 05:56:00,007 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-15 05:56:00,008 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-15 05:56:00,008 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-15 05:56:00,008 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-15 05:56:00,009 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-15 05:56:00,009 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-15 05:56:00,009 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-15 05:56:00,010 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-15 05:56:00,010 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-15 05:56:00,010 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-15 05:56:00,011 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-15 05:56:00,011 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-15 05:56:00,011 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-15 05:56:00,012 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-15 05:56:00,012 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-15 05:56:00,012 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-15 05:56:00,013 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-15 05:56:00,013 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-15 05:56:00,013 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-15 05:56:00,014 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-15 05:56:00,014 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-15 05:56:00,014 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-15 05:56:00,015 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-15 05:56:00,015 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-15 05:56:00,015 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-15 05:56:00,016 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-15 05:56:00,016 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-15 05:56:00,016 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-15 05:56:00,017 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-15 05:56:00,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {29490#(<= main_~i~0 40)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-15 05:56:00,017 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-15 05:56:00,017 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-15 05:56:00,017 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-15 05:56:00,017 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-15 05:56:00,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-15 05:56:00,018 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-15 05:56:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570424463] [2022-04-15 05:56:00,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570424463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055265760] [2022-04-15 05:56:00,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:00,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:00,019 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-15 05:56:00,020 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-15 05:56:00,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:00,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:00,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 05:56:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:00,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {29445#true} call ULTIMATE.init(); {29445#true} is VALID [2022-04-15 05:56:00,848 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-15 05:56:00,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-15 05:56:00,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-15 05:56:00,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-15 05:56:00,849 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-15 05:56:00,849 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-15 05:56:00,850 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-15 05:56:00,850 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-15 05:56:00,850 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-15 05:56:00,851 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-15 05:56:00,851 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-15 05:56:00,852 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-15 05:56:00,852 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-15 05:56:00,853 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-15 05:56:00,853 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-15 05:56:00,854 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-15 05:56:00,854 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-15 05:56:00,854 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-15 05:56:00,855 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-15 05:56:00,855 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-15 05:56:00,856 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-15 05:56:00,856 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-15 05:56:00,857 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-15 05:56:00,857 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-15 05:56:00,858 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-15 05:56:00,858 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-15 05:56:00,859 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-15 05:56:00,859 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-15 05:56:00,859 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-15 05:56:00,860 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-15 05:56:00,860 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-15 05:56:00,861 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-15 05:56:00,861 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-15 05:56:00,862 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-15 05:56:00,862 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-15 05:56:00,863 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-15 05:56:00,863 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-15 05:56:00,864 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-15 05:56:00,864 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-15 05:56:00,865 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-15 05:56:00,865 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-15 05:56:00,866 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-15 05:56:00,866 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-15 05:56:00,866 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-15 05:56:00,867 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-15 05:56:00,867 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-15 05:56:00,868 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-15 05:56:00,868 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-15 05:56:00,869 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-15 05:56:00,869 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-15 05:56:00,870 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-15 05:56:00,870 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-15 05:56:00,871 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-15 05:56:00,871 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-15 05:56:00,872 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-15 05:56:00,872 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-15 05:56:00,872 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-15 05:56:00,873 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-15 05:56:00,873 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-15 05:56:00,874 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-15 05:56:00,874 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-15 05:56:00,874 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-15 05:56:00,875 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-15 05:56:00,875 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-15 05:56:00,876 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-15 05:56:00,876 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-15 05:56:00,876 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-15 05:56:00,876 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-15 05:56:00,877 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-15 05:56:00,877 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-15 05:56:00,878 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-15 05:56:00,878 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-15 05:56:00,878 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-15 05:56:00,878 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-15 05:56:00,879 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-15 05:56:00,879 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-15 05:56:00,880 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-15 05:56:00,880 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-15 05:56:00,880 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-15 05:56:00,880 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-15 05:56:00,881 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-15 05:56:00,881 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-15 05:56:00,882 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-15 05:56:00,882 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-15 05:56:00,882 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-15 05:56:00,883 INFO L290 TraceCheckUtils]: 86: Hoare triple {29490#(<= main_~i~0 40)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-15 05:56:00,883 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-15 05:56:00,883 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-15 05:56:00,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-15 05:56:00,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-15 05:56:00,883 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-15 05:56:00,883 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-15 05:56:00,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:03,116 INFO L290 TraceCheckUtils]: 91: Hoare triple {29446#false} assume !false; {29446#false} is VALID [2022-04-15 05:56:03,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {29446#false} assume 0 == ~cond; {29446#false} is VALID [2022-04-15 05:56:03,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {29446#false} ~cond := #in~cond; {29446#false} is VALID [2022-04-15 05:56:03,117 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-15 05:56:03,117 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-15 05:56:03,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {29784#(< main_~i~0 2048)} assume !(~i~0 < 2048); {29446#false} is VALID [2022-04-15 05:56:03,119 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-15 05:56:03,119 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-15 05:56:03,119 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-15 05:56:03,120 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-15 05:56:03,120 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-15 05:56:03,120 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-15 05:56:03,121 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-15 05:56:03,121 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-15 05:56:03,121 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-15 05:56:03,122 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-15 05:56:03,122 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-15 05:56:03,122 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-15 05:56:03,123 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-15 05:56:03,123 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-15 05:56:03,123 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-15 05:56:03,124 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-15 05:56:03,124 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-15 05:56:03,124 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-15 05:56:03,125 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-15 05:56:03,125 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-15 05:56:03,126 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-15 05:56:03,126 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-15 05:56:03,126 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-15 05:56:03,126 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-15 05:56:03,127 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-15 05:56:03,127 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-15 05:56:03,128 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-15 05:56:03,128 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-15 05:56:03,128 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-15 05:56:03,129 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-15 05:56:03,129 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-15 05:56:03,129 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-15 05:56:03,130 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-15 05:56:03,130 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-15 05:56:03,130 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-15 05:56:03,131 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-15 05:56:03,131 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-15 05:56:03,131 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-15 05:56:03,132 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-15 05:56:03,132 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-15 05:56:03,132 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-15 05:56:03,133 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-15 05:56:03,133 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-15 05:56:03,133 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-15 05:56:03,134 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-15 05:56:03,134 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-15 05:56:03,134 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-15 05:56:03,135 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-15 05:56:03,135 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-15 05:56:03,135 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-15 05:56:03,136 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-15 05:56:03,136 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-15 05:56:03,136 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-15 05:56:03,137 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-15 05:56:03,137 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-15 05:56:03,137 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-15 05:56:03,138 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-15 05:56:03,138 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-15 05:56:03,138 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-15 05:56:03,139 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-15 05:56:03,139 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-15 05:56:03,139 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-15 05:56:03,140 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-15 05:56:03,140 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-15 05:56:03,140 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-15 05:56:03,141 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-15 05:56:03,141 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-15 05:56:03,141 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-15 05:56:03,142 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-15 05:56:03,142 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-15 05:56:03,143 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-15 05:56:03,143 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-15 05:56:03,143 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-15 05:56:03,144 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-15 05:56:03,144 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-15 05:56:03,144 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-15 05:56:03,145 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-15 05:56:03,145 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-15 05:56:03,145 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-15 05:56:03,146 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-15 05:56:03,146 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-15 05:56:03,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {29445#true} call #t~ret5 := main(); {29445#true} is VALID [2022-04-15 05:56:03,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29445#true} {29445#true} #44#return; {29445#true} is VALID [2022-04-15 05:56:03,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {29445#true} assume true; {29445#true} is VALID [2022-04-15 05:56:03,146 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-15 05:56:03,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {29445#true} call ULTIMATE.init(); {29445#true} is VALID [2022-04-15 05:56:03,147 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-15 05:56:03,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055265760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:03,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:03,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 05:56:03,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:03,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780910704] [2022-04-15 05:56:03,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780910704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:03,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:03,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 05:56:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174786900] [2022-04-15 05:56:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:03,148 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-15 05:56:03,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:03,149 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-15 05:56:03,209 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-15 05:56:03,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 05:56:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 05:56:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 05:56:03,211 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-15 05:56:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:04,665 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:56:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 05:56:04,665 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-15 05:56:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:04,665 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-15 05:56:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-15 05:56:04,666 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-15 05:56:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 102 transitions. [2022-04-15 05:56:04,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 102 transitions. [2022-04-15 05:56:04,748 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-15 05:56:04,749 INFO L225 Difference]: With dead ends: 102 [2022-04-15 05:56:04,749 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 05:56:04,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 05:56:04,750 INFO L913 BasicCegarLoop]: 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-15 05:56:04,751 INFO L914 BasicCegarLoop]: 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-15 05:56:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 05:56:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-04-15 05:56:05,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:05,135 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-15 05:56:05,135 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-15 05:56:05,135 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-15 05:56:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:05,136 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:56:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-15 05:56:05,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:05,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:05,136 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-15 05:56:05,137 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-15 05:56:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:05,138 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-15 05:56:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-15 05:56:05,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:05,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:05,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:05,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:05,138 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-15 05:56:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2022-04-15 05:56:05,139 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2022-04-15 05:56:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:05,140 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2022-04-15 05:56:05,140 INFO L479 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-15 05:56:05,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 95 transitions. [2022-04-15 05:56:05,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-15 05:56:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 05:56:05,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:05,254 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:05,280 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-15 05:56:05,467 WARN L460 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-15 05:56:05,467 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -371476436, now seen corresponding path program 81 times [2022-04-15 05:56:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:05,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745622015] [2022-04-15 05:56:05,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:05,470 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:05,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash -371476436, now seen corresponding path program 82 times [2022-04-15 05:56:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:05,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373815243] [2022-04-15 05:56:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:05,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,301 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-15 05:56:06,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-15 05:56:06,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-15 05:56:06,301 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-15 05:56:06,302 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-15 05:56:06,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-15 05:56:06,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-15 05:56:06,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-15 05:56:06,302 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-15 05:56:06,302 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-15 05:56:06,303 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-15 05:56:06,303 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-15 05:56:06,303 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-15 05:56:06,304 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-15 05:56:06,304 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-15 05:56:06,304 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-15 05:56:06,305 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-15 05:56:06,305 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-15 05:56:06,305 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-15 05:56:06,306 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-15 05:56:06,306 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-15 05:56:06,306 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-15 05:56:06,307 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-15 05:56:06,307 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-15 05:56:06,307 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-15 05:56:06,308 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-15 05:56:06,308 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-15 05:56:06,308 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-15 05:56:06,309 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-15 05:56:06,309 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-15 05:56:06,309 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-15 05:56:06,309 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-15 05:56:06,310 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-15 05:56:06,310 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-15 05:56:06,311 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-15 05:56:06,311 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-15 05:56:06,311 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-15 05:56:06,311 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-15 05:56:06,312 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-15 05:56:06,312 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-15 05:56:06,312 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-15 05:56:06,313 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-15 05:56:06,313 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-15 05:56:06,313 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-15 05:56:06,314 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-15 05:56:06,314 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-15 05:56:06,314 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-15 05:56:06,315 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-15 05:56:06,315 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-15 05:56:06,315 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-15 05:56:06,316 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-15 05:56:06,316 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-15 05:56:06,316 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-15 05:56:06,317 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-15 05:56:06,317 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-15 05:56:06,317 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-15 05:56:06,318 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-15 05:56:06,318 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-15 05:56:06,318 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-15 05:56:06,319 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-15 05:56:06,319 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-15 05:56:06,319 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-15 05:56:06,320 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-15 05:56:06,320 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-15 05:56:06,320 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-15 05:56:06,321 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-15 05:56:06,321 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-15 05:56:06,321 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-15 05:56:06,322 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-15 05:56:06,322 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-15 05:56:06,322 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-15 05:56:06,323 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-15 05:56:06,323 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-15 05:56:06,323 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-15 05:56:06,324 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-15 05:56:06,324 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-15 05:56:06,324 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-15 05:56:06,325 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-15 05:56:06,325 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-15 05:56:06,325 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-15 05:56:06,326 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-15 05:56:06,326 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-15 05:56:06,326 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-15 05:56:06,327 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-15 05:56:06,327 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-15 05:56:06,327 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-15 05:56:06,328 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-15 05:56:06,328 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-15 05:56:06,328 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-15 05:56:06,329 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-15 05:56:06,329 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-15 05:56:06,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {30799#(<= main_~i~0 41)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-15 05:56:06,329 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-15 05:56:06,329 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-15 05:56:06,329 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-15 05:56:06,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-15 05:56:06,330 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-15 05:56:06,330 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-15 05:56:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:06,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373815243] [2022-04-15 05:56:06,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373815243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:06,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291433265] [2022-04-15 05:56:06,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:06,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:06,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:06,332 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-15 05:56:06,333 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-15 05:56:06,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:06,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:06,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 05:56:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:07,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {30753#true} call ULTIMATE.init(); {30753#true} is VALID [2022-04-15 05:56:07,158 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-15 05:56:07,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-15 05:56:07,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-15 05:56:07,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-15 05:56:07,159 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-15 05:56:07,159 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-15 05:56:07,159 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-15 05:56:07,160 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-15 05:56:07,160 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-15 05:56:07,160 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-15 05:56:07,161 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-15 05:56:07,161 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-15 05:56:07,161 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-15 05:56:07,162 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-15 05:56:07,162 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-15 05:56:07,162 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-15 05:56:07,163 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-15 05:56:07,163 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-15 05:56:07,163 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-15 05:56:07,164 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-15 05:56:07,164 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-15 05:56:07,164 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-15 05:56:07,165 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-15 05:56:07,165 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-15 05:56:07,165 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-15 05:56:07,166 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-15 05:56:07,166 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-15 05:56:07,166 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-15 05:56:07,167 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-15 05:56:07,167 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-15 05:56:07,167 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-15 05:56:07,168 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-15 05:56:07,168 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-15 05:56:07,168 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-15 05:56:07,169 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-15 05:56:07,169 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-15 05:56:07,169 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-15 05:56:07,170 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-15 05:56:07,170 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-15 05:56:07,170 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-15 05:56:07,171 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-15 05:56:07,171 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-15 05:56:07,171 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-15 05:56:07,172 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-15 05:56:07,172 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-15 05:56:07,172 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-15 05:56:07,173 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-15 05:56:07,173 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-15 05:56:07,173 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-15 05:56:07,174 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-15 05:56:07,174 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-15 05:56:07,174 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-15 05:56:07,175 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-15 05:56:07,175 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-15 05:56:07,175 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-15 05:56:07,176 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-15 05:56:07,176 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-15 05:56:07,176 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-15 05:56:07,177 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-15 05:56:07,177 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-15 05:56:07,177 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-15 05:56:07,178 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-15 05:56:07,178 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-15 05:56:07,178 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-15 05:56:07,179 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-15 05:56:07,179 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-15 05:56:07,179 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-15 05:56:07,180 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-15 05:56:07,180 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-15 05:56:07,180 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-15 05:56:07,181 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-15 05:56:07,181 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-15 05:56:07,181 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-15 05:56:07,182 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-15 05:56:07,182 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-15 05:56:07,182 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-15 05:56:07,183 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-15 05:56:07,183 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-15 05:56:07,183 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-15 05:56:07,184 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-15 05:56:07,184 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-15 05:56:07,184 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-15 05:56:07,185 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-15 05:56:07,185 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-15 05:56:07,185 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-15 05:56:07,186 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-15 05:56:07,186 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-15 05:56:07,186 INFO L290 TraceCheckUtils]: 88: Hoare triple {30799#(<= main_~i~0 41)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-15 05:56:07,186 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-15 05:56:07,187 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-15 05:56:07,187 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-15 05:56:07,187 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-15 05:56:07,187 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-15 05:56:07,187 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-15 05:56:07,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:09,432 INFO L290 TraceCheckUtils]: 93: Hoare triple {30754#false} assume !false; {30754#false} is VALID [2022-04-15 05:56:09,432 INFO L290 TraceCheckUtils]: 92: Hoare triple {30754#false} assume 0 == ~cond; {30754#false} is VALID [2022-04-15 05:56:09,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {30754#false} ~cond := #in~cond; {30754#false} is VALID [2022-04-15 05:56:09,433 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-15 05:56:09,433 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-15 05:56:09,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {31099#(< main_~i~0 2048)} assume !(~i~0 < 2048); {30754#false} is VALID [2022-04-15 05:56:09,433 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-15 05:56:09,434 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-15 05:56:09,434 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-15 05:56:09,434 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-15 05:56:09,435 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-15 05:56:09,435 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-15 05:56:09,435 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-15 05:56:09,436 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-15 05:56:09,436 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-15 05:56:09,436 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-15 05:56:09,437 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-15 05:56:09,437 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-15 05:56:09,437 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-15 05:56:09,438 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-15 05:56:09,438 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-15 05:56:09,438 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-15 05:56:09,439 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-15 05:56:09,439 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-15 05:56:09,439 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-15 05:56:09,440 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-15 05:56:09,440 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-15 05:56:09,440 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-15 05:56:09,441 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-15 05:56:09,441 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-15 05:56:09,442 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-15 05:56:09,442 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-15 05:56:09,442 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-15 05:56:09,442 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-15 05:56:09,443 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-15 05:56:09,443 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-15 05:56:09,444 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-15 05:56:09,444 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-15 05:56:09,444 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-15 05:56:09,445 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-15 05:56:09,445 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-15 05:56:09,445 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-15 05:56:09,446 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-15 05:56:09,446 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-15 05:56:09,446 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-15 05:56:09,447 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-15 05:56:09,447 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-15 05:56:09,447 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-15 05:56:09,448 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-15 05:56:09,448 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-15 05:56:09,448 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-15 05:56:09,449 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-15 05:56:09,449 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-15 05:56:09,449 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-15 05:56:09,450 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-15 05:56:09,450 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-15 05:56:09,450 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-15 05:56:09,451 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-15 05:56:09,451 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-15 05:56:09,451 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-15 05:56:09,452 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-15 05:56:09,452 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-15 05:56:09,452 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-15 05:56:09,453 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-15 05:56:09,453 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-15 05:56:09,453 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-15 05:56:09,454 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-15 05:56:09,454 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-15 05:56:09,454 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-15 05:56:09,455 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-15 05:56:09,455 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-15 05:56:09,455 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-15 05:56:09,456 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-15 05:56:09,456 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-15 05:56:09,456 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-15 05:56:09,457 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-15 05:56:09,457 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-15 05:56:09,457 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-15 05:56:09,458 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-15 05:56:09,458 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-15 05:56:09,458 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-15 05:56:09,459 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-15 05:56:09,459 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-15 05:56:09,459 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-15 05:56:09,460 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-15 05:56:09,460 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-15 05:56:09,461 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-15 05:56:09,462 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-15 05:56:09,462 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-15 05:56:09,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {30753#true} call #t~ret5 := main(); {30753#true} is VALID [2022-04-15 05:56:09,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30753#true} {30753#true} #44#return; {30753#true} is VALID [2022-04-15 05:56:09,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {30753#true} assume true; {30753#true} is VALID [2022-04-15 05:56:09,463 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-15 05:56:09,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {30753#true} call ULTIMATE.init(); {30753#true} is VALID [2022-04-15 05:56:09,463 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-15 05:56:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291433265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:09,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:09,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-15 05:56:09,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:09,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745622015] [2022-04-15 05:56:09,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745622015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:09,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:09,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 05:56:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121739579] [2022-04-15 05:56:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:09,464 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-15 05:56:09,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:09,465 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-15 05:56:09,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:09,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 05:56:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 05:56:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 05:56:09,529 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-15 05:56:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,043 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:56:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 05:56:11,043 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-15 05:56:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:11,044 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-15 05:56:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-15 05:56:11,045 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-15 05:56:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2022-04-15 05:56:11,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 104 transitions. [2022-04-15 05:56:11,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:11,131 INFO L225 Difference]: With dead ends: 104 [2022-04-15 05:56:11,131 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 05:56:11,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=7398, Invalid=9372, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 05:56:11,132 INFO L913 BasicCegarLoop]: 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-15 05:56:11,133 INFO L914 BasicCegarLoop]: 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-15 05:56:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 05:56:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 05:56:11,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:11,538 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-15 05:56:11,538 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-15 05:56:11,539 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-15 05:56:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,541 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:56:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-15 05:56:11,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:11,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:11,541 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-15 05:56:11,541 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-15 05:56:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,543 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-15 05:56:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-15 05:56:11,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:11,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:11,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:11,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:11,543 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-15 05:56:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2022-04-15 05:56:11,544 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2022-04-15 05:56:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:11,545 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2022-04-15 05:56:11,545 INFO L479 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-15 05:56:11,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 97 transitions. [2022-04-15 05:56:11,702 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-15 05:56:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-15 05:56:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 05:56:11,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:11,704 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:11,730 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-15 05:56:11,929 WARN L460 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-15 05:56:11,929 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1380656818, now seen corresponding path program 83 times [2022-04-15 05:56:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532133489] [2022-04-15 05:56:11,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:11,933 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:11,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1380656818, now seen corresponding path program 84 times [2022-04-15 05:56:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:11,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087294322] [2022-04-15 05:56:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,836 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-15 05:56:12,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-15 05:56:12,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-15 05:56:12,837 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-15 05:56:12,837 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-15 05:56:12,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-15 05:56:12,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-15 05:56:12,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-15 05:56:12,837 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-15 05:56:12,838 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-15 05:56:12,838 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-15 05:56:12,838 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-15 05:56:12,839 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-15 05:56:12,839 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-15 05:56:12,840 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-15 05:56:12,840 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-15 05:56:12,840 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-15 05:56:12,841 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-15 05:56:12,841 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-15 05:56:12,842 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-15 05:56:12,842 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-15 05:56:12,842 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-15 05:56:12,843 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-15 05:56:12,843 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-15 05:56:12,844 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-15 05:56:12,844 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-15 05:56:12,844 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-15 05:56:12,845 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-15 05:56:12,845 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-15 05:56:12,846 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-15 05:56:12,846 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-15 05:56:12,846 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-15 05:56:12,847 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-15 05:56:12,847 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-15 05:56:12,848 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-15 05:56:12,848 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-15 05:56:12,848 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-15 05:56:12,849 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-15 05:56:12,849 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-15 05:56:12,849 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-15 05:56:12,850 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-15 05:56:12,850 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-15 05:56:12,851 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-15 05:56:12,851 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-15 05:56:12,851 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-15 05:56:12,852 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-15 05:56:12,852 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-15 05:56:12,853 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-15 05:56:12,853 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-15 05:56:12,853 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-15 05:56:12,854 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-15 05:56:12,854 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-15 05:56:12,855 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-15 05:56:12,855 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-15 05:56:12,855 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-15 05:56:12,856 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-15 05:56:12,856 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-15 05:56:12,856 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-15 05:56:12,857 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-15 05:56:12,857 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-15 05:56:12,858 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-15 05:56:12,858 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-15 05:56:12,858 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-15 05:56:12,859 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-15 05:56:12,859 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-15 05:56:12,860 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-15 05:56:12,860 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-15 05:56:12,860 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-15 05:56:12,861 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-15 05:56:12,861 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-15 05:56:12,862 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-15 05:56:12,862 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-15 05:56:12,862 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-15 05:56:12,863 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-15 05:56:12,863 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-15 05:56:12,864 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-15 05:56:12,864 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-15 05:56:12,864 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-15 05:56:12,865 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-15 05:56:12,865 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-15 05:56:12,866 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-15 05:56:12,866 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-15 05:56:12,866 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-15 05:56:12,867 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-15 05:56:12,867 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-15 05:56:12,868 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-15 05:56:12,868 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-15 05:56:12,868 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-15 05:56:12,869 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-15 05:56:12,869 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-15 05:56:12,870 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-15 05:56:12,870 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-15 05:56:12,870 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-15 05:56:12,871 INFO L290 TraceCheckUtils]: 90: Hoare triple {32136#(<= main_~i~0 42)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-15 05:56:12,871 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-15 05:56:12,871 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-15 05:56:12,871 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-15 05:56:12,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-15 05:56:12,871 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-15 05:56:12,872 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-15 05:56:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087294322] [2022-04-15 05:56:12,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087294322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253982521] [2022-04-15 05:56:12,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:12,874 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-15 05:56:12,876 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-15 05:56:32,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-15 05:56:32,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:32,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 05:56:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:32,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:33,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {32089#true} call ULTIMATE.init(); {32089#true} is VALID [2022-04-15 05:56:33,487 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-15 05:56:33,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-15 05:56:33,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-15 05:56:33,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-15 05:56:33,488 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-15 05:56:33,488 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-15 05:56:33,489 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-15 05:56:33,489 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-15 05:56:33,489 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-15 05:56:33,490 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-15 05:56:33,490 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-15 05:56:33,490 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-15 05:56:33,491 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-15 05:56:33,491 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-15 05:56:33,491 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-15 05:56:33,492 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-15 05:56:33,492 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-15 05:56:33,492 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-15 05:56:33,493 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-15 05:56:33,493 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-15 05:56:33,493 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-15 05:56:33,494 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-15 05:56:33,494 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-15 05:56:33,494 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-15 05:56:33,495 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-15 05:56:33,495 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-15 05:56:33,495 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-15 05:56:33,496 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-15 05:56:33,496 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-15 05:56:33,496 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-15 05:56:33,497 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-15 05:56:33,497 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-15 05:56:33,497 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-15 05:56:33,498 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-15 05:56:33,498 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-15 05:56:33,498 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-15 05:56:33,499 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-15 05:56:33,499 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-15 05:56:33,499 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-15 05:56:33,500 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-15 05:56:33,500 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-15 05:56:33,500 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-15 05:56:33,501 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-15 05:56:33,501 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-15 05:56:33,501 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-15 05:56:33,502 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-15 05:56:33,502 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-15 05:56:33,502 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-15 05:56:33,503 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-15 05:56:33,503 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-15 05:56:33,503 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-15 05:56:33,503 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-15 05:56:33,504 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-15 05:56:33,504 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-15 05:56:33,504 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-15 05:56:33,505 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-15 05:56:33,505 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-15 05:56:33,505 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-15 05:56:33,506 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-15 05:56:33,506 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-15 05:56:33,506 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-15 05:56:33,507 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-15 05:56:33,507 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-15 05:56:33,507 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-15 05:56:33,508 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-15 05:56:33,508 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-15 05:56:33,508 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-15 05:56:33,509 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-15 05:56:33,509 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-15 05:56:33,509 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-15 05:56:33,510 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-15 05:56:33,510 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-15 05:56:33,510 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-15 05:56:33,511 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-15 05:56:33,511 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-15 05:56:33,511 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-15 05:56:33,512 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-15 05:56:33,512 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-15 05:56:33,512 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-15 05:56:33,513 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-15 05:56:33,513 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-15 05:56:33,513 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-15 05:56:33,514 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-15 05:56:33,514 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-15 05:56:33,514 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-15 05:56:33,515 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-15 05:56:33,515 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-15 05:56:33,515 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-15 05:56:33,516 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-15 05:56:33,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {32136#(<= main_~i~0 42)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-15 05:56:33,516 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-15 05:56:33,516 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-15 05:56:33,516 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-15 05:56:33,516 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-15 05:56:33,516 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-15 05:56:33,517 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-15 05:56:33,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:35,907 INFO L290 TraceCheckUtils]: 95: Hoare triple {32090#false} assume !false; {32090#false} is VALID [2022-04-15 05:56:35,907 INFO L290 TraceCheckUtils]: 94: Hoare triple {32090#false} assume 0 == ~cond; {32090#false} is VALID [2022-04-15 05:56:35,907 INFO L290 TraceCheckUtils]: 93: Hoare triple {32090#false} ~cond := #in~cond; {32090#false} is VALID [2022-04-15 05:56:35,907 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-15 05:56:35,908 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-15 05:56:35,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {32442#(< main_~i~0 2048)} assume !(~i~0 < 2048); {32090#false} is VALID [2022-04-15 05:56:35,908 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-15 05:56:35,909 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-15 05:56:35,909 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-15 05:56:35,909 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-15 05:56:35,910 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-15 05:56:35,910 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-15 05:56:35,910 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-15 05:56:35,911 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-15 05:56:35,911 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-15 05:56:35,911 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-15 05:56:35,912 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-15 05:56:35,912 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-15 05:56:35,912 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-15 05:56:35,913 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-15 05:56:35,913 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-15 05:56:35,913 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-15 05:56:35,914 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-15 05:56:35,914 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-15 05:56:35,914 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-15 05:56:35,915 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-15 05:56:35,915 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-15 05:56:35,915 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-15 05:56:35,916 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-15 05:56:35,916 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-15 05:56:35,916 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-15 05:56:35,917 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-15 05:56:35,917 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-15 05:56:35,917 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-15 05:56:35,918 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-15 05:56:35,918 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-15 05:56:35,918 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-15 05:56:35,919 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-15 05:56:35,919 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-15 05:56:35,919 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-15 05:56:35,920 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-15 05:56:35,920 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-15 05:56:35,920 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-15 05:56:35,921 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-15 05:56:35,921 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-15 05:56:35,921 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-15 05:56:35,922 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-15 05:56:35,922 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-15 05:56:35,923 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-15 05:56:35,923 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-15 05:56:35,923 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-15 05:56:35,923 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-15 05:56:35,924 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-15 05:56:35,924 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-15 05:56:35,925 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-15 05:56:35,925 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-15 05:56:35,925 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-15 05:56:35,926 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-15 05:56:35,926 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-15 05:56:35,926 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-15 05:56:35,927 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-15 05:56:35,927 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-15 05:56:35,927 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-15 05:56:35,928 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-15 05:56:35,928 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-15 05:56:35,928 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-15 05:56:35,929 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-15 05:56:35,929 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-15 05:56:35,929 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-15 05:56:35,930 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-15 05:56:35,930 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-15 05:56:35,930 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-15 05:56:35,931 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-15 05:56:35,931 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-15 05:56:35,931 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-15 05:56:35,932 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-15 05:56:35,932 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-15 05:56:35,932 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-15 05:56:35,933 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-15 05:56:35,933 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-15 05:56:35,933 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-15 05:56:35,934 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-15 05:56:35,934 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-15 05:56:35,934 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-15 05:56:35,935 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-15 05:56:35,935 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-15 05:56:35,935 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-15 05:56:35,936 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-15 05:56:35,936 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-15 05:56:35,936 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-15 05:56:35,937 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-15 05:56:35,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {32089#true} call #t~ret5 := main(); {32089#true} is VALID [2022-04-15 05:56:35,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32089#true} {32089#true} #44#return; {32089#true} is VALID [2022-04-15 05:56:35,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {32089#true} assume true; {32089#true} is VALID [2022-04-15 05:56:35,937 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-15 05:56:35,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {32089#true} call ULTIMATE.init(); {32089#true} is VALID [2022-04-15 05:56:35,938 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-15 05:56:35,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253982521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:35,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:35,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 05:56:35,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:35,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532133489] [2022-04-15 05:56:35,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532133489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:35,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:35,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 05:56:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648435079] [2022-04-15 05:56:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:35,939 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-15 05:56:35,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:35,939 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-15 05:56:36,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:36,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 05:56:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 05:56:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 05:56:36,004 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-15 05:56:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:37,535 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:56:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 05:56:37,535 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-15 05:56:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:37,536 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-15 05:56:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-15 05:56:37,536 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-15 05:56:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2022-04-15 05:56:37,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 106 transitions. [2022-04-15 05:56:37,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:37,617 INFO L225 Difference]: With dead ends: 106 [2022-04-15 05:56:37,617 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 05:56:37,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 05:56:37,619 INFO L913 BasicCegarLoop]: 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-15 05:56:37,619 INFO L914 BasicCegarLoop]: 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-15 05:56:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 05:56:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-15 05:56:38,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:38,055 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-15 05:56:38,055 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-15 05:56:38,055 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-15 05:56:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:38,056 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:56:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-15 05:56:38,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:38,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:38,057 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-15 05:56:38,057 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-15 05:56:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:38,058 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-15 05:56:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-15 05:56:38,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:38,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:38,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:38,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:38,059 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-15 05:56:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-04-15 05:56:38,060 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2022-04-15 05:56:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:38,060 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-04-15 05:56:38,060 INFO L479 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-15 05:56:38,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 99 transitions. [2022-04-15 05:56:38,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-15 05:56:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 05:56:38,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:38,174 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:38,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-15 05:56:38,379 WARN L460 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-15 05:56:38,379 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -540395024, now seen corresponding path program 85 times [2022-04-15 05:56:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293140711] [2022-04-15 05:56:38,383 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:38,383 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:38,383 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash -540395024, now seen corresponding path program 86 times [2022-04-15 05:56:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:38,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976884375] [2022-04-15 05:56:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:39,220 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-15 05:56:39,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-15 05:56:39,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-15 05:56:39,221 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-15 05:56:39,221 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-15 05:56:39,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-15 05:56:39,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-15 05:56:39,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-15 05:56:39,221 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-15 05:56:39,221 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-15 05:56:39,222 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-15 05:56:39,222 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-15 05:56:39,223 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-15 05:56:39,223 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-15 05:56:39,223 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-15 05:56:39,223 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-15 05:56:39,224 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-15 05:56:39,224 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-15 05:56:39,225 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-15 05:56:39,225 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-15 05:56:39,225 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-15 05:56:39,225 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-15 05:56:39,226 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-15 05:56:39,226 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-15 05:56:39,227 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-15 05:56:39,227 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-15 05:56:39,227 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-15 05:56:39,227 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-15 05:56:39,228 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-15 05:56:39,228 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-15 05:56:39,228 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-15 05:56:39,229 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-15 05:56:39,229 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-15 05:56:39,229 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-15 05:56:39,230 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-15 05:56:39,230 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-15 05:56:39,230 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-15 05:56:39,231 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-15 05:56:39,231 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-15 05:56:39,231 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-15 05:56:39,232 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-15 05:56:39,232 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-15 05:56:39,233 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-15 05:56:39,233 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-15 05:56:39,233 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-15 05:56:39,233 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-15 05:56:39,234 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-15 05:56:39,234 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-15 05:56:39,234 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-15 05:56:39,235 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-15 05:56:39,235 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-15 05:56:39,235 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-15 05:56:39,236 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-15 05:56:39,236 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-15 05:56:39,236 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-15 05:56:39,237 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-15 05:56:39,237 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-15 05:56:39,237 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-15 05:56:39,238 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-15 05:56:39,238 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-15 05:56:39,238 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-15 05:56:39,239 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-15 05:56:39,239 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-15 05:56:39,239 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-15 05:56:39,240 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-15 05:56:39,240 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-15 05:56:39,240 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-15 05:56:39,241 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-15 05:56:39,241 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-15 05:56:39,241 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-15 05:56:39,242 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-15 05:56:39,242 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-15 05:56:39,242 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-15 05:56:39,243 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-15 05:56:39,243 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-15 05:56:39,243 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-15 05:56:39,244 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-15 05:56:39,244 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-15 05:56:39,244 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-15 05:56:39,245 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-15 05:56:39,245 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-15 05:56:39,245 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-15 05:56:39,247 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-15 05:56:39,248 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-15 05:56:39,248 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-15 05:56:39,249 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-15 05:56:39,249 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-15 05:56:39,250 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-15 05:56:39,250 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-15 05:56:39,251 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-15 05:56:39,251 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-15 05:56:39,251 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-15 05:56:39,252 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-15 05:56:39,252 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-15 05:56:39,253 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-15 05:56:39,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {33501#(<= main_~i~0 43)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-15 05:56:39,254 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-15 05:56:39,254 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-15 05:56:39,254 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-15 05:56:39,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-15 05:56:39,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-15 05:56:39,254 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-15 05:56:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976884375] [2022-04-15 05:56:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976884375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267920186] [2022-04-15 05:56:39,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:39,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:39,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:39,256 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-15 05:56:39,257 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-15 05:56:39,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:39,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:39,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 05:56:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:39,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:40,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {33453#true} call ULTIMATE.init(); {33453#true} is VALID [2022-04-15 05:56:40,122 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-15 05:56:40,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-15 05:56:40,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-15 05:56:40,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-15 05:56:40,123 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-15 05:56:40,124 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-15 05:56:40,124 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-15 05:56:40,125 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-15 05:56:40,125 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-15 05:56:40,126 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-15 05:56:40,126 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-15 05:56:40,127 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-15 05:56:40,127 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-15 05:56:40,127 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-15 05:56:40,128 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-15 05:56:40,128 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-15 05:56:40,129 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-15 05:56:40,129 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-15 05:56:40,130 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-15 05:56:40,130 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-15 05:56:40,130 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-15 05:56:40,131 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-15 05:56:40,131 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-15 05:56:40,132 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-15 05:56:40,132 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-15 05:56:40,133 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-15 05:56:40,133 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-15 05:56:40,133 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-15 05:56:40,134 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-15 05:56:40,134 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-15 05:56:40,135 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-15 05:56:40,135 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-15 05:56:40,136 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-15 05:56:40,136 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-15 05:56:40,136 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-15 05:56:40,137 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-15 05:56:40,137 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-15 05:56:40,138 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-15 05:56:40,138 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-15 05:56:40,139 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-15 05:56:40,139 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-15 05:56:40,139 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-15 05:56:40,140 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-15 05:56:40,140 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-15 05:56:40,141 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-15 05:56:40,141 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-15 05:56:40,142 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-15 05:56:40,142 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-15 05:56:40,143 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-15 05:56:40,143 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-15 05:56:40,143 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-15 05:56:40,144 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-15 05:56:40,144 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-15 05:56:40,145 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-15 05:56:40,145 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-15 05:56:40,146 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-15 05:56:40,146 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-15 05:56:40,146 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-15 05:56:40,147 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-15 05:56:40,147 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-15 05:56:40,148 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-15 05:56:40,148 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-15 05:56:40,148 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-15 05:56:40,149 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-15 05:56:40,149 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-15 05:56:40,150 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-15 05:56:40,150 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-15 05:56:40,151 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-15 05:56:40,151 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-15 05:56:40,151 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-15 05:56:40,152 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-15 05:56:40,152 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-15 05:56:40,153 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-15 05:56:40,153 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-15 05:56:40,154 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-15 05:56:40,154 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-15 05:56:40,154 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-15 05:56:40,155 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-15 05:56:40,155 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-15 05:56:40,156 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-15 05:56:40,156 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-15 05:56:40,156 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-15 05:56:40,157 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-15 05:56:40,157 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-15 05:56:40,158 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-15 05:56:40,158 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-15 05:56:40,159 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-15 05:56:40,159 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-15 05:56:40,160 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-15 05:56:40,160 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-15 05:56:40,160 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-15 05:56:40,161 INFO L290 TraceCheckUtils]: 92: Hoare triple {33501#(<= main_~i~0 43)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-15 05:56:40,161 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-15 05:56:40,161 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-15 05:56:40,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-15 05:56:40,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-15 05:56:40,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-15 05:56:40,162 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-15 05:56:40,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:42,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {33454#false} assume !false; {33454#false} is VALID [2022-04-15 05:56:42,561 INFO L290 TraceCheckUtils]: 96: Hoare triple {33454#false} assume 0 == ~cond; {33454#false} is VALID [2022-04-15 05:56:42,561 INFO L290 TraceCheckUtils]: 95: Hoare triple {33454#false} ~cond := #in~cond; {33454#false} is VALID [2022-04-15 05:56:42,561 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-15 05:56:42,561 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-15 05:56:42,562 INFO L290 TraceCheckUtils]: 92: Hoare triple {33813#(< main_~i~0 2048)} assume !(~i~0 < 2048); {33454#false} is VALID [2022-04-15 05:56:42,562 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-15 05:56:42,562 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-15 05:56:42,563 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-15 05:56:42,563 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-15 05:56:42,563 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-15 05:56:42,564 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-15 05:56:42,564 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-15 05:56:42,564 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-15 05:56:42,565 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-15 05:56:42,565 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-15 05:56:42,565 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-15 05:56:42,566 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-15 05:56:42,566 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-15 05:56:42,566 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-15 05:56:42,567 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-15 05:56:42,567 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-15 05:56:42,567 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-15 05:56:42,568 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-15 05:56:42,568 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-15 05:56:42,568 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-15 05:56:42,569 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-15 05:56:42,569 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-15 05:56:42,569 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-15 05:56:42,570 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-15 05:56:42,570 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-15 05:56:42,570 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-15 05:56:42,571 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-15 05:56:42,571 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-15 05:56:42,571 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-15 05:56:42,572 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-15 05:56:42,572 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-15 05:56:42,572 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-15 05:56:42,573 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-15 05:56:42,573 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-15 05:56:42,573 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-15 05:56:42,574 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-15 05:56:42,574 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-15 05:56:42,574 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-15 05:56:42,575 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-15 05:56:42,575 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-15 05:56:42,575 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-15 05:56:42,576 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-15 05:56:42,576 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-15 05:56:42,576 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-15 05:56:42,577 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-15 05:56:42,577 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-15 05:56:42,577 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-15 05:56:42,578 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-15 05:56:42,578 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-15 05:56:42,578 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-15 05:56:42,579 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-15 05:56:42,579 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-15 05:56:42,579 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-15 05:56:42,580 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-15 05:56:42,580 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-15 05:56:42,580 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-15 05:56:42,581 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-15 05:56:42,581 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-15 05:56:42,581 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-15 05:56:42,582 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-15 05:56:42,582 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-15 05:56:42,582 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-15 05:56:42,583 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-15 05:56:42,583 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-15 05:56:42,583 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-15 05:56:42,584 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-15 05:56:42,584 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-15 05:56:42,584 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-15 05:56:42,585 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-15 05:56:42,585 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-15 05:56:42,585 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-15 05:56:42,586 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-15 05:56:42,586 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-15 05:56:42,586 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-15 05:56:42,587 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-15 05:56:42,587 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-15 05:56:42,587 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-15 05:56:42,588 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-15 05:56:42,588 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-15 05:56:42,588 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-15 05:56:42,589 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-15 05:56:42,589 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-15 05:56:42,589 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-15 05:56:42,590 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-15 05:56:42,590 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-15 05:56:42,590 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-15 05:56:42,591 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-15 05:56:42,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {33453#true} call #t~ret5 := main(); {33453#true} is VALID [2022-04-15 05:56:42,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33453#true} {33453#true} #44#return; {33453#true} is VALID [2022-04-15 05:56:42,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {33453#true} assume true; {33453#true} is VALID [2022-04-15 05:56:42,591 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-15 05:56:42,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {33453#true} call ULTIMATE.init(); {33453#true} is VALID [2022-04-15 05:56:42,592 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-15 05:56:42,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267920186] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:42,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:42,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 05:56:42,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:42,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293140711] [2022-04-15 05:56:42,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293140711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:42,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:42,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 05:56:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555425499] [2022-04-15 05:56:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:42,593 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-15 05:56:42,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:42,594 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-15 05:56:42,678 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-15 05:56:42,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 05:56:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 05:56:42,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 05:56:42,680 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-15 05:56:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:44,324 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:56:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 05:56:44,325 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-15 05:56:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:44,325 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-15 05:56:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-15 05:56:44,326 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-15 05:56:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 108 transitions. [2022-04-15 05:56:44,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 108 transitions. [2022-04-15 05:56:44,406 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-15 05:56:44,407 INFO L225 Difference]: With dead ends: 108 [2022-04-15 05:56:44,407 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 05:56:44,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 05:56:44,408 INFO L913 BasicCegarLoop]: 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-15 05:56:44,409 INFO L914 BasicCegarLoop]: 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-15 05:56:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 05:56:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-04-15 05:56:44,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:44,843 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-15 05:56:44,843 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-15 05:56:44,843 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-15 05:56:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:44,844 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:56:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-15 05:56:44,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:44,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:44,844 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-15 05:56:44,844 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-15 05:56:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:44,845 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-15 05:56:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-15 05:56:44,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:44,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:44,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:44,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:44,845 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-15 05:56:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-04-15 05:56:44,846 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2022-04-15 05:56:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:44,847 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-04-15 05:56:44,847 INFO L479 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-15 05:56:44,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 101 transitions. [2022-04-15 05:56:44,972 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-15 05:56:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-15 05:56:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 05:56:44,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:44,973 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:44,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:45,173 WARN L460 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-15 05:56:45,173 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash -502662638, now seen corresponding path program 87 times [2022-04-15 05:56:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1271628070] [2022-04-15 05:56:45,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:45,177 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:45,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash -502662638, now seen corresponding path program 88 times [2022-04-15 05:56:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:45,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773287457] [2022-04-15 05:56:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:46,033 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-15 05:56:46,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-15 05:56:46,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-15 05:56:46,034 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-15 05:56:46,034 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-15 05:56:46,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-15 05:56:46,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-15 05:56:46,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-15 05:56:46,034 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-15 05:56:46,034 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-15 05:56:46,035 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-15 05:56:46,035 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-15 05:56:46,035 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-15 05:56:46,036 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-15 05:56:46,036 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-15 05:56:46,036 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-15 05:56:46,037 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-15 05:56:46,037 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-15 05:56:46,037 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-15 05:56:46,038 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-15 05:56:46,038 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-15 05:56:46,038 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-15 05:56:46,039 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-15 05:56:46,039 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-15 05:56:46,039 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-15 05:56:46,040 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-15 05:56:46,040 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-15 05:56:46,040 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-15 05:56:46,041 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-15 05:56:46,041 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-15 05:56:46,041 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-15 05:56:46,042 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-15 05:56:46,042 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-15 05:56:46,042 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-15 05:56:46,043 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-15 05:56:46,043 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-15 05:56:46,043 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-15 05:56:46,043 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-15 05:56:46,044 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-15 05:56:46,044 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-15 05:56:46,044 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-15 05:56:46,045 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-15 05:56:46,045 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-15 05:56:46,045 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-15 05:56:46,046 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-15 05:56:46,046 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-15 05:56:46,046 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-15 05:56:46,047 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-15 05:56:46,047 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-15 05:56:46,047 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-15 05:56:46,048 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-15 05:56:46,048 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-15 05:56:46,048 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-15 05:56:46,049 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-15 05:56:46,049 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-15 05:56:46,049 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-15 05:56:46,050 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-15 05:56:46,050 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-15 05:56:46,050 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-15 05:56:46,051 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-15 05:56:46,051 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-15 05:56:46,051 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-15 05:56:46,052 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-15 05:56:46,052 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-15 05:56:46,052 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-15 05:56:46,053 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-15 05:56:46,053 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-15 05:56:46,053 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-15 05:56:46,054 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-15 05:56:46,054 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-15 05:56:46,054 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-15 05:56:46,054 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-15 05:56:46,055 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-15 05:56:46,055 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-15 05:56:46,055 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-15 05:56:46,056 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-15 05:56:46,056 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-15 05:56:46,056 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-15 05:56:46,057 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-15 05:56:46,057 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-15 05:56:46,057 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-15 05:56:46,058 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-15 05:56:46,058 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-15 05:56:46,058 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-15 05:56:46,059 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-15 05:56:46,059 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-15 05:56:46,059 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-15 05:56:46,060 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-15 05:56:46,060 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-15 05:56:46,060 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-15 05:56:46,061 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-15 05:56:46,061 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-15 05:56:46,061 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-15 05:56:46,062 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-15 05:56:46,062 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-15 05:56:46,062 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-15 05:56:46,063 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-15 05:56:46,063 INFO L290 TraceCheckUtils]: 94: Hoare triple {34894#(<= main_~i~0 44)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-15 05:56:46,063 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-15 05:56:46,063 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-15 05:56:46,063 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-15 05:56:46,063 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-15 05:56:46,063 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-15 05:56:46,064 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-15 05:56:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773287457] [2022-04-15 05:56:46,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773287457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079599279] [2022-04-15 05:56:46,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:46,065 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-15 05:56:46,066 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-15 05:56:46,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:46,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:46,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-15 05:56:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:46,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:46,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {34845#true} call ULTIMATE.init(); {34845#true} is VALID [2022-04-15 05:56:46,952 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-15 05:56:46,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-15 05:56:46,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-15 05:56:46,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-15 05:56:46,953 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-15 05:56:46,953 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-15 05:56:46,953 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-15 05:56:46,954 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-15 05:56:46,954 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-15 05:56:46,954 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-15 05:56:46,955 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-15 05:56:46,955 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-15 05:56:46,955 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-15 05:56:46,956 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-15 05:56:46,956 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-15 05:56:46,956 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-15 05:56:46,957 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-15 05:56:46,957 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-15 05:56:46,957 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-15 05:56:46,958 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-15 05:56:46,958 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-15 05:56:46,958 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-15 05:56:46,959 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-15 05:56:46,959 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-15 05:56:46,959 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-15 05:56:46,960 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-15 05:56:46,960 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-15 05:56:46,960 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-15 05:56:46,961 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-15 05:56:46,961 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-15 05:56:46,961 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-15 05:56:46,962 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-15 05:56:46,962 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-15 05:56:46,962 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-15 05:56:46,963 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-15 05:56:46,963 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-15 05:56:46,963 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-15 05:56:46,964 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-15 05:56:46,964 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-15 05:56:46,964 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-15 05:56:46,965 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-15 05:56:46,965 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-15 05:56:46,965 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-15 05:56:46,965 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-15 05:56:46,966 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-15 05:56:46,966 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-15 05:56:46,966 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-15 05:56:46,967 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-15 05:56:46,967 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-15 05:56:46,967 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-15 05:56:46,968 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-15 05:56:46,968 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-15 05:56:46,968 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-15 05:56:46,969 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-15 05:56:46,969 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-15 05:56:46,969 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-15 05:56:46,970 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-15 05:56:46,970 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-15 05:56:46,970 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-15 05:56:46,971 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-15 05:56:46,971 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-15 05:56:46,971 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-15 05:56:46,972 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-15 05:56:46,972 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-15 05:56:46,972 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-15 05:56:46,973 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-15 05:56:46,973 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-15 05:56:46,973 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-15 05:56:46,974 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-15 05:56:46,974 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-15 05:56:46,974 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-15 05:56:46,975 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-15 05:56:46,975 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-15 05:56:46,975 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-15 05:56:46,976 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-15 05:56:46,976 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-15 05:56:46,976 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-15 05:56:46,977 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-15 05:56:46,977 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-15 05:56:46,977 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-15 05:56:46,978 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-15 05:56:46,978 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-15 05:56:46,978 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-15 05:56:46,979 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-15 05:56:46,979 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-15 05:56:46,979 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-15 05:56:46,980 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-15 05:56:46,980 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-15 05:56:46,980 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-15 05:56:46,981 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-15 05:56:46,981 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-15 05:56:46,981 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-15 05:56:46,982 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-15 05:56:46,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {34894#(<= main_~i~0 44)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-15 05:56:46,982 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-15 05:56:46,982 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-15 05:56:46,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-15 05:56:46,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-15 05:56:46,982 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-15 05:56:46,983 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-15 05:56:46,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:49,492 INFO L290 TraceCheckUtils]: 99: Hoare triple {34846#false} assume !false; {34846#false} is VALID [2022-04-15 05:56:49,492 INFO L290 TraceCheckUtils]: 98: Hoare triple {34846#false} assume 0 == ~cond; {34846#false} is VALID [2022-04-15 05:56:49,492 INFO L290 TraceCheckUtils]: 97: Hoare triple {34846#false} ~cond := #in~cond; {34846#false} is VALID [2022-04-15 05:56:49,493 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-15 05:56:49,493 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-15 05:56:49,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {35212#(< main_~i~0 2048)} assume !(~i~0 < 2048); {34846#false} is VALID [2022-04-15 05:56:49,493 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-15 05:56:49,494 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-15 05:56:49,494 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-15 05:56:49,494 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-15 05:56:49,495 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-15 05:56:49,495 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-15 05:56:49,495 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-15 05:56:49,496 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-15 05:56:49,496 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-15 05:56:49,496 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-15 05:56:49,497 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-15 05:56:49,497 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-15 05:56:49,497 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-15 05:56:49,498 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-15 05:56:49,498 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-15 05:56:49,498 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-15 05:56:49,499 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-15 05:56:49,499 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-15 05:56:49,499 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-15 05:56:49,499 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-15 05:56:49,500 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-15 05:56:49,500 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-15 05:56:49,501 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-15 05:56:49,501 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-15 05:56:49,501 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-15 05:56:49,501 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-15 05:56:49,502 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-15 05:56:49,502 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-15 05:56:49,502 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-15 05:56:49,503 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-15 05:56:49,503 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-15 05:56:49,503 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-15 05:56:49,504 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-15 05:56:49,504 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-15 05:56:49,504 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-15 05:56:49,505 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-15 05:56:49,505 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-15 05:56:49,505 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-15 05:56:49,506 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-15 05:56:49,506 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-15 05:56:49,506 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-15 05:56:49,507 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-15 05:56:49,507 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-15 05:56:49,507 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-15 05:56:49,508 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-15 05:56:49,508 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-15 05:56:49,508 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-15 05:56:49,509 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-15 05:56:49,509 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-15 05:56:49,509 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-15 05:56:49,510 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-15 05:56:49,510 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-15 05:56:49,510 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-15 05:56:49,511 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-15 05:56:49,511 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-15 05:56:49,511 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-15 05:56:49,512 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-15 05:56:49,512 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-15 05:56:49,512 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-15 05:56:49,513 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-15 05:56:49,513 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-15 05:56:49,513 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-15 05:56:49,514 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-15 05:56:49,514 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-15 05:56:49,514 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-15 05:56:49,515 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-15 05:56:49,515 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-15 05:56:49,515 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-15 05:56:49,516 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-15 05:56:49,516 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-15 05:56:49,516 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-15 05:56:49,517 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-15 05:56:49,517 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-15 05:56:49,517 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-15 05:56:49,518 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-15 05:56:49,518 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-15 05:56:49,518 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-15 05:56:49,519 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-15 05:56:49,519 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-15 05:56:49,519 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-15 05:56:49,520 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-15 05:56:49,520 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-15 05:56:49,520 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-15 05:56:49,521 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-15 05:56:49,521 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-15 05:56:49,521 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-15 05:56:49,522 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-15 05:56:49,522 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-15 05:56:49,522 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-15 05:56:49,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {34845#true} call #t~ret5 := main(); {34845#true} is VALID [2022-04-15 05:56:49,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34845#true} {34845#true} #44#return; {34845#true} is VALID [2022-04-15 05:56:49,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {34845#true} assume true; {34845#true} is VALID [2022-04-15 05:56:49,523 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-15 05:56:49,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {34845#true} call ULTIMATE.init(); {34845#true} is VALID [2022-04-15 05:56:49,523 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-15 05:56:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079599279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:49,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-15 05:56:49,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:49,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1271628070] [2022-04-15 05:56:49,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1271628070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:49,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:49,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 05:56:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167392892] [2022-04-15 05:56:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:49,524 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-15 05:56:49,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:49,525 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-15 05:56:49,598 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-15 05:56:49,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 05:56:49,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:49,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 05:56:49,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 05:56:49,600 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-15 05:56:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:51,209 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:56:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 05:56:51,209 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-15 05:56:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:51,209 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-15 05:56:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-15 05:56:51,210 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-15 05:56:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 110 transitions. [2022-04-15 05:56:51,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 110 transitions. [2022-04-15 05:56:51,294 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-15 05:56:51,295 INFO L225 Difference]: With dead ends: 110 [2022-04-15 05:56:51,295 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 05:56:51,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8466, Invalid=10716, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 05:56:51,296 INFO L913 BasicCegarLoop]: 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-15 05:56:51,296 INFO L914 BasicCegarLoop]: 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-15 05:56:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 05:56:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-15 05:56:51,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:51,756 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-15 05:56:51,756 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-15 05:56:51,756 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-15 05:56:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:51,757 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:56:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-15 05:56:51,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:51,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:51,758 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-15 05:56:51,758 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-15 05:56:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:51,759 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-15 05:56:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-15 05:56:51,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:51,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:51,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:51,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:51,760 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-15 05:56:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-04-15 05:56:51,761 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2022-04-15 05:56:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:51,761 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-04-15 05:56:51,761 INFO L479 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-15 05:56:51,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 103 transitions. [2022-04-15 05:56:51,892 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-15 05:56:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-15 05:56:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 05:56:51,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:51,893 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:51,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:52,093 WARN L460 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-15 05:56:52,093 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1398421940, now seen corresponding path program 89 times [2022-04-15 05:56:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:52,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157880894] [2022-04-15 05:56:52,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:52,099 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:52,099 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1398421940, now seen corresponding path program 90 times [2022-04-15 05:56:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:52,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679420360] [2022-04-15 05:56:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:52,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:52,928 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-15 05:56:52,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-15 05:56:52,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-15 05:56:52,928 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-15 05:56:52,929 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-15 05:56:52,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-15 05:56:52,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-15 05:56:52,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-15 05:56:52,929 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-15 05:56:52,929 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-15 05:56:52,930 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-15 05:56:52,930 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-15 05:56:52,930 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-15 05:56:52,931 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-15 05:56:52,931 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-15 05:56:52,931 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-15 05:56:52,932 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-15 05:56:52,932 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-15 05:56:52,932 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-15 05:56:52,933 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-15 05:56:52,933 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-15 05:56:52,933 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-15 05:56:52,934 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-15 05:56:52,934 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-15 05:56:52,934 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-15 05:56:52,934 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-15 05:56:52,935 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-15 05:56:52,935 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-15 05:56:52,935 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-15 05:56:52,936 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-15 05:56:52,936 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-15 05:56:52,936 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-15 05:56:52,937 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-15 05:56:52,937 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-15 05:56:52,937 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-15 05:56:52,938 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-15 05:56:52,938 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-15 05:56:52,938 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-15 05:56:52,939 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-15 05:56:52,939 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-15 05:56:52,939 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-15 05:56:52,940 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-15 05:56:52,940 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-15 05:56:52,940 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-15 05:56:52,941 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-15 05:56:52,941 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-15 05:56:52,941 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-15 05:56:52,942 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-15 05:56:52,942 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-15 05:56:52,942 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-15 05:56:52,943 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-15 05:56:52,943 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-15 05:56:52,943 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-15 05:56:52,944 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-15 05:56:52,944 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-15 05:56:52,944 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-15 05:56:52,945 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-15 05:56:52,945 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-15 05:56:52,945 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-15 05:56:52,946 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-15 05:56:52,946 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-15 05:56:52,946 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-15 05:56:52,947 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-15 05:56:52,947 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-15 05:56:52,947 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-15 05:56:52,948 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-15 05:56:52,948 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-15 05:56:52,948 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-15 05:56:52,949 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-15 05:56:52,949 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-15 05:56:52,950 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-15 05:56:52,950 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-15 05:56:52,950 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-15 05:56:52,951 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-15 05:56:52,951 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-15 05:56:52,951 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-15 05:56:52,952 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-15 05:56:52,952 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-15 05:56:52,952 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-15 05:56:52,953 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-15 05:56:52,953 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-15 05:56:52,953 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-15 05:56:52,954 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-15 05:56:52,954 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-15 05:56:52,954 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-15 05:56:52,955 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-15 05:56:52,955 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-15 05:56:52,955 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-15 05:56:52,956 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-15 05:56:52,956 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-15 05:56:52,956 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-15 05:56:52,957 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-15 05:56:52,957 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-15 05:56:52,957 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-15 05:56:52,958 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-15 05:56:52,958 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-15 05:56:52,958 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-15 05:56:52,959 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-15 05:56:52,959 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-15 05:56:52,959 INFO L290 TraceCheckUtils]: 96: Hoare triple {36315#(<= main_~i~0 45)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-15 05:56:52,959 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-15 05:56:52,959 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-15 05:56:52,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-15 05:56:52,960 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-15 05:56:52,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-15 05:56:52,960 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-15 05:56:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679420360] [2022-04-15 05:56:52,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679420360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045750560] [2022-04-15 05:56:52,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:52,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:52,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:52,964 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-15 05:56:52,995 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-15 05:57:14,950 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-15 05:57:14,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:14,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 05:57:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:15,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:15,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {36265#true} call ULTIMATE.init(); {36265#true} is VALID [2022-04-15 05:57:15,600 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-15 05:57:15,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-15 05:57:15,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-15 05:57:15,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-15 05:57:15,601 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-15 05:57:15,601 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-15 05:57:15,601 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-15 05:57:15,602 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-15 05:57:15,602 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-15 05:57:15,602 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-15 05:57:15,603 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-15 05:57:15,603 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-15 05:57:15,603 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-15 05:57:15,604 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-15 05:57:15,604 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-15 05:57:15,604 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-15 05:57:15,605 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-15 05:57:15,605 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-15 05:57:15,605 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-15 05:57:15,606 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-15 05:57:15,606 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-15 05:57:15,606 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-15 05:57:15,607 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-15 05:57:15,607 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-15 05:57:15,607 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-15 05:57:15,608 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-15 05:57:15,608 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-15 05:57:15,608 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-15 05:57:15,609 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-15 05:57:15,609 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-15 05:57:15,609 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-15 05:57:15,610 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-15 05:57:15,610 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-15 05:57:15,610 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-15 05:57:15,611 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-15 05:57:15,611 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-15 05:57:15,611 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-15 05:57:15,612 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-15 05:57:15,612 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-15 05:57:15,612 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-15 05:57:15,613 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-15 05:57:15,613 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-15 05:57:15,613 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-15 05:57:15,614 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-15 05:57:15,614 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-15 05:57:15,614 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-15 05:57:15,615 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-15 05:57:15,615 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-15 05:57:15,615 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-15 05:57:15,616 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-15 05:57:15,616 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-15 05:57:15,616 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-15 05:57:15,617 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-15 05:57:15,617 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-15 05:57:15,617 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-15 05:57:15,618 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-15 05:57:15,618 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-15 05:57:15,618 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-15 05:57:15,619 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-15 05:57:15,619 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-15 05:57:15,619 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-15 05:57:15,620 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-15 05:57:15,620 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-15 05:57:15,620 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-15 05:57:15,621 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-15 05:57:15,621 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-15 05:57:15,621 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-15 05:57:15,622 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-15 05:57:15,622 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-15 05:57:15,622 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-15 05:57:15,623 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-15 05:57:15,623 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-15 05:57:15,623 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-15 05:57:15,624 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-15 05:57:15,624 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-15 05:57:15,624 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-15 05:57:15,625 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-15 05:57:15,625 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-15 05:57:15,625 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-15 05:57:15,626 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-15 05:57:15,626 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-15 05:57:15,626 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-15 05:57:15,627 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-15 05:57:15,627 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-15 05:57:15,627 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-15 05:57:15,628 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-15 05:57:15,628 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-15 05:57:15,628 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-15 05:57:15,629 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-15 05:57:15,629 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-15 05:57:15,629 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-15 05:57:15,630 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-15 05:57:15,630 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-15 05:57:15,630 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-15 05:57:15,631 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-15 05:57:15,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {36315#(<= main_~i~0 45)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-15 05:57:15,631 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-15 05:57:15,631 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-15 05:57:15,631 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-15 05:57:15,631 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-15 05:57:15,631 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-15 05:57:15,632 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-15 05:57:15,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:18,205 INFO L290 TraceCheckUtils]: 101: Hoare triple {36266#false} assume !false; {36266#false} is VALID [2022-04-15 05:57:18,205 INFO L290 TraceCheckUtils]: 100: Hoare triple {36266#false} assume 0 == ~cond; {36266#false} is VALID [2022-04-15 05:57:18,205 INFO L290 TraceCheckUtils]: 99: Hoare triple {36266#false} ~cond := #in~cond; {36266#false} is VALID [2022-04-15 05:57:18,205 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-15 05:57:18,206 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-15 05:57:18,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {36639#(< main_~i~0 2048)} assume !(~i~0 < 2048); {36266#false} is VALID [2022-04-15 05:57:18,206 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-15 05:57:18,207 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-15 05:57:18,207 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-15 05:57:18,207 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-15 05:57:18,208 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-15 05:57:18,208 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-15 05:57:18,208 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-15 05:57:18,209 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-15 05:57:18,209 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-15 05:57:18,209 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-15 05:57:18,210 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-15 05:57:18,210 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-15 05:57:18,210 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-15 05:57:18,211 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-15 05:57:18,211 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-15 05:57:18,211 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-15 05:57:18,212 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-15 05:57:18,212 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-15 05:57:18,212 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-15 05:57:18,213 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-15 05:57:18,213 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-15 05:57:18,213 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-15 05:57:18,214 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-15 05:57:18,214 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-15 05:57:18,214 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-15 05:57:18,215 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-15 05:57:18,215 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-15 05:57:18,215 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-15 05:57:18,216 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-15 05:57:18,216 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-15 05:57:18,216 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-15 05:57:18,217 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-15 05:57:18,217 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-15 05:57:18,217 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-15 05:57:18,218 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-15 05:57:18,218 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-15 05:57:18,218 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-15 05:57:18,219 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-15 05:57:18,219 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-15 05:57:18,219 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-15 05:57:18,220 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-15 05:57:18,220 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-15 05:57:18,220 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-15 05:57:18,221 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-15 05:57:18,221 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-15 05:57:18,221 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-15 05:57:18,222 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-15 05:57:18,222 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-15 05:57:18,222 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-15 05:57:18,223 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-15 05:57:18,223 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-15 05:57:18,223 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-15 05:57:18,224 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-15 05:57:18,224 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-15 05:57:18,224 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-15 05:57:18,225 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-15 05:57:18,225 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-15 05:57:18,225 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-15 05:57:18,226 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-15 05:57:18,226 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-15 05:57:18,226 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-15 05:57:18,227 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-15 05:57:18,227 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-15 05:57:18,227 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-15 05:57:18,228 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-15 05:57:18,228 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-15 05:57:18,228 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-15 05:57:18,229 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-15 05:57:18,229 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-15 05:57:18,229 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-15 05:57:18,230 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-15 05:57:18,230 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-15 05:57:18,230 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-15 05:57:18,231 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-15 05:57:18,231 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-15 05:57:18,231 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-15 05:57:18,232 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-15 05:57:18,232 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-15 05:57:18,232 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-15 05:57:18,233 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-15 05:57:18,233 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-15 05:57:18,233 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-15 05:57:18,234 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-15 05:57:18,234 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-15 05:57:18,234 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-15 05:57:18,235 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-15 05:57:18,235 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-15 05:57:18,235 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-15 05:57:18,236 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-15 05:57:18,236 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-15 05:57:18,237 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-15 05:57:18,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {36265#true} call #t~ret5 := main(); {36265#true} is VALID [2022-04-15 05:57:18,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36265#true} {36265#true} #44#return; {36265#true} is VALID [2022-04-15 05:57:18,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {36265#true} assume true; {36265#true} is VALID [2022-04-15 05:57:18,237 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-15 05:57:18,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {36265#true} call ULTIMATE.init(); {36265#true} is VALID [2022-04-15 05:57:18,237 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-15 05:57:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045750560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:18,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:18,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 05:57:18,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157880894] [2022-04-15 05:57:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157880894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:18,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:18,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 05:57:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797945947] [2022-04-15 05:57:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:18,239 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-15 05:57:18,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:18,239 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-15 05:57:18,318 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-15 05:57:18,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 05:57:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 05:57:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 05:57:18,320 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-15 05:57:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:19,988 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:57:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 05:57:19,988 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-15 05:57:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:19,989 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-15 05:57:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-15 05:57:19,990 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-15 05:57:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2022-04-15 05:57:19,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 112 transitions. [2022-04-15 05:57:20,103 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-15 05:57:20,105 INFO L225 Difference]: With dead ends: 112 [2022-04-15 05:57:20,105 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 05:57:20,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 05:57:20,107 INFO L913 BasicCegarLoop]: 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-15 05:57:20,107 INFO L914 BasicCegarLoop]: 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-15 05:57:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 05:57:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-04-15 05:57:20,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:20,678 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-15 05:57:20,679 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-15 05:57:20,679 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-15 05:57:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:20,680 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:57:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-15 05:57:20,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:20,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:20,680 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-15 05:57:20,680 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-15 05:57:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:20,682 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-15 05:57:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-15 05:57:20,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:20,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:20,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:20,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:20,682 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-15 05:57:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-15 05:57:20,683 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2022-04-15 05:57:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:20,684 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-15 05:57:20,684 INFO L479 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-15 05:57:20,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 105 transitions. [2022-04-15 05:57:20,833 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-15 05:57:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-15 05:57:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 05:57:20,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:20,833 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:20,875 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-15 05:57:21,059 WARN L460 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-15 05:57:21,059 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1315366698, now seen corresponding path program 91 times [2022-04-15 05:57:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187830032] [2022-04-15 05:57:21,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:21,068 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:21,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1315366698, now seen corresponding path program 92 times [2022-04-15 05:57:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202323878] [2022-04-15 05:57:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:22,020 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-15 05:57:22,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-15 05:57:22,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-15 05:57:22,021 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-15 05:57:22,021 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-15 05:57:22,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-15 05:57:22,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-15 05:57:22,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-15 05:57:22,022 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-15 05:57:22,022 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-15 05:57:22,023 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-15 05:57:22,023 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-15 05:57:22,024 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-15 05:57:22,024 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-15 05:57:22,024 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-15 05:57:22,025 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-15 05:57:22,025 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-15 05:57:22,026 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-15 05:57:22,026 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-15 05:57:22,026 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-15 05:57:22,027 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-15 05:57:22,027 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-15 05:57:22,027 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-15 05:57:22,028 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-15 05:57:22,028 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-15 05:57:22,028 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-15 05:57:22,029 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-15 05:57:22,029 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-15 05:57:22,029 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-15 05:57:22,030 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-15 05:57:22,030 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-15 05:57:22,030 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-15 05:57:22,031 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-15 05:57:22,031 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-15 05:57:22,031 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-15 05:57:22,032 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-15 05:57:22,032 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-15 05:57:22,032 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-15 05:57:22,033 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-15 05:57:22,033 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-15 05:57:22,033 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-15 05:57:22,034 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-15 05:57:22,034 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-15 05:57:22,034 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-15 05:57:22,035 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-15 05:57:22,035 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-15 05:57:22,035 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-15 05:57:22,036 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-15 05:57:22,036 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-15 05:57:22,036 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-15 05:57:22,037 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-15 05:57:22,037 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-15 05:57:22,037 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-15 05:57:22,038 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-15 05:57:22,038 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-15 05:57:22,038 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-15 05:57:22,039 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-15 05:57:22,039 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-15 05:57:22,039 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-15 05:57:22,040 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-15 05:57:22,040 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-15 05:57:22,040 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-15 05:57:22,041 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-15 05:57:22,041 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-15 05:57:22,041 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-15 05:57:22,042 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-15 05:57:22,042 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-15 05:57:22,042 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-15 05:57:22,043 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-15 05:57:22,043 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-15 05:57:22,043 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-15 05:57:22,043 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-15 05:57:22,044 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-15 05:57:22,044 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-15 05:57:22,045 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-15 05:57:22,045 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-15 05:57:22,045 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-15 05:57:22,045 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-15 05:57:22,046 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-15 05:57:22,046 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-15 05:57:22,047 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-15 05:57:22,047 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-15 05:57:22,047 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-15 05:57:22,047 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-15 05:57:22,048 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-15 05:57:22,048 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-15 05:57:22,048 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-15 05:57:22,049 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-15 05:57:22,049 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-15 05:57:22,049 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-15 05:57:22,050 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-15 05:57:22,050 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-15 05:57:22,050 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-15 05:57:22,051 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-15 05:57:22,051 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-15 05:57:22,051 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-15 05:57:22,052 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-15 05:57:22,052 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-15 05:57:22,052 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-15 05:57:22,053 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-15 05:57:22,053 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-15 05:57:22,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {37764#(<= main_~i~0 46)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-15 05:57:22,054 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-15 05:57:22,054 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-15 05:57:22,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-15 05:57:22,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-15 05:57:22,054 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-15 05:57:22,054 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-15 05:57:22,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:22,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202323878] [2022-04-15 05:57:22,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202323878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:22,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794970455] [2022-04-15 05:57:22,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:22,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:22,056 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-15 05:57:22,057 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-15 05:57:22,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:22,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:22,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 05:57:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:22,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:22,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {37713#true} call ULTIMATE.init(); {37713#true} is VALID [2022-04-15 05:57:22,982 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-15 05:57:22,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-15 05:57:22,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-15 05:57:22,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-15 05:57:22,983 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-15 05:57:22,983 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-15 05:57:22,983 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-15 05:57:22,984 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-15 05:57:22,984 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-15 05:57:22,984 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-15 05:57:22,985 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-15 05:57:22,985 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-15 05:57:22,985 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-15 05:57:22,986 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-15 05:57:22,986 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-15 05:57:22,986 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-15 05:57:22,987 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-15 05:57:22,987 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-15 05:57:22,987 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-15 05:57:22,988 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-15 05:57:22,988 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-15 05:57:22,988 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-15 05:57:22,989 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-15 05:57:22,989 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-15 05:57:22,989 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-15 05:57:22,990 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-15 05:57:22,990 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-15 05:57:22,990 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-15 05:57:22,991 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-15 05:57:22,991 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-15 05:57:22,991 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-15 05:57:22,991 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-15 05:57:22,992 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-15 05:57:22,992 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-15 05:57:22,993 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-15 05:57:22,993 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-15 05:57:22,993 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-15 05:57:22,993 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-15 05:57:22,994 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-15 05:57:22,994 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-15 05:57:22,994 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-15 05:57:22,995 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-15 05:57:22,995 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-15 05:57:22,995 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-15 05:57:22,996 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-15 05:57:22,996 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-15 05:57:22,996 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-15 05:57:22,997 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-15 05:57:22,997 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-15 05:57:22,997 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-15 05:57:22,998 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-15 05:57:22,998 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-15 05:57:22,998 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-15 05:57:22,999 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-15 05:57:22,999 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-15 05:57:22,999 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-15 05:57:23,000 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-15 05:57:23,000 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-15 05:57:23,000 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-15 05:57:23,001 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-15 05:57:23,001 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-15 05:57:23,001 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-15 05:57:23,002 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-15 05:57:23,002 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-15 05:57:23,002 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-15 05:57:23,003 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-15 05:57:23,003 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-15 05:57:23,003 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-15 05:57:23,004 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-15 05:57:23,004 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-15 05:57:23,004 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-15 05:57:23,005 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-15 05:57:23,005 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-15 05:57:23,005 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-15 05:57:23,006 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-15 05:57:23,006 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-15 05:57:23,006 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-15 05:57:23,007 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-15 05:57:23,007 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-15 05:57:23,007 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-15 05:57:23,008 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-15 05:57:23,008 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-15 05:57:23,008 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-15 05:57:23,009 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-15 05:57:23,009 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-15 05:57:23,009 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-15 05:57:23,010 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-15 05:57:23,010 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-15 05:57:23,010 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-15 05:57:23,011 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-15 05:57:23,011 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-15 05:57:23,011 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-15 05:57:23,012 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-15 05:57:23,012 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-15 05:57:23,012 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-15 05:57:23,013 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-15 05:57:23,013 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-15 05:57:23,013 INFO L290 TraceCheckUtils]: 98: Hoare triple {37764#(<= main_~i~0 46)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-15 05:57:23,013 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-15 05:57:23,014 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-15 05:57:23,014 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-15 05:57:23,014 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-15 05:57:23,014 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-15 05:57:23,014 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-15 05:57:23,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 103: Hoare triple {37714#false} assume !false; {37714#false} is VALID [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 102: Hoare triple {37714#false} assume 0 == ~cond; {37714#false} is VALID [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 101: Hoare triple {37714#false} ~cond := #in~cond; {37714#false} is VALID [2022-04-15 05:57:25,696 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-15 05:57:25,696 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-15 05:57:25,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {38094#(< main_~i~0 2048)} assume !(~i~0 < 2048); {37714#false} is VALID [2022-04-15 05:57:25,697 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-15 05:57:25,698 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-15 05:57:25,698 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-15 05:57:25,699 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-15 05:57:25,699 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-15 05:57:25,699 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-15 05:57:25,700 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-15 05:57:25,700 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-15 05:57:25,701 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-15 05:57:25,701 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-15 05:57:25,701 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-15 05:57:25,702 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-15 05:57:25,702 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-15 05:57:25,703 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-15 05:57:25,703 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-15 05:57:25,704 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-15 05:57:25,704 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-15 05:57:25,704 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-15 05:57:25,705 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-15 05:57:25,705 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-15 05:57:25,706 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-15 05:57:25,706 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-15 05:57:25,707 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-15 05:57:25,707 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-15 05:57:25,708 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-15 05:57:25,708 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-15 05:57:25,708 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-15 05:57:25,709 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-15 05:57:25,709 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-15 05:57:25,710 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-15 05:57:25,710 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-15 05:57:25,711 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-15 05:57:25,711 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-15 05:57:25,712 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-15 05:57:25,712 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-15 05:57:25,713 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-15 05:57:25,713 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-15 05:57:25,714 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-15 05:57:25,714 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-15 05:57:25,714 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-15 05:57:25,715 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-15 05:57:25,715 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-15 05:57:25,716 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-15 05:57:25,716 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-15 05:57:25,717 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-15 05:57:25,717 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-15 05:57:25,717 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-15 05:57:25,718 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-15 05:57:25,718 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-15 05:57:25,718 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-15 05:57:25,719 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-15 05:57:25,719 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-15 05:57:25,719 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-15 05:57:25,720 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-15 05:57:25,720 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-15 05:57:25,720 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-15 05:57:25,721 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-15 05:57:25,721 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-15 05:57:25,721 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-15 05:57:25,722 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-15 05:57:25,722 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-15 05:57:25,722 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-15 05:57:25,723 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-15 05:57:25,723 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-15 05:57:25,724 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-15 05:57:25,724 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-15 05:57:25,724 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-15 05:57:25,724 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-15 05:57:25,725 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-15 05:57:25,725 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-15 05:57:25,726 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-15 05:57:25,726 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-15 05:57:25,726 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-15 05:57:25,726 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-15 05:57:25,727 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-15 05:57:25,727 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-15 05:57:25,728 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-15 05:57:25,728 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-15 05:57:25,728 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-15 05:57:25,728 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-15 05:57:25,729 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-15 05:57:25,729 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-15 05:57:25,730 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-15 05:57:25,730 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-15 05:57:25,730 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-15 05:57:25,731 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-15 05:57:25,731 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-15 05:57:25,731 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-15 05:57:25,732 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-15 05:57:25,732 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-15 05:57:25,732 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-15 05:57:25,733 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-15 05:57:25,733 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-15 05:57:25,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {37713#true} call #t~ret5 := main(); {37713#true} is VALID [2022-04-15 05:57:25,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37713#true} {37713#true} #44#return; {37713#true} is VALID [2022-04-15 05:57:25,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {37713#true} assume true; {37713#true} is VALID [2022-04-15 05:57:25,733 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-15 05:57:25,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {37713#true} call ULTIMATE.init(); {37713#true} is VALID [2022-04-15 05:57:25,734 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-15 05:57:25,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794970455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:25,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:25,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 05:57:25,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:25,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187830032] [2022-04-15 05:57:25,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187830032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:25,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:25,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 05:57:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550169261] [2022-04-15 05:57:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:25,735 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-15 05:57:25,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:25,735 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-15 05:57:25,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:25,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 05:57:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:25,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 05:57:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 05:57:25,804 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-15 05:57:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:27,546 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:57:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 05:57:27,546 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-15 05:57:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:27,546 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-15 05:57:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-15 05:57:27,547 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-15 05:57:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. [2022-04-15 05:57:27,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 114 transitions. [2022-04-15 05:57:27,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:27,635 INFO L225 Difference]: With dead ends: 114 [2022-04-15 05:57:27,635 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 05:57:27,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 05:57:27,636 INFO L913 BasicCegarLoop]: 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-15 05:57:27,637 INFO L914 BasicCegarLoop]: 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-15 05:57:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 05:57:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-15 05:57:28,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:28,136 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-15 05:57:28,137 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-15 05:57:28,137 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-15 05:57:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:28,138 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:57:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-15 05:57:28,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:28,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:28,138 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-15 05:57:28,138 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-15 05:57:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:28,139 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-15 05:57:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-15 05:57:28,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:28,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:28,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:28,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:28,140 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-15 05:57:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-04-15 05:57:28,141 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2022-04-15 05:57:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:28,141 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-04-15 05:57:28,142 INFO L479 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-15 05:57:28,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 107 transitions. [2022-04-15 05:57:28,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-15 05:57:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 05:57:28,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:28,272 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:28,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:28,479 WARN L460 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-15 05:57:28,479 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2073868152, now seen corresponding path program 93 times [2022-04-15 05:57:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:28,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615507507] [2022-04-15 05:57:28,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:28,482 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:28,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2073868152, now seen corresponding path program 94 times [2022-04-15 05:57:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638849649] [2022-04-15 05:57:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:29,487 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-15 05:57:29,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-15 05:57:29,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-15 05:57:29,488 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-15 05:57:29,488 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-15 05:57:29,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-15 05:57:29,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-15 05:57:29,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-15 05:57:29,488 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-15 05:57:29,488 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-15 05:57:29,489 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-15 05:57:29,489 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-15 05:57:29,489 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-15 05:57:29,490 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-15 05:57:29,490 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-15 05:57:29,490 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-15 05:57:29,491 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-15 05:57:29,491 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-15 05:57:29,491 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-15 05:57:29,492 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-15 05:57:29,492 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-15 05:57:29,492 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-15 05:57:29,493 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-15 05:57:29,493 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-15 05:57:29,493 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-15 05:57:29,494 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-15 05:57:29,494 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-15 05:57:29,494 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-15 05:57:29,495 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-15 05:57:29,495 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-15 05:57:29,495 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-15 05:57:29,496 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-15 05:57:29,496 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-15 05:57:29,496 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-15 05:57:29,497 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-15 05:57:29,497 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-15 05:57:29,497 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-15 05:57:29,498 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-15 05:57:29,498 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-15 05:57:29,498 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-15 05:57:29,499 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-15 05:57:29,499 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-15 05:57:29,499 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-15 05:57:29,500 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-15 05:57:29,500 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-15 05:57:29,500 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-15 05:57:29,501 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-15 05:57:29,501 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-15 05:57:29,501 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-15 05:57:29,502 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-15 05:57:29,502 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-15 05:57:29,502 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-15 05:57:29,503 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-15 05:57:29,503 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-15 05:57:29,503 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-15 05:57:29,504 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-15 05:57:29,504 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-15 05:57:29,504 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-15 05:57:29,505 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-15 05:57:29,505 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-15 05:57:29,505 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-15 05:57:29,505 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-15 05:57:29,506 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-15 05:57:29,506 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-15 05:57:29,507 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-15 05:57:29,507 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-15 05:57:29,507 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-15 05:57:29,507 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-15 05:57:29,508 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-15 05:57:29,508 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-15 05:57:29,509 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-15 05:57:29,509 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-15 05:57:29,509 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-15 05:57:29,509 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-15 05:57:29,510 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-15 05:57:29,510 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-15 05:57:29,511 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-15 05:57:29,511 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-15 05:57:29,511 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-15 05:57:29,511 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-15 05:57:29,512 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-15 05:57:29,512 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-15 05:57:29,513 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-15 05:57:29,513 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-15 05:57:29,513 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-15 05:57:29,513 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-15 05:57:29,514 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-15 05:57:29,514 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-15 05:57:29,514 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-15 05:57:29,515 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-15 05:57:29,515 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-15 05:57:29,515 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-15 05:57:29,516 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-15 05:57:29,516 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-15 05:57:29,516 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-15 05:57:29,517 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-15 05:57:29,517 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-15 05:57:29,517 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-15 05:57:29,518 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-15 05:57:29,518 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-15 05:57:29,518 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-15 05:57:29,519 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-15 05:57:29,519 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-15 05:57:29,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {39241#(<= main_~i~0 47)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-15 05:57:29,519 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-15 05:57:29,520 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-15 05:57:29,520 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-15 05:57:29,520 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-15 05:57:29,520 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-15 05:57:29,520 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-15 05:57:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638849649] [2022-04-15 05:57:29,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638849649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533538538] [2022-04-15 05:57:29,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:29,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:29,522 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-15 05:57:29,522 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-15 05:57:29,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:29,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:29,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 05:57:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:29,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:30,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {39189#true} call ULTIMATE.init(); {39189#true} is VALID [2022-04-15 05:57:30,474 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-15 05:57:30,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-15 05:57:30,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-15 05:57:30,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-15 05:57:30,475 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-15 05:57:30,475 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-15 05:57:30,476 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-15 05:57:30,476 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-15 05:57:30,477 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-15 05:57:30,477 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-15 05:57:30,477 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-15 05:57:30,477 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-15 05:57:30,478 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-15 05:57:30,478 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-15 05:57:30,478 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-15 05:57:30,479 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-15 05:57:30,479 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-15 05:57:30,479 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-15 05:57:30,480 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-15 05:57:30,480 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-15 05:57:30,480 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-15 05:57:30,481 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-15 05:57:30,481 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-15 05:57:30,481 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-15 05:57:30,482 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-15 05:57:30,482 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-15 05:57:30,482 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-15 05:57:30,483 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-15 05:57:30,483 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-15 05:57:30,483 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-15 05:57:30,484 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-15 05:57:30,484 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-15 05:57:30,484 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-15 05:57:30,485 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-15 05:57:30,485 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-15 05:57:30,485 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-15 05:57:30,486 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-15 05:57:30,486 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-15 05:57:30,486 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-15 05:57:30,487 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-15 05:57:30,487 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-15 05:57:30,487 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-15 05:57:30,488 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-15 05:57:30,488 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-15 05:57:30,488 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-15 05:57:30,489 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-15 05:57:30,489 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-15 05:57:30,489 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-15 05:57:30,490 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-15 05:57:30,490 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-15 05:57:30,490 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-15 05:57:30,491 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-15 05:57:30,491 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-15 05:57:30,491 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-15 05:57:30,492 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-15 05:57:30,492 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-15 05:57:30,492 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-15 05:57:30,493 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-15 05:57:30,493 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-15 05:57:30,493 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-15 05:57:30,494 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-15 05:57:30,494 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-15 05:57:30,494 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-15 05:57:30,495 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-15 05:57:30,495 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-15 05:57:30,495 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-15 05:57:30,496 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-15 05:57:30,496 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-15 05:57:30,496 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-15 05:57:30,497 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-15 05:57:30,497 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-15 05:57:30,497 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-15 05:57:30,498 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-15 05:57:30,498 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-15 05:57:30,498 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-15 05:57:30,499 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-15 05:57:30,499 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-15 05:57:30,499 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-15 05:57:30,500 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-15 05:57:30,500 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-15 05:57:30,500 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-15 05:57:30,501 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-15 05:57:30,501 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-15 05:57:30,501 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-15 05:57:30,502 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-15 05:57:30,502 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-15 05:57:30,502 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-15 05:57:30,503 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-15 05:57:30,503 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-15 05:57:30,503 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-15 05:57:30,504 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-15 05:57:30,504 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-15 05:57:30,504 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-15 05:57:30,505 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-15 05:57:30,505 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-15 05:57:30,505 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-15 05:57:30,506 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-15 05:57:30,506 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-15 05:57:30,506 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-15 05:57:30,507 INFO L290 TraceCheckUtils]: 100: Hoare triple {39241#(<= main_~i~0 47)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-15 05:57:30,507 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-15 05:57:30,507 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-15 05:57:30,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-15 05:57:30,507 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-15 05:57:30,507 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-15 05:57:30,507 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-15 05:57:30,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:33,272 INFO L290 TraceCheckUtils]: 105: Hoare triple {39190#false} assume !false; {39190#false} is VALID [2022-04-15 05:57:33,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {39190#false} assume 0 == ~cond; {39190#false} is VALID [2022-04-15 05:57:33,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {39190#false} ~cond := #in~cond; {39190#false} is VALID [2022-04-15 05:57:33,273 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-15 05:57:33,273 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-15 05:57:33,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {39577#(< main_~i~0 2048)} assume !(~i~0 < 2048); {39190#false} is VALID [2022-04-15 05:57:33,274 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-15 05:57:33,274 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-15 05:57:33,274 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-15 05:57:33,275 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-15 05:57:33,275 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-15 05:57:33,275 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-15 05:57:33,276 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-15 05:57:33,276 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-15 05:57:33,276 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-15 05:57:33,277 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-15 05:57:33,277 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-15 05:57:33,277 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-15 05:57:33,278 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-15 05:57:33,278 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-15 05:57:33,278 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-15 05:57:33,279 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-15 05:57:33,279 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-15 05:57:33,279 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-15 05:57:33,280 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-15 05:57:33,280 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-15 05:57:33,280 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-15 05:57:33,281 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-15 05:57:33,281 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-15 05:57:33,281 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-15 05:57:33,282 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-15 05:57:33,282 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-15 05:57:33,282 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-15 05:57:33,283 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-15 05:57:33,283 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-15 05:57:33,283 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-15 05:57:33,284 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-15 05:57:33,284 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-15 05:57:33,284 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-15 05:57:33,285 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-15 05:57:33,285 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-15 05:57:33,285 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-15 05:57:33,286 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-15 05:57:33,286 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-15 05:57:33,286 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-15 05:57:33,287 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-15 05:57:33,287 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-15 05:57:33,287 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-15 05:57:33,288 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-15 05:57:33,288 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-15 05:57:33,288 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-15 05:57:33,289 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-15 05:57:33,289 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-15 05:57:33,289 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-15 05:57:33,290 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-15 05:57:33,290 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-15 05:57:33,290 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-15 05:57:33,291 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-15 05:57:33,291 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-15 05:57:33,291 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-15 05:57:33,292 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-15 05:57:33,292 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-15 05:57:33,292 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-15 05:57:33,293 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-15 05:57:33,293 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-15 05:57:33,293 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-15 05:57:33,294 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-15 05:57:33,294 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-15 05:57:33,294 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-15 05:57:33,294 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-15 05:57:33,295 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-15 05:57:33,295 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-15 05:57:33,296 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-15 05:57:33,296 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-15 05:57:33,296 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-15 05:57:33,296 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-15 05:57:33,297 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-15 05:57:33,297 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-15 05:57:33,297 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-15 05:57:33,298 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-15 05:57:33,298 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-15 05:57:33,298 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-15 05:57:33,299 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-15 05:57:33,299 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-15 05:57:33,299 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-15 05:57:33,300 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-15 05:57:33,300 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-15 05:57:33,300 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-15 05:57:33,301 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-15 05:57:33,301 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-15 05:57:33,301 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-15 05:57:33,302 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-15 05:57:33,302 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-15 05:57:33,302 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-15 05:57:33,303 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-15 05:57:33,303 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-15 05:57:33,304 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-15 05:57:33,304 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-15 05:57:33,304 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-15 05:57:33,304 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-15 05:57:33,305 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-15 05:57:33,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {39189#true} call #t~ret5 := main(); {39189#true} is VALID [2022-04-15 05:57:33,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39189#true} {39189#true} #44#return; {39189#true} is VALID [2022-04-15 05:57:33,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {39189#true} assume true; {39189#true} is VALID [2022-04-15 05:57:33,305 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-15 05:57:33,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {39189#true} call ULTIMATE.init(); {39189#true} is VALID [2022-04-15 05:57:33,306 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-15 05:57:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533538538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:33,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:33,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-15 05:57:33,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:33,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615507507] [2022-04-15 05:57:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615507507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:33,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:33,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 05:57:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462327865] [2022-04-15 05:57:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:33,307 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-15 05:57:33,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:33,307 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-15 05:57:33,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:33,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 05:57:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 05:57:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:57:33,376 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-15 05:57:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:35,173 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:57:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 05:57:35,174 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-15 05:57:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:35,174 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-15 05:57:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-15 05:57:35,175 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-15 05:57:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 116 transitions. [2022-04-15 05:57:35,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 116 transitions. [2022-04-15 05:57:35,265 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-15 05:57:35,266 INFO L225 Difference]: With dead ends: 116 [2022-04-15 05:57:35,266 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 05:57:35,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9606, Invalid=12150, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 05:57:35,268 INFO L913 BasicCegarLoop]: 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-15 05:57:35,268 INFO L914 BasicCegarLoop]: 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-15 05:57:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 05:57:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 05:57:35,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:35,788 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-15 05:57:35,788 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-15 05:57:35,788 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-15 05:57:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:35,789 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:57:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-15 05:57:35,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:35,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:35,789 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-15 05:57:35,789 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-15 05:57:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:35,790 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-15 05:57:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-15 05:57:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:35,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:35,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:35,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:35,791 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-15 05:57:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-04-15 05:57:35,792 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2022-04-15 05:57:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:35,792 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-04-15 05:57:35,792 INFO L479 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-15 05:57:35,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 109 transitions. [2022-04-15 05:57:35,916 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-15 05:57:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-15 05:57:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 05:57:35,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:35,916 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:35,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-15 05:57:36,117 WARN L460 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-15 05:57:36,117 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash -751618662, now seen corresponding path program 95 times [2022-04-15 05:57:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:36,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164140700] [2022-04-15 05:57:36,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:36,120 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:36,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash -751618662, now seen corresponding path program 96 times [2022-04-15 05:57:36,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:36,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412306225] [2022-04-15 05:57:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:37,059 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-15 05:57:37,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-15 05:57:37,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-15 05:57:37,059 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-15 05:57:37,060 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-15 05:57:37,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-15 05:57:37,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-15 05:57:37,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-15 05:57:37,060 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-15 05:57:37,060 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-15 05:57:37,061 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-15 05:57:37,061 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-15 05:57:37,061 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-15 05:57:37,062 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-15 05:57:37,062 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-15 05:57:37,062 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-15 05:57:37,063 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-15 05:57:37,063 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-15 05:57:37,063 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-15 05:57:37,064 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-15 05:57:37,064 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-15 05:57:37,064 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-15 05:57:37,065 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-15 05:57:37,065 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-15 05:57:37,065 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-15 05:57:37,065 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-15 05:57:37,066 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-15 05:57:37,066 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-15 05:57:37,067 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-15 05:57:37,067 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-15 05:57:37,067 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-15 05:57:37,067 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-15 05:57:37,068 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-15 05:57:37,068 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-15 05:57:37,068 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-15 05:57:37,069 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-15 05:57:37,069 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-15 05:57:37,069 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-15 05:57:37,070 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-15 05:57:37,070 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-15 05:57:37,070 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-15 05:57:37,071 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-15 05:57:37,071 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-15 05:57:37,071 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-15 05:57:37,072 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-15 05:57:37,072 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-15 05:57:37,072 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-15 05:57:37,073 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-15 05:57:37,073 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-15 05:57:37,073 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-15 05:57:37,074 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-15 05:57:37,074 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-15 05:57:37,074 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-15 05:57:37,075 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-15 05:57:37,075 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-15 05:57:37,075 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-15 05:57:37,076 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-15 05:57:37,076 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-15 05:57:37,076 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-15 05:57:37,077 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-15 05:57:37,077 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-15 05:57:37,077 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-15 05:57:37,078 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-15 05:57:37,078 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-15 05:57:37,078 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-15 05:57:37,079 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-15 05:57:37,079 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-15 05:57:37,079 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-15 05:57:37,080 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-15 05:57:37,080 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-15 05:57:37,080 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-15 05:57:37,080 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-15 05:57:37,081 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-15 05:57:37,081 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-15 05:57:37,082 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-15 05:57:37,082 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-15 05:57:37,082 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-15 05:57:37,082 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-15 05:57:37,083 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-15 05:57:37,083 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-15 05:57:37,083 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-15 05:57:37,084 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-15 05:57:37,084 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-15 05:57:37,084 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-15 05:57:37,085 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-15 05:57:37,085 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-15 05:57:37,085 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-15 05:57:37,086 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-15 05:57:37,086 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-15 05:57:37,086 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-15 05:57:37,087 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-15 05:57:37,087 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-15 05:57:37,087 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-15 05:57:37,088 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-15 05:57:37,088 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-15 05:57:37,088 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-15 05:57:37,089 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-15 05:57:37,089 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-15 05:57:37,089 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-15 05:57:37,090 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-15 05:57:37,090 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-15 05:57:37,090 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-15 05:57:37,091 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-15 05:57:37,091 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-15 05:57:37,091 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-15 05:57:37,092 INFO L290 TraceCheckUtils]: 102: Hoare triple {40746#(<= main_~i~0 48)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-15 05:57:37,092 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-15 05:57:37,092 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-15 05:57:37,092 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-15 05:57:37,092 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-15 05:57:37,092 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-15 05:57:37,092 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-15 05:57:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412306225] [2022-04-15 05:57:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412306225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461750701] [2022-04-15 05:57:37,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:37,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:37,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:37,094 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-15 05:57:37,094 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-15 05:58:12,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2022-04-15 05:58:12,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:12,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 05:58:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:12,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:13,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {40693#true} call ULTIMATE.init(); {40693#true} is VALID [2022-04-15 05:58:13,172 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-15 05:58:13,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-15 05:58:13,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-15 05:58:13,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-15 05:58:13,173 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-15 05:58:13,174 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-15 05:58:13,174 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-15 05:58:13,174 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-15 05:58:13,175 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-15 05:58:13,175 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-15 05:58:13,175 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-15 05:58:13,176 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-15 05:58:13,176 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-15 05:58:13,176 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-15 05:58:13,177 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-15 05:58:13,177 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-15 05:58:13,177 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-15 05:58:13,178 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-15 05:58:13,178 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-15 05:58:13,178 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-15 05:58:13,179 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-15 05:58:13,179 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-15 05:58:13,179 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-15 05:58:13,179 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-15 05:58:13,180 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-15 05:58:13,180 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-15 05:58:13,181 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-15 05:58:13,181 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-15 05:58:13,181 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-15 05:58:13,181 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-15 05:58:13,182 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-15 05:58:13,182 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-15 05:58:13,183 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-15 05:58:13,183 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-15 05:58:13,183 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-15 05:58:13,183 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-15 05:58:13,184 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-15 05:58:13,184 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-15 05:58:13,185 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-15 05:58:13,185 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-15 05:58:13,185 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-15 05:58:13,185 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-15 05:58:13,186 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-15 05:58:13,186 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-15 05:58:13,186 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-15 05:58:13,187 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-15 05:58:13,187 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-15 05:58:13,187 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-15 05:58:13,188 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-15 05:58:13,188 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-15 05:58:13,188 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-15 05:58:13,189 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-15 05:58:13,189 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-15 05:58:13,189 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-15 05:58:13,190 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-15 05:58:13,190 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-15 05:58:13,190 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-15 05:58:13,191 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-15 05:58:13,191 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-15 05:58:13,191 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-15 05:58:13,192 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-15 05:58:13,192 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-15 05:58:13,192 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-15 05:58:13,193 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-15 05:58:13,193 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-15 05:58:13,193 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-15 05:58:13,194 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-15 05:58:13,194 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-15 05:58:13,194 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-15 05:58:13,195 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-15 05:58:13,195 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-15 05:58:13,195 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-15 05:58:13,196 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-15 05:58:13,196 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-15 05:58:13,196 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-15 05:58:13,197 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-15 05:58:13,197 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-15 05:58:13,197 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-15 05:58:13,198 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-15 05:58:13,198 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-15 05:58:13,198 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-15 05:58:13,199 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-15 05:58:13,199 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-15 05:58:13,199 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-15 05:58:13,200 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-15 05:58:13,200 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-15 05:58:13,200 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-15 05:58:13,201 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-15 05:58:13,201 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-15 05:58:13,201 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-15 05:58:13,202 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-15 05:58:13,202 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-15 05:58:13,202 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-15 05:58:13,203 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-15 05:58:13,203 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-15 05:58:13,203 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-15 05:58:13,204 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-15 05:58:13,204 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-15 05:58:13,204 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-15 05:58:13,205 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-15 05:58:13,205 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-15 05:58:13,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {40746#(<= main_~i~0 48)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-15 05:58:13,206 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-15 05:58:13,206 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-15 05:58:13,206 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-15 05:58:13,206 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-15 05:58:13,206 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-15 05:58:13,206 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-15 05:58:13,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:16,076 INFO L290 TraceCheckUtils]: 107: Hoare triple {40694#false} assume !false; {40694#false} is VALID [2022-04-15 05:58:16,076 INFO L290 TraceCheckUtils]: 106: Hoare triple {40694#false} assume 0 == ~cond; {40694#false} is VALID [2022-04-15 05:58:16,076 INFO L290 TraceCheckUtils]: 105: Hoare triple {40694#false} ~cond := #in~cond; {40694#false} is VALID [2022-04-15 05:58:16,076 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-15 05:58:16,076 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-15 05:58:16,076 INFO L290 TraceCheckUtils]: 102: Hoare triple {41088#(< main_~i~0 2048)} assume !(~i~0 < 2048); {40694#false} is VALID [2022-04-15 05:58:16,077 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-15 05:58:16,077 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-15 05:58:16,077 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-15 05:58:16,078 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-15 05:58:16,078 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-15 05:58:16,078 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-15 05:58:16,079 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-15 05:58:16,079 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-15 05:58:16,079 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-15 05:58:16,080 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-15 05:58:16,080 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-15 05:58:16,080 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-15 05:58:16,081 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-15 05:58:16,081 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-15 05:58:16,081 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-15 05:58:16,082 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-15 05:58:16,082 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-15 05:58:16,082 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-15 05:58:16,083 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-15 05:58:16,083 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-15 05:58:16,083 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-15 05:58:16,084 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-15 05:58:16,084 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-15 05:58:16,084 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-15 05:58:16,085 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-15 05:58:16,085 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-15 05:58:16,085 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-15 05:58:16,086 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-15 05:58:16,086 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-15 05:58:16,086 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-15 05:58:16,087 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-15 05:58:16,087 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-15 05:58:16,088 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-15 05:58:16,088 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-15 05:58:16,088 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-15 05:58:16,088 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-15 05:58:16,089 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-15 05:58:16,089 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-15 05:58:16,090 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-15 05:58:16,090 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-15 05:58:16,090 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-15 05:58:16,090 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-15 05:58:16,091 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-15 05:58:16,091 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-15 05:58:16,092 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-15 05:58:16,092 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-15 05:58:16,092 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-15 05:58:16,092 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-15 05:58:16,093 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-15 05:58:16,093 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-15 05:58:16,094 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-15 05:58:16,094 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-15 05:58:16,094 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-15 05:58:16,094 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-15 05:58:16,095 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-15 05:58:16,095 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-15 05:58:16,096 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-15 05:58:16,096 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-15 05:58:16,096 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-15 05:58:16,096 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-15 05:58:16,097 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-15 05:58:16,097 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-15 05:58:16,098 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-15 05:58:16,098 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-15 05:58:16,098 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-15 05:58:16,098 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-15 05:58:16,099 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-15 05:58:16,099 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-15 05:58:16,100 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-15 05:58:16,100 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-15 05:58:16,100 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-15 05:58:16,100 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-15 05:58:16,101 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-15 05:58:16,101 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-15 05:58:16,102 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-15 05:58:16,102 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-15 05:58:16,102 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-15 05:58:16,102 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-15 05:58:16,103 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-15 05:58:16,103 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-15 05:58:16,104 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-15 05:58:16,104 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-15 05:58:16,104 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-15 05:58:16,104 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-15 05:58:16,105 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-15 05:58:16,105 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-15 05:58:16,106 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-15 05:58:16,106 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-15 05:58:16,106 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-15 05:58:16,106 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-15 05:58:16,107 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-15 05:58:16,107 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-15 05:58:16,108 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-15 05:58:16,108 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-15 05:58:16,108 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-15 05:58:16,109 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-15 05:58:16,109 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-15 05:58:16,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {40693#true} call #t~ret5 := main(); {40693#true} is VALID [2022-04-15 05:58:16,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40693#true} {40693#true} #44#return; {40693#true} is VALID [2022-04-15 05:58:16,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {40693#true} assume true; {40693#true} is VALID [2022-04-15 05:58:16,109 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-15 05:58:16,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {40693#true} call ULTIMATE.init(); {40693#true} is VALID [2022-04-15 05:58:16,110 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-15 05:58:16,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461750701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:16,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:16,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 05:58:16,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:16,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164140700] [2022-04-15 05:58:16,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164140700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:16,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:16,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 05:58:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834101560] [2022-04-15 05:58:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:16,111 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-15 05:58:16,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:16,111 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-15 05:58:16,190 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-15 05:58:16,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 05:58:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 05:58:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 05:58:16,192 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-15 05:58:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:18,029 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-15 05:58:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 05:58:18,029 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-15 05:58:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:18,029 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-15 05:58:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-15 05:58:18,030 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-15 05:58:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 118 transitions. [2022-04-15 05:58:18,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 118 transitions. [2022-04-15 05:58:18,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:18,127 INFO L225 Difference]: With dead ends: 118 [2022-04-15 05:58:18,127 INFO L226 Difference]: Without dead ends: 112 [2022-04-15 05:58:18,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 05:58:18,129 INFO L913 BasicCegarLoop]: 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-15 05:58:18,129 INFO L914 BasicCegarLoop]: 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-15 05:58:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-15 05:58:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-04-15 05:58:18,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:18,668 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-15 05:58:18,668 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-15 05:58:18,668 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-15 05:58:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:18,670 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:58:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-15 05:58:18,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:18,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:18,670 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-15 05:58:18,670 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-15 05:58:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:18,672 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-15 05:58:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-15 05:58:18,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:18,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:18,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:18,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:18,672 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-15 05:58:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2022-04-15 05:58:18,674 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2022-04-15 05:58:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:18,674 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2022-04-15 05:58:18,674 INFO L479 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-15 05:58:18,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 111 transitions. [2022-04-15 05:58:18,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-15 05:58:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 05:58:18,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:18,858 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:18,903 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-15 05:58:19,083 WARN L460 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-15 05:58:19,083 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1625115844, now seen corresponding path program 97 times [2022-04-15 05:58:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219368829] [2022-04-15 05:58:19,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:19,086 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:19,086 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1625115844, now seen corresponding path program 98 times [2022-04-15 05:58:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339199558] [2022-04-15 05:58:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:20,061 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-15 05:58:20,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-15 05:58:20,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-15 05:58:20,061 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-15 05:58:20,061 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-15 05:58:20,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-15 05:58:20,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-15 05:58:20,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-15 05:58:20,062 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-15 05:58:20,062 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-15 05:58:20,063 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-15 05:58:20,063 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-15 05:58:20,063 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-15 05:58:20,064 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-15 05:58:20,064 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-15 05:58:20,064 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-15 05:58:20,065 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-15 05:58:20,065 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-15 05:58:20,065 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-15 05:58:20,065 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-15 05:58:20,066 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-15 05:58:20,066 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-15 05:58:20,066 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-15 05:58:20,067 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-15 05:58:20,067 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-15 05:58:20,067 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-15 05:58:20,068 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-15 05:58:20,068 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-15 05:58:20,068 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-15 05:58:20,069 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-15 05:58:20,069 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-15 05:58:20,069 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-15 05:58:20,070 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-15 05:58:20,070 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-15 05:58:20,070 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-15 05:58:20,071 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-15 05:58:20,071 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-15 05:58:20,071 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-15 05:58:20,072 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-15 05:58:20,072 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-15 05:58:20,072 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-15 05:58:20,073 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-15 05:58:20,073 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-15 05:58:20,073 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-15 05:58:20,074 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-15 05:58:20,074 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-15 05:58:20,074 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-15 05:58:20,075 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-15 05:58:20,075 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-15 05:58:20,075 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-15 05:58:20,076 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-15 05:58:20,076 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-15 05:58:20,076 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-15 05:58:20,077 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-15 05:58:20,077 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-15 05:58:20,077 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-15 05:58:20,078 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-15 05:58:20,078 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-15 05:58:20,078 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-15 05:58:20,079 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-15 05:58:20,079 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-15 05:58:20,079 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-15 05:58:20,080 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-15 05:58:20,080 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-15 05:58:20,080 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-15 05:58:20,081 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-15 05:58:20,081 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-15 05:58:20,081 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-15 05:58:20,082 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-15 05:58:20,082 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-15 05:58:20,082 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-15 05:58:20,083 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-15 05:58:20,083 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-15 05:58:20,083 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-15 05:58:20,084 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-15 05:58:20,084 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-15 05:58:20,084 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-15 05:58:20,085 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-15 05:58:20,085 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-15 05:58:20,085 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-15 05:58:20,086 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-15 05:58:20,086 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-15 05:58:20,086 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-15 05:58:20,087 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-15 05:58:20,087 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-15 05:58:20,087 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-15 05:58:20,088 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-15 05:58:20,088 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-15 05:58:20,088 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-15 05:58:20,089 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-15 05:58:20,089 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-15 05:58:20,089 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-15 05:58:20,090 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-15 05:58:20,090 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-15 05:58:20,090 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-15 05:58:20,091 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-15 05:58:20,091 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-15 05:58:20,091 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-15 05:58:20,092 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-15 05:58:20,092 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-15 05:58:20,092 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-15 05:58:20,092 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-15 05:58:20,093 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-15 05:58:20,093 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-15 05:58:20,093 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-15 05:58:20,094 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-15 05:58:20,094 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-15 05:58:20,094 INFO L290 TraceCheckUtils]: 104: Hoare triple {42279#(<= main_~i~0 49)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-15 05:58:20,095 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-15 05:58:20,095 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-15 05:58:20,095 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-15 05:58:20,095 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-15 05:58:20,095 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-15 05:58:20,095 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-15 05:58:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339199558] [2022-04-15 05:58:20,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339199558] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304658570] [2022-04-15 05:58:20,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:58:20,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:20,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:20,097 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-15 05:58:20,098 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-15 05:58:20,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:58:20,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:20,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 05:58:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:20,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:21,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {42225#true} call ULTIMATE.init(); {42225#true} is VALID [2022-04-15 05:58:21,089 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-15 05:58:21,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-15 05:58:21,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-15 05:58:21,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-15 05:58:21,090 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-15 05:58:21,090 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-15 05:58:21,090 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-15 05:58:21,091 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-15 05:58:21,091 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-15 05:58:21,091 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-15 05:58:21,092 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-15 05:58:21,092 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-15 05:58:21,092 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-15 05:58:21,093 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-15 05:58:21,093 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-15 05:58:21,093 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-15 05:58:21,094 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-15 05:58:21,094 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-15 05:58:21,094 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-15 05:58:21,095 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-15 05:58:21,095 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-15 05:58:21,095 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-15 05:58:21,096 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-15 05:58:21,096 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-15 05:58:21,096 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-15 05:58:21,097 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-15 05:58:21,097 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-15 05:58:21,097 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-15 05:58:21,098 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-15 05:58:21,098 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-15 05:58:21,098 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-15 05:58:21,099 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-15 05:58:21,099 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-15 05:58:21,099 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-15 05:58:21,100 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-15 05:58:21,100 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-15 05:58:21,100 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-15 05:58:21,100 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-15 05:58:21,101 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-15 05:58:21,101 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-15 05:58:21,102 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-15 05:58:21,102 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-15 05:58:21,102 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-15 05:58:21,102 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-15 05:58:21,103 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-15 05:58:21,103 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-15 05:58:21,103 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-15 05:58:21,104 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-15 05:58:21,104 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-15 05:58:21,104 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-15 05:58:21,105 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-15 05:58:21,105 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-15 05:58:21,105 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-15 05:58:21,106 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-15 05:58:21,106 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-15 05:58:21,106 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-15 05:58:21,107 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-15 05:58:21,107 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-15 05:58:21,107 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-15 05:58:21,108 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-15 05:58:21,108 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-15 05:58:21,108 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-15 05:58:21,109 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-15 05:58:21,109 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-15 05:58:21,109 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-15 05:58:21,110 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-15 05:58:21,110 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-15 05:58:21,110 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-15 05:58:21,111 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-15 05:58:21,111 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-15 05:58:21,111 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-15 05:58:21,112 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-15 05:58:21,112 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-15 05:58:21,112 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-15 05:58:21,113 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-15 05:58:21,113 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-15 05:58:21,113 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-15 05:58:21,114 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-15 05:58:21,114 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-15 05:58:21,114 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-15 05:58:21,115 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-15 05:58:21,115 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-15 05:58:21,115 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-15 05:58:21,116 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-15 05:58:21,116 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-15 05:58:21,116 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-15 05:58:21,117 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-15 05:58:21,117 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-15 05:58:21,117 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-15 05:58:21,118 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-15 05:58:21,118 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-15 05:58:21,118 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-15 05:58:21,119 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-15 05:58:21,119 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-15 05:58:21,119 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-15 05:58:21,119 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-15 05:58:21,120 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-15 05:58:21,120 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-15 05:58:21,121 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-15 05:58:21,121 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-15 05:58:21,121 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-15 05:58:21,121 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-15 05:58:21,122 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-15 05:58:21,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {42279#(<= main_~i~0 49)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-15 05:58:21,122 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-15 05:58:21,122 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-15 05:58:21,122 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-15 05:58:21,122 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-15 05:58:21,123 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-15 05:58:21,123 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-15 05:58:21,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:24,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {42226#false} assume !false; {42226#false} is VALID [2022-04-15 05:58:24,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {42226#false} assume 0 == ~cond; {42226#false} is VALID [2022-04-15 05:58:24,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {42226#false} ~cond := #in~cond; {42226#false} is VALID [2022-04-15 05:58:24,085 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-15 05:58:24,085 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-15 05:58:24,086 INFO L290 TraceCheckUtils]: 104: Hoare triple {42627#(< main_~i~0 2048)} assume !(~i~0 < 2048); {42226#false} is VALID [2022-04-15 05:58:24,086 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-15 05:58:24,086 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-15 05:58:24,087 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-15 05:58:24,087 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-15 05:58:24,087 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-15 05:58:24,088 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-15 05:58:24,088 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-15 05:58:24,088 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-15 05:58:24,089 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-15 05:58:24,089 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-15 05:58:24,089 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-15 05:58:24,090 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-15 05:58:24,090 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-15 05:58:24,090 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-15 05:58:24,091 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-15 05:58:24,091 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-15 05:58:24,091 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-15 05:58:24,092 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-15 05:58:24,092 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-15 05:58:24,092 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-15 05:58:24,093 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-15 05:58:24,093 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-15 05:58:24,093 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-15 05:58:24,094 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-15 05:58:24,094 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-15 05:58:24,094 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-15 05:58:24,095 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-15 05:58:24,095 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-15 05:58:24,095 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-15 05:58:24,096 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-15 05:58:24,096 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-15 05:58:24,096 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-15 05:58:24,097 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-15 05:58:24,097 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-15 05:58:24,097 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-15 05:58:24,098 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-15 05:58:24,098 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-15 05:58:24,098 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-15 05:58:24,099 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-15 05:58:24,099 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-15 05:58:24,099 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-15 05:58:24,100 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-15 05:58:24,100 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-15 05:58:24,100 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-15 05:58:24,101 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-15 05:58:24,101 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-15 05:58:24,102 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-15 05:58:24,102 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-15 05:58:24,102 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-15 05:58:24,102 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-15 05:58:24,103 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-15 05:58:24,103 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-15 05:58:24,104 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-15 05:58:24,104 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-15 05:58:24,104 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-15 05:58:24,104 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-15 05:58:24,105 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-15 05:58:24,105 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-15 05:58:24,106 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-15 05:58:24,106 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-15 05:58:24,106 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-15 05:58:24,107 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-15 05:58:24,107 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-15 05:58:24,107 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-15 05:58:24,108 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-15 05:58:24,108 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-15 05:58:24,108 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-15 05:58:24,109 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-15 05:58:24,109 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-15 05:58:24,109 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-15 05:58:24,110 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-15 05:58:24,110 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-15 05:58:24,110 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-15 05:58:24,111 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-15 05:58:24,111 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-15 05:58:24,111 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-15 05:58:24,112 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-15 05:58:24,112 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-15 05:58:24,112 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-15 05:58:24,113 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-15 05:58:24,113 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-15 05:58:24,113 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-15 05:58:24,114 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-15 05:58:24,114 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-15 05:58:24,114 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-15 05:58:24,115 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-15 05:58:24,115 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-15 05:58:24,115 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-15 05:58:24,116 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-15 05:58:24,116 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-15 05:58:24,116 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-15 05:58:24,117 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-15 05:58:24,117 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-15 05:58:24,117 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-15 05:58:24,118 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-15 05:58:24,118 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-15 05:58:24,118 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-15 05:58:24,119 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-15 05:58:24,119 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-15 05:58:24,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {42225#true} call #t~ret5 := main(); {42225#true} is VALID [2022-04-15 05:58:24,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42225#true} {42225#true} #44#return; {42225#true} is VALID [2022-04-15 05:58:24,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {42225#true} assume true; {42225#true} is VALID [2022-04-15 05:58:24,119 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-15 05:58:24,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {42225#true} call ULTIMATE.init(); {42225#true} is VALID [2022-04-15 05:58:24,120 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-15 05:58:24,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304658570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:24,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:24,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 05:58:24,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:24,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219368829] [2022-04-15 05:58:24,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219368829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:24,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 05:58:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059098810] [2022-04-15 05:58:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:24,122 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-15 05:58:24,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:24,122 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-15 05:58:24,200 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-15 05:58:24,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 05:58:24,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:24,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 05:58:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 05:58:24,202 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-15 05:58:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,141 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-15 05:58:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 05:58:26,142 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-15 05:58:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:26,142 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-15 05:58:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-15 05:58:26,143 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-15 05:58:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2022-04-15 05:58:26,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 120 transitions. [2022-04-15 05:58:26,238 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-15 05:58:26,239 INFO L225 Difference]: With dead ends: 120 [2022-04-15 05:58:26,239 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 05:58:26,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 05:58:26,240 INFO L913 BasicCegarLoop]: 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-15 05:58:26,241 INFO L914 BasicCegarLoop]: 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-15 05:58:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 05:58:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-04-15 05:58:26,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:26,804 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-15 05:58:26,804 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-15 05:58:26,805 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-15 05:58:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,805 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:58:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-15 05:58:26,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:26,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:26,806 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-15 05:58:26,806 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-15 05:58:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,807 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-15 05:58:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-04-15 05:58:26,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:26,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:26,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:26,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:26,807 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-15 05:58:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2022-04-15 05:58:26,808 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2022-04-15 05:58:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:26,808 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2022-04-15 05:58:26,809 INFO L479 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-15 05:58:26,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 113 transitions. [2022-04-15 05:58:26,941 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-15 05:58:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-15 05:58:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 05:58:26,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:26,942 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:26,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:27,142 WARN L460 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-15 05:58:27,142 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 757682270, now seen corresponding path program 99 times [2022-04-15 05:58:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:27,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958210147] [2022-04-15 05:58:27,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:27,145 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:27,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 757682270, now seen corresponding path program 100 times [2022-04-15 05:58:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:27,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595817779] [2022-04-15 05:58:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,170 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-15 05:58:28,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-15 05:58:28,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-15 05:58:28,170 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-15 05:58:28,171 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-15 05:58:28,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-15 05:58:28,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-15 05:58:28,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-15 05:58:28,171 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-15 05:58:28,171 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-15 05:58:28,172 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-15 05:58:28,172 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-15 05:58:28,172 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-15 05:58:28,173 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-15 05:58:28,173 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-15 05:58:28,173 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-15 05:58:28,174 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-15 05:58:28,174 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-15 05:58:28,174 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-15 05:58:28,175 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-15 05:58:28,175 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-15 05:58:28,175 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-15 05:58:28,176 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-15 05:58:28,176 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-15 05:58:28,176 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-15 05:58:28,177 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-15 05:58:28,177 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-15 05:58:28,177 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-15 05:58:28,178 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-15 05:58:28,178 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-15 05:58:28,178 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-15 05:58:28,179 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-15 05:58:28,179 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-15 05:58:28,179 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-15 05:58:28,180 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-15 05:58:28,180 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-15 05:58:28,180 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-15 05:58:28,181 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-15 05:58:28,181 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-15 05:58:28,181 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-15 05:58:28,182 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-15 05:58:28,182 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-15 05:58:28,182 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-15 05:58:28,183 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-15 05:58:28,183 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-15 05:58:28,183 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-15 05:58:28,184 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-15 05:58:28,184 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-15 05:58:28,184 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-15 05:58:28,185 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-15 05:58:28,185 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-15 05:58:28,185 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-15 05:58:28,186 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-15 05:58:28,186 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-15 05:58:28,186 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-15 05:58:28,187 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-15 05:58:28,187 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-15 05:58:28,187 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-15 05:58:28,188 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-15 05:58:28,188 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-15 05:58:28,188 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-15 05:58:28,189 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-15 05:58:28,189 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-15 05:58:28,189 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-15 05:58:28,190 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-15 05:58:28,190 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-15 05:58:28,190 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-15 05:58:28,190 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-15 05:58:28,191 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-15 05:58:28,191 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-15 05:58:28,192 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-15 05:58:28,192 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-15 05:58:28,192 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-15 05:58:28,192 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-15 05:58:28,193 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-15 05:58:28,193 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-15 05:58:28,193 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-15 05:58:28,194 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-15 05:58:28,194 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-15 05:58:28,194 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-15 05:58:28,195 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-15 05:58:28,195 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-15 05:58:28,195 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-15 05:58:28,196 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-15 05:58:28,196 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-15 05:58:28,196 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-15 05:58:28,197 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-15 05:58:28,197 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-15 05:58:28,197 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-15 05:58:28,198 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-15 05:58:28,198 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-15 05:58:28,198 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-15 05:58:28,199 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-15 05:58:28,199 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-15 05:58:28,199 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-15 05:58:28,200 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-15 05:58:28,200 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-15 05:58:28,200 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-15 05:58:28,201 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-15 05:58:28,201 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-15 05:58:28,201 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-15 05:58:28,202 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-15 05:58:28,202 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-15 05:58:28,202 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-15 05:58:28,203 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-15 05:58:28,203 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-15 05:58:28,203 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-15 05:58:28,204 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-15 05:58:28,204 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-15 05:58:28,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {43840#(<= main_~i~0 50)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-15 05:58:28,204 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-15 05:58:28,204 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-15 05:58:28,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-15 05:58:28,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-15 05:58:28,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-15 05:58:28,205 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-15 05:58:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:28,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595817779] [2022-04-15 05:58:28,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595817779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:28,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731279769] [2022-04-15 05:58:28,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:28,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:28,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:28,207 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-15 05:58:28,208 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-15 05:58:28,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:28,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:28,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 05:58:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:29,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {43785#true} call ULTIMATE.init(); {43785#true} is VALID [2022-04-15 05:58:29,238 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-15 05:58:29,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-15 05:58:29,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-15 05:58:29,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-15 05:58:29,238 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-15 05:58:29,239 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-15 05:58:29,239 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-15 05:58:29,240 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-15 05:58:29,240 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-15 05:58:29,240 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-15 05:58:29,241 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-15 05:58:29,241 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-15 05:58:29,241 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-15 05:58:29,242 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-15 05:58:29,242 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-15 05:58:29,242 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-15 05:58:29,243 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-15 05:58:29,243 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-15 05:58:29,243 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-15 05:58:29,244 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-15 05:58:29,244 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-15 05:58:29,244 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-15 05:58:29,245 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-15 05:58:29,245 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-15 05:58:29,245 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-15 05:58:29,246 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-15 05:58:29,246 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-15 05:58:29,246 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-15 05:58:29,247 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-15 05:58:29,247 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-15 05:58:29,247 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-15 05:58:29,248 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-15 05:58:29,248 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-15 05:58:29,248 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-15 05:58:29,249 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-15 05:58:29,249 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-15 05:58:29,249 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-15 05:58:29,250 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-15 05:58:29,250 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-15 05:58:29,250 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-15 05:58:29,251 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-15 05:58:29,251 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-15 05:58:29,251 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-15 05:58:29,252 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-15 05:58:29,252 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-15 05:58:29,252 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-15 05:58:29,253 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-15 05:58:29,253 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-15 05:58:29,253 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-15 05:58:29,254 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-15 05:58:29,254 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-15 05:58:29,254 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-15 05:58:29,255 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-15 05:58:29,255 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-15 05:58:29,255 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-15 05:58:29,256 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-15 05:58:29,256 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-15 05:58:29,256 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-15 05:58:29,257 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-15 05:58:29,257 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-15 05:58:29,257 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-15 05:58:29,258 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-15 05:58:29,258 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-15 05:58:29,258 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-15 05:58:29,259 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-15 05:58:29,259 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-15 05:58:29,259 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-15 05:58:29,260 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-15 05:58:29,260 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-15 05:58:29,260 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-15 05:58:29,261 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-15 05:58:29,261 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-15 05:58:29,261 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-15 05:58:29,262 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-15 05:58:29,262 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-15 05:58:29,262 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-15 05:58:29,263 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-15 05:58:29,263 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-15 05:58:29,263 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-15 05:58:29,264 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-15 05:58:29,264 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-15 05:58:29,264 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-15 05:58:29,265 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-15 05:58:29,265 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-15 05:58:29,265 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-15 05:58:29,266 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-15 05:58:29,266 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-15 05:58:29,266 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-15 05:58:29,267 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-15 05:58:29,267 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-15 05:58:29,267 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-15 05:58:29,268 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-15 05:58:29,268 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-15 05:58:29,268 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-15 05:58:29,269 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-15 05:58:29,269 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-15 05:58:29,269 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-15 05:58:29,270 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-15 05:58:29,270 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-15 05:58:29,270 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-15 05:58:29,271 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-15 05:58:29,271 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-15 05:58:29,271 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-15 05:58:29,272 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-15 05:58:29,272 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-15 05:58:29,272 INFO L290 TraceCheckUtils]: 106: Hoare triple {43840#(<= main_~i~0 50)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-15 05:58:29,272 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-15 05:58:29,273 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-15 05:58:29,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-15 05:58:29,273 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-15 05:58:29,273 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-15 05:58:29,273 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-15 05:58:29,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:32,350 INFO L290 TraceCheckUtils]: 111: Hoare triple {43786#false} assume !false; {43786#false} is VALID [2022-04-15 05:58:32,351 INFO L290 TraceCheckUtils]: 110: Hoare triple {43786#false} assume 0 == ~cond; {43786#false} is VALID [2022-04-15 05:58:32,351 INFO L290 TraceCheckUtils]: 109: Hoare triple {43786#false} ~cond := #in~cond; {43786#false} is VALID [2022-04-15 05:58:32,351 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-15 05:58:32,351 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-15 05:58:32,351 INFO L290 TraceCheckUtils]: 106: Hoare triple {44194#(< main_~i~0 2048)} assume !(~i~0 < 2048); {43786#false} is VALID [2022-04-15 05:58:32,352 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-15 05:58:32,352 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-15 05:58:32,352 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-15 05:58:32,353 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-15 05:58:32,353 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-15 05:58:32,353 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-15 05:58:32,354 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-15 05:58:32,354 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-15 05:58:32,354 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-15 05:58:32,355 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-15 05:58:32,355 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-15 05:58:32,355 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-15 05:58:32,356 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-15 05:58:32,356 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-15 05:58:32,356 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-15 05:58:32,357 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-15 05:58:32,357 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-15 05:58:32,357 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-15 05:58:32,358 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-15 05:58:32,358 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-15 05:58:32,358 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-15 05:58:32,358 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-15 05:58:32,359 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-15 05:58:32,359 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-15 05:58:32,360 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-15 05:58:32,360 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-15 05:58:32,360 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-15 05:58:32,360 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-15 05:58:32,361 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-15 05:58:32,361 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-15 05:58:32,362 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-15 05:58:32,362 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-15 05:58:32,362 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-15 05:58:32,362 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-15 05:58:32,363 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-15 05:58:32,363 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-15 05:58:32,364 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-15 05:58:32,364 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-15 05:58:32,364 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-15 05:58:32,364 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-15 05:58:32,365 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-15 05:58:32,365 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-15 05:58:32,366 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-15 05:58:32,366 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-15 05:58:32,366 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-15 05:58:32,366 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-15 05:58:32,367 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-15 05:58:32,367 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-15 05:58:32,367 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-15 05:58:32,368 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-15 05:58:32,368 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-15 05:58:32,368 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-15 05:58:32,369 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-15 05:58:32,369 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-15 05:58:32,369 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-15 05:58:32,370 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-15 05:58:32,370 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-15 05:58:32,370 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-15 05:58:32,371 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-15 05:58:32,371 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-15 05:58:32,371 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-15 05:58:32,372 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-15 05:58:32,372 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-15 05:58:32,372 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-15 05:58:32,373 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-15 05:58:32,373 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-15 05:58:32,373 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-15 05:58:32,374 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-15 05:58:32,374 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-15 05:58:32,374 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-15 05:58:32,375 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-15 05:58:32,375 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-15 05:58:32,375 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-15 05:58:32,376 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-15 05:58:32,376 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-15 05:58:32,376 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-15 05:58:32,377 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-15 05:58:32,377 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-15 05:58:32,377 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-15 05:58:32,378 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-15 05:58:32,378 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-15 05:58:32,378 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-15 05:58:32,379 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-15 05:58:32,379 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-15 05:58:32,379 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-15 05:58:32,380 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-15 05:58:32,380 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-15 05:58:32,380 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-15 05:58:32,381 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-15 05:58:32,381 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-15 05:58:32,381 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-15 05:58:32,382 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-15 05:58:32,382 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-15 05:58:32,382 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-15 05:58:32,383 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-15 05:58:32,383 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-15 05:58:32,383 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-15 05:58:32,384 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-15 05:58:32,384 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-15 05:58:32,384 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-15 05:58:32,385 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-15 05:58:32,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {43785#true} call #t~ret5 := main(); {43785#true} is VALID [2022-04-15 05:58:32,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43785#true} {43785#true} #44#return; {43785#true} is VALID [2022-04-15 05:58:32,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {43785#true} assume true; {43785#true} is VALID [2022-04-15 05:58:32,385 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-15 05:58:32,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {43785#true} call ULTIMATE.init(); {43785#true} is VALID [2022-04-15 05:58:32,386 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-15 05:58:32,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731279769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:32,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:32,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-15 05:58:32,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:32,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958210147] [2022-04-15 05:58:32,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958210147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:32,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:32,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 05:58:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410607764] [2022-04-15 05:58:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:32,387 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-15 05:58:32,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:32,388 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-15 05:58:32,459 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-15 05:58:32,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 05:58:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 05:58:32,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 05:58:32,461 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-15 05:58:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:34,429 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-15 05:58:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 05:58:34,429 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-15 05:58:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:34,429 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-15 05:58:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-15 05:58:34,430 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-15 05:58:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-15 05:58:34,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 122 transitions. [2022-04-15 05:58:34,520 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-15 05:58:34,521 INFO L225 Difference]: With dead ends: 122 [2022-04-15 05:58:34,521 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 05:58:34,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10818, Invalid=13674, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 05:58:34,523 INFO L913 BasicCegarLoop]: 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-15 05:58:34,523 INFO L914 BasicCegarLoop]: 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-15 05:58:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 05:58:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-04-15 05:58:35,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:35,106 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-15 05:58:35,106 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-15 05:58:35,106 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-15 05:58:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:35,107 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:58:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-15 05:58:35,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:35,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:35,108 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-15 05:58:35,108 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-15 05:58:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:35,109 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-15 05:58:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-04-15 05:58:35,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:35,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:35,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:35,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:35,109 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-15 05:58:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2022-04-15 05:58:35,110 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2022-04-15 05:58:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:35,110 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2022-04-15 05:58:35,111 INFO L479 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-15 05:58:35,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 115 transitions. [2022-04-15 05:58:35,246 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-15 05:58:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2022-04-15 05:58:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 05:58:35,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:35,247 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:35,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:35,447 WARN L460 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-15 05:58:35,447 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1409101056, now seen corresponding path program 101 times [2022-04-15 05:58:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:35,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943746421] [2022-04-15 05:58:35,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:35,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:35,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1409101056, now seen corresponding path program 102 times [2022-04-15 05:58:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:35,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574525129] [2022-04-15 05:58:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:35,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:36,480 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-15 05:58:36,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-15 05:58:36,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-15 05:58:36,480 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-15 05:58:36,481 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-15 05:58:36,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-15 05:58:36,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-15 05:58:36,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-15 05:58:36,481 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-15 05:58:36,481 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-15 05:58:36,482 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-15 05:58:36,482 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-15 05:58:36,482 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-15 05:58:36,483 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-15 05:58:36,483 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-15 05:58:36,483 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-15 05:58:36,484 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-15 05:58:36,484 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-15 05:58:36,484 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-15 05:58:36,485 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-15 05:58:36,485 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-15 05:58:36,485 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-15 05:58:36,486 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-15 05:58:36,486 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-15 05:58:36,486 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-15 05:58:36,487 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-15 05:58:36,487 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-15 05:58:36,487 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-15 05:58:36,488 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-15 05:58:36,488 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-15 05:58:36,488 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-15 05:58:36,489 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-15 05:58:36,489 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-15 05:58:36,489 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-15 05:58:36,490 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-15 05:58:36,490 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-15 05:58:36,490 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-15 05:58:36,491 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-15 05:58:36,491 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-15 05:58:36,491 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-15 05:58:36,492 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-15 05:58:36,492 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-15 05:58:36,492 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-15 05:58:36,493 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-15 05:58:36,493 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-15 05:58:36,493 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-15 05:58:36,494 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-15 05:58:36,494 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-15 05:58:36,494 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-15 05:58:36,494 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-15 05:58:36,495 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-15 05:58:36,495 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-15 05:58:36,495 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-15 05:58:36,496 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-15 05:58:36,496 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-15 05:58:36,496 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-15 05:58:36,497 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-15 05:58:36,497 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-15 05:58:36,497 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-15 05:58:36,498 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-15 05:58:36,498 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-15 05:58:36,498 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-15 05:58:36,499 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-15 05:58:36,499 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-15 05:58:36,499 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-15 05:58:36,500 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-15 05:58:36,500 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-15 05:58:36,500 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-15 05:58:36,501 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-15 05:58:36,501 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-15 05:58:36,501 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-15 05:58:36,502 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-15 05:58:36,502 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-15 05:58:36,502 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-15 05:58:36,503 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-15 05:58:36,503 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-15 05:58:36,503 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-15 05:58:36,504 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-15 05:58:36,504 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-15 05:58:36,504 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-15 05:58:36,505 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-15 05:58:36,505 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-15 05:58:36,505 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-15 05:58:36,506 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-15 05:58:36,506 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-15 05:58:36,506 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-15 05:58:36,507 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-15 05:58:36,507 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-15 05:58:36,507 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-15 05:58:36,507 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-15 05:58:36,508 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-15 05:58:36,508 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-15 05:58:36,509 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-15 05:58:36,509 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-15 05:58:36,509 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-15 05:58:36,509 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-15 05:58:36,510 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-15 05:58:36,510 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-15 05:58:36,510 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-15 05:58:36,511 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-15 05:58:36,511 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-15 05:58:36,511 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-15 05:58:36,512 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-15 05:58:36,512 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-15 05:58:36,512 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-15 05:58:36,513 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-15 05:58:36,513 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-15 05:58:36,513 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-15 05:58:36,514 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-15 05:58:36,514 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-15 05:58:36,514 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-15 05:58:36,515 INFO L290 TraceCheckUtils]: 108: Hoare triple {45429#(<= main_~i~0 51)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-15 05:58:36,515 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-15 05:58:36,515 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-15 05:58:36,515 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-15 05:58:36,515 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-15 05:58:36,515 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-15 05:58:36,515 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-15 05:58:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:36,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574525129] [2022-04-15 05:58:36,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574525129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:36,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395647462] [2022-04-15 05:58:36,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:36,517 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-15 05:58:36,518 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-15 05:59:40,014 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2022-04-15 05:59:40,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:40,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 05:59:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:40,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:40,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {45373#true} call ULTIMATE.init(); {45373#true} is VALID [2022-04-15 05:59:40,786 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-15 05:59:40,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-15 05:59:40,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-15 05:59:40,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-15 05:59:40,786 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-15 05:59:40,787 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-15 05:59:40,787 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-15 05:59:40,787 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-15 05:59:40,788 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-15 05:59:40,788 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-15 05:59:40,788 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-15 05:59:40,789 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-15 05:59:40,789 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-15 05:59:40,789 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-15 05:59:40,790 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-15 05:59:40,790 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-15 05:59:40,790 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-15 05:59:40,791 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-15 05:59:40,791 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-15 05:59:40,791 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-15 05:59:40,792 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-15 05:59:40,792 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-15 05:59:40,792 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-15 05:59:40,793 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-15 05:59:40,793 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-15 05:59:40,793 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-15 05:59:40,794 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-15 05:59:40,807 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-15 05:59:40,807 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-15 05:59:40,807 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-15 05:59:40,808 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-15 05:59:40,808 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-15 05:59:40,809 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-15 05:59:40,809 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-15 05:59:40,809 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-15 05:59:40,809 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-15 05:59:40,810 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-15 05:59:40,810 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-15 05:59:40,811 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-15 05:59:40,811 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-15 05:59:40,811 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-15 05:59:40,811 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-15 05:59:40,812 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-15 05:59:40,812 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-15 05:59:40,813 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-15 05:59:40,813 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-15 05:59:40,813 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-15 05:59:40,813 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-15 05:59:40,814 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-15 05:59:40,814 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-15 05:59:40,815 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-15 05:59:40,815 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-15 05:59:40,815 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-15 05:59:40,816 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-15 05:59:40,816 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-15 05:59:40,816 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-15 05:59:40,817 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-15 05:59:40,817 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-15 05:59:40,817 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-15 05:59:40,817 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-15 05:59:40,818 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-15 05:59:40,818 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-15 05:59:40,819 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-15 05:59:40,819 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-15 05:59:40,819 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-15 05:59:40,819 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-15 05:59:40,820 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-15 05:59:40,820 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-15 05:59:40,821 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-15 05:59:40,821 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-15 05:59:40,821 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-15 05:59:40,821 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-15 05:59:40,822 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-15 05:59:40,822 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-15 05:59:40,823 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-15 05:59:40,823 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-15 05:59:40,823 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-15 05:59:40,823 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-15 05:59:40,824 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-15 05:59:40,824 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-15 05:59:40,825 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-15 05:59:40,825 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-15 05:59:40,825 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-15 05:59:40,825 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-15 05:59:40,826 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-15 05:59:40,826 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-15 05:59:40,826 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-15 05:59:40,827 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-15 05:59:40,827 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-15 05:59:40,827 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-15 05:59:40,828 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-15 05:59:40,828 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-15 05:59:40,828 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-15 05:59:40,829 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-15 05:59:40,829 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-15 05:59:40,829 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-15 05:59:40,830 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-15 05:59:40,830 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-15 05:59:40,830 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-15 05:59:40,831 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-15 05:59:40,831 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-15 05:59:40,831 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-15 05:59:40,832 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-15 05:59:40,832 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-15 05:59:40,832 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-15 05:59:40,833 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-15 05:59:40,833 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-15 05:59:40,833 INFO L290 TraceCheckUtils]: 108: Hoare triple {45429#(<= main_~i~0 51)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-15 05:59:40,833 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-15 05:59:40,834 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-15 05:59:40,834 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-15 05:59:40,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-15 05:59:40,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-15 05:59:40,834 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-15 05:59:40,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:44,032 INFO L290 TraceCheckUtils]: 113: Hoare triple {45374#false} assume !false; {45374#false} is VALID [2022-04-15 05:59:44,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {45374#false} assume 0 == ~cond; {45374#false} is VALID [2022-04-15 05:59:44,033 INFO L290 TraceCheckUtils]: 111: Hoare triple {45374#false} ~cond := #in~cond; {45374#false} is VALID [2022-04-15 05:59:44,033 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-15 05:59:44,033 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-15 05:59:44,033 INFO L290 TraceCheckUtils]: 108: Hoare triple {45789#(< main_~i~0 2048)} assume !(~i~0 < 2048); {45374#false} is VALID [2022-04-15 05:59:44,034 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-15 05:59:44,034 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-15 05:59:44,034 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-15 05:59:44,035 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-15 05:59:44,035 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-15 05:59:44,035 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-15 05:59:44,036 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-15 05:59:44,036 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-15 05:59:44,036 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-15 05:59:44,037 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-15 05:59:44,037 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-15 05:59:44,037 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-15 05:59:44,038 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-15 05:59:44,038 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-15 05:59:44,038 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-15 05:59:44,039 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-15 05:59:44,039 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-15 05:59:44,039 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-15 05:59:44,040 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-15 05:59:44,040 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-15 05:59:44,040 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-15 05:59:44,041 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-15 05:59:44,041 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-15 05:59:44,041 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-15 05:59:44,042 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-15 05:59:44,042 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-15 05:59:44,042 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-15 05:59:44,043 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-15 05:59:44,043 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-15 05:59:44,043 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-15 05:59:44,044 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-15 05:59:44,044 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-15 05:59:44,044 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-15 05:59:44,045 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-15 05:59:44,045 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-15 05:59:44,045 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-15 05:59:44,046 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-15 05:59:44,046 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-15 05:59:44,046 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-15 05:59:44,047 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-15 05:59:44,047 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-15 05:59:44,047 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-15 05:59:44,048 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-15 05:59:44,048 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-15 05:59:44,048 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-15 05:59:44,049 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-15 05:59:44,049 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-15 05:59:44,049 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-15 05:59:44,050 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-15 05:59:44,050 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-15 05:59:44,050 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-15 05:59:44,051 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-15 05:59:44,051 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-15 05:59:44,051 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-15 05:59:44,052 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-15 05:59:44,052 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-15 05:59:44,052 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-15 05:59:44,053 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-15 05:59:44,053 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-15 05:59:44,053 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-15 05:59:44,054 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-15 05:59:44,054 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-15 05:59:44,054 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-15 05:59:44,055 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-15 05:59:44,055 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-15 05:59:44,055 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-15 05:59:44,056 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-15 05:59:44,056 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-15 05:59:44,056 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-15 05:59:44,057 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-15 05:59:44,057 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-15 05:59:44,057 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-15 05:59:44,058 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-15 05:59:44,058 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-15 05:59:44,058 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-15 05:59:44,059 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-15 05:59:44,059 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-15 05:59:44,059 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-15 05:59:44,060 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-15 05:59:44,060 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-15 05:59:44,060 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-15 05:59:44,061 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-15 05:59:44,061 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-15 05:59:44,061 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-15 05:59:44,062 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-15 05:59:44,062 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-15 05:59:44,062 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-15 05:59:44,063 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-15 05:59:44,063 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-15 05:59:44,063 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-15 05:59:44,064 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-15 05:59:44,064 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-15 05:59:44,064 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-15 05:59:44,065 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-15 05:59:44,065 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-15 05:59:44,065 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-15 05:59:44,066 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-15 05:59:44,066 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-15 05:59:44,066 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-15 05:59:44,067 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-15 05:59:44,067 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-15 05:59:44,067 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-15 05:59:44,068 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-15 05:59:44,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {45373#true} call #t~ret5 := main(); {45373#true} is VALID [2022-04-15 05:59:44,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45373#true} {45373#true} #44#return; {45373#true} is VALID [2022-04-15 05:59:44,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {45373#true} assume true; {45373#true} is VALID [2022-04-15 05:59:44,068 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-15 05:59:44,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {45373#true} call ULTIMATE.init(); {45373#true} is VALID [2022-04-15 05:59:44,069 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-15 05:59:44,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395647462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:44,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:44,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-15 05:59:44,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:44,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1943746421] [2022-04-15 05:59:44,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1943746421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:44,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:44,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 05:59:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917141476] [2022-04-15 05:59:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:44,070 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-15 05:59:44,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:44,070 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-15 05:59:44,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:44,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 05:59:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 05:59:44,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 05:59:44,145 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-15 05:59:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,198 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-15 05:59:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 05:59:46,198 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-15 05:59:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:46,199 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-15 05:59:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 124 transitions. [2022-04-15 05:59:46,199 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-15 05:59:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 124 transitions. [2022-04-15 05:59:46,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 124 transitions. [2022-04-15 05:59:46,292 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-15 05:59:46,293 INFO L225 Difference]: With dead ends: 124 [2022-04-15 05:59:46,293 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 05:59:46,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 05:59:46,294 INFO L913 BasicCegarLoop]: 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-15 05:59:46,295 INFO L914 BasicCegarLoop]: 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-15 05:59:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 05:59:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-04-15 05:59:46,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:46,901 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-15 05:59:46,901 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-15 05:59:46,901 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-15 05:59:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,902 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-15 05:59:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2022-04-15 05:59:46,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:46,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:46,902 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-15 05:59:46,902 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-15 05:59:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,903 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-15 05:59:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2022-04-15 05:59:46,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:46,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:46,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:46,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:46,904 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-15 05:59:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2022-04-15 05:59:46,904 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2022-04-15 05:59:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:46,905 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2022-04-15 05:59:46,905 INFO L479 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-15 05:59:46,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 117 transitions. [2022-04-15 05:59:47,043 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-15 05:59:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2022-04-15 05:59:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 05:59:47,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:47,043 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:47,079 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-15 05:59:47,244 WARN L460 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-15 05:59:47,244 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash 357329186, now seen corresponding path program 103 times [2022-04-15 05:59:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:47,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203299110] [2022-04-15 05:59:47,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:47,251 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:47,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash 357329186, now seen corresponding path program 104 times [2022-04-15 05:59:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411661172] [2022-04-15 05:59:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,381 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-15 05:59:48,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-15 05:59:48,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-15 05:59:48,382 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-15 05:59:48,382 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-15 05:59:48,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-15 05:59:48,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-15 05:59:48,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-15 05:59:48,382 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-15 05:59:48,383 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-15 05:59:48,383 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-15 05:59:48,383 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-15 05:59:48,384 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-15 05:59:48,384 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-15 05:59:48,384 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-15 05:59:48,385 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-15 05:59:48,385 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-15 05:59:48,385 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-15 05:59:48,386 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-15 05:59:48,386 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-15 05:59:48,386 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-15 05:59:48,387 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-15 05:59:48,387 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-15 05:59:48,387 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-15 05:59:48,388 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-15 05:59:48,388 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-15 05:59:48,388 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-15 05:59:48,388 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-15 05:59:48,389 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-15 05:59:48,389 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-15 05:59:48,390 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-15 05:59:48,390 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-15 05:59:48,390 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-15 05:59:48,390 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-15 05:59:48,391 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-15 05:59:48,391 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-15 05:59:48,391 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-15 05:59:48,392 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-15 05:59:48,392 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-15 05:59:48,392 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-15 05:59:48,393 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-15 05:59:48,393 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-15 05:59:48,393 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-15 05:59:48,394 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-15 05:59:48,394 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-15 05:59:48,394 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-15 05:59:48,395 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-15 05:59:48,395 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-15 05:59:48,395 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-15 05:59:48,396 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-15 05:59:48,396 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-15 05:59:48,396 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-15 05:59:48,397 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-15 05:59:48,397 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-15 05:59:48,397 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-15 05:59:48,398 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-15 05:59:48,398 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-15 05:59:48,398 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-15 05:59:48,399 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-15 05:59:48,399 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-15 05:59:48,399 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-15 05:59:48,400 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-15 05:59:48,400 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-15 05:59:48,400 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-15 05:59:48,401 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-15 05:59:48,401 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-15 05:59:48,401 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-15 05:59:48,402 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-15 05:59:48,402 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-15 05:59:48,402 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-15 05:59:48,403 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-15 05:59:48,403 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-15 05:59:48,403 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-15 05:59:48,404 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-15 05:59:48,404 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-15 05:59:48,404 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-15 05:59:48,405 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-15 05:59:48,405 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-15 05:59:48,405 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-15 05:59:48,406 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-15 05:59:48,406 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-15 05:59:48,406 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-15 05:59:48,407 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-15 05:59:48,407 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-15 05:59:48,407 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-15 05:59:48,408 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-15 05:59:48,408 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-15 05:59:48,408 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-15 05:59:48,409 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-15 05:59:48,409 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-15 05:59:48,409 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-15 05:59:48,410 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-15 05:59:48,410 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-15 05:59:48,410 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-15 05:59:48,411 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-15 05:59:48,411 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-15 05:59:48,411 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-15 05:59:48,412 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-15 05:59:48,412 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-15 05:59:48,412 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-15 05:59:48,413 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-15 05:59:48,413 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-15 05:59:48,413 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-15 05:59:48,414 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-15 05:59:48,414 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-15 05:59:48,414 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-15 05:59:48,415 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-15 05:59:48,415 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-15 05:59:48,415 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-15 05:59:48,416 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-15 05:59:48,416 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-15 05:59:48,416 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-15 05:59:48,417 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-15 05:59:48,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {47046#(<= main_~i~0 52)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-15 05:59:48,417 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-15 05:59:48,417 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-15 05:59:48,417 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-15 05:59:48,417 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-15 05:59:48,417 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-15 05:59:48,418 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-15 05:59:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411661172] [2022-04-15 05:59:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411661172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982793365] [2022-04-15 05:59:48,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:48,419 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-15 05:59:48,420 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-15 05:59:48,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:48,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:48,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 05:59:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:49,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {46989#true} call ULTIMATE.init(); {46989#true} is VALID [2022-04-15 05:59:49,494 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-15 05:59:49,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-15 05:59:49,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-15 05:59:49,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-15 05:59:49,495 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-15 05:59:49,495 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-15 05:59:49,496 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-15 05:59:49,496 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-15 05:59:49,496 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-15 05:59:49,497 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-15 05:59:49,497 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-15 05:59:49,497 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-15 05:59:49,498 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-15 05:59:49,498 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-15 05:59:49,498 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-15 05:59:49,498 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-15 05:59:49,499 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-15 05:59:49,499 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-15 05:59:49,500 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-15 05:59:49,500 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-15 05:59:49,500 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-15 05:59:49,500 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-15 05:59:49,501 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-15 05:59:49,501 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-15 05:59:49,501 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-15 05:59:49,502 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-15 05:59:49,502 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-15 05:59:49,502 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-15 05:59:49,503 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-15 05:59:49,503 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-15 05:59:49,503 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-15 05:59:49,504 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-15 05:59:49,504 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-15 05:59:49,504 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-15 05:59:49,505 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-15 05:59:49,505 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-15 05:59:49,505 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-15 05:59:49,506 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-15 05:59:49,506 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-15 05:59:49,506 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-15 05:59:49,507 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-15 05:59:49,507 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-15 05:59:49,507 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-15 05:59:49,508 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-15 05:59:49,508 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-15 05:59:49,508 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-15 05:59:49,509 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-15 05:59:49,509 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-15 05:59:49,509 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-15 05:59:49,510 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-15 05:59:49,510 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-15 05:59:49,510 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-15 05:59:49,511 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-15 05:59:49,511 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-15 05:59:49,511 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-15 05:59:49,512 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-15 05:59:49,512 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-15 05:59:49,512 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-15 05:59:49,513 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-15 05:59:49,513 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-15 05:59:49,513 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-15 05:59:49,513 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-15 05:59:49,514 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-15 05:59:49,514 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-15 05:59:49,514 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-15 05:59:49,515 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-15 05:59:49,515 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-15 05:59:49,515 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-15 05:59:49,516 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-15 05:59:49,516 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-15 05:59:49,516 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-15 05:59:49,517 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-15 05:59:49,517 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-15 05:59:49,517 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-15 05:59:49,518 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-15 05:59:49,518 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-15 05:59:49,518 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-15 05:59:49,519 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-15 05:59:49,519 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-15 05:59:49,519 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-15 05:59:49,520 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-15 05:59:49,520 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-15 05:59:49,520 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-15 05:59:49,521 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-15 05:59:49,521 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-15 05:59:49,521 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-15 05:59:49,522 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-15 05:59:49,522 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-15 05:59:49,522 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-15 05:59:49,523 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-15 05:59:49,523 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-15 05:59:49,523 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-15 05:59:49,524 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-15 05:59:49,524 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-15 05:59:49,524 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-15 05:59:49,525 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-15 05:59:49,525 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-15 05:59:49,525 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-15 05:59:49,526 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-15 05:59:49,526 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-15 05:59:49,526 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-15 05:59:49,526 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-15 05:59:49,527 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-15 05:59:49,527 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-15 05:59:49,528 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-15 05:59:49,528 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-15 05:59:49,528 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-15 05:59:49,528 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-15 05:59:49,529 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-15 05:59:49,529 INFO L290 TraceCheckUtils]: 110: Hoare triple {47046#(<= main_~i~0 52)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-15 05:59:49,529 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-15 05:59:49,529 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-15 05:59:49,529 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-15 05:59:49,529 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-15 05:59:49,530 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-15 05:59:49,530 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-15 05:59:49,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:52,808 INFO L290 TraceCheckUtils]: 115: Hoare triple {46990#false} assume !false; {46990#false} is VALID [2022-04-15 05:59:52,809 INFO L290 TraceCheckUtils]: 114: Hoare triple {46990#false} assume 0 == ~cond; {46990#false} is VALID [2022-04-15 05:59:52,809 INFO L290 TraceCheckUtils]: 113: Hoare triple {46990#false} ~cond := #in~cond; {46990#false} is VALID [2022-04-15 05:59:52,809 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-15 05:59:52,809 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-15 05:59:52,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {47412#(< main_~i~0 2048)} assume !(~i~0 < 2048); {46990#false} is VALID [2022-04-15 05:59:52,810 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-15 05:59:52,810 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-15 05:59:52,810 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-15 05:59:52,811 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-15 05:59:52,811 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-15 05:59:52,811 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-15 05:59:52,812 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-15 05:59:52,812 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-15 05:59:52,812 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-15 05:59:52,813 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-15 05:59:52,813 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-15 05:59:52,813 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-15 05:59:52,814 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-15 05:59:52,814 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-15 05:59:52,814 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-15 05:59:52,815 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-15 05:59:52,815 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-15 05:59:52,815 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-15 05:59:52,816 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-15 05:59:52,816 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-15 05:59:52,816 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-15 05:59:52,817 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-15 05:59:52,817 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-15 05:59:52,817 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-15 05:59:52,818 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-15 05:59:52,818 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-15 05:59:52,818 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-15 05:59:52,819 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-15 05:59:52,819 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-15 05:59:52,819 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-15 05:59:52,820 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-15 05:59:52,820 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-15 05:59:52,820 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-15 05:59:52,821 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-15 05:59:52,821 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-15 05:59:52,821 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-15 05:59:52,822 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-15 05:59:52,822 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-15 05:59:52,822 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-15 05:59:52,823 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-15 05:59:52,823 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-15 05:59:52,823 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-15 05:59:52,824 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-15 05:59:52,824 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-15 05:59:52,824 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-15 05:59:52,825 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-15 05:59:52,825 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-15 05:59:52,825 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-15 05:59:52,826 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-15 05:59:52,826 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-15 05:59:52,826 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-15 05:59:52,827 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-15 05:59:52,827 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-15 05:59:52,827 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-15 05:59:52,828 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-15 05:59:52,828 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-15 05:59:52,828 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-15 05:59:52,829 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-15 05:59:52,829 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-15 05:59:52,829 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-15 05:59:52,830 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-15 05:59:52,830 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-15 05:59:52,830 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-15 05:59:52,831 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-15 05:59:52,831 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-15 05:59:52,831 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-15 05:59:52,832 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-15 05:59:52,832 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-15 05:59:52,832 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-15 05:59:52,833 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-15 05:59:52,833 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-15 05:59:52,833 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-15 05:59:52,834 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-15 05:59:52,834 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-15 05:59:52,834 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-15 05:59:52,835 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-15 05:59:52,835 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-15 05:59:52,835 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-15 05:59:52,836 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-15 05:59:52,836 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-15 05:59:52,836 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-15 05:59:52,837 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-15 05:59:52,837 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-15 05:59:52,837 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-15 05:59:52,838 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-15 05:59:52,838 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-15 05:59:52,838 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-15 05:59:52,839 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-15 05:59:52,839 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-15 05:59:52,839 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-15 05:59:52,840 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-15 05:59:52,840 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-15 05:59:52,840 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-15 05:59:52,841 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-15 05:59:52,841 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-15 05:59:52,841 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-15 05:59:52,842 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-15 05:59:52,842 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-15 05:59:52,842 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-15 05:59:52,843 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-15 05:59:52,843 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-15 05:59:52,843 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-15 05:59:52,844 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-15 05:59:52,844 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-15 05:59:52,844 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-15 05:59:52,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {46989#true} call #t~ret5 := main(); {46989#true} is VALID [2022-04-15 05:59:52,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46989#true} {46989#true} #44#return; {46989#true} is VALID [2022-04-15 05:59:52,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {46989#true} assume true; {46989#true} is VALID [2022-04-15 05:59:52,845 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-15 05:59:52,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {46989#true} call ULTIMATE.init(); {46989#true} is VALID [2022-04-15 05:59:52,845 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-15 05:59:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982793365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:52,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 05:59:52,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203299110] [2022-04-15 05:59:52,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203299110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:52,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 05:59:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3034322] [2022-04-15 05:59:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:52,846 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-15 05:59:52,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:52,847 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-15 05:59:52,922 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-15 05:59:52,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 05:59:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 05:59:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 05:59:52,924 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-15 05:59:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:55,040 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-15 05:59:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 05:59:55,041 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-15 05:59:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:55,041 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-15 05:59:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 126 transitions. [2022-04-15 05:59:55,042 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-15 05:59:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 126 transitions. [2022-04-15 05:59:55,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 126 transitions. [2022-04-15 05:59:55,136 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-15 05:59:55,137 INFO L225 Difference]: With dead ends: 126 [2022-04-15 05:59:55,137 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 05:59:55,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 05:59:55,139 INFO L913 BasicCegarLoop]: 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-15 05:59:55,139 INFO L914 BasicCegarLoop]: 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-15 05:59:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 05:59:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-15 05:59:55,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:55,778 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-15 05:59:55,779 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-15 05:59:55,779 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-15 05:59:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:55,780 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-15 05:59:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-04-15 05:59:55,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:55,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:55,780 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-15 05:59:55,780 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-15 05:59:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:55,781 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-04-15 05:59:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-04-15 05:59:55,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:55,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:55,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:55,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:55,781 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-15 05:59:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2022-04-15 05:59:55,782 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2022-04-15 05:59:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:55,783 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2022-04-15 05:59:55,783 INFO L479 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-15 05:59:55,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 119 transitions. [2022-04-15 05:59:55,923 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-15 05:59:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2022-04-15 05:59:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 05:59:55,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:55,923 INFO L499 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:55,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-15 05:59:56,124 WARN L460 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-15 05:59:56,124 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1078123324, now seen corresponding path program 105 times [2022-04-15 05:59:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:56,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691701420] [2022-04-15 05:59:56,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:56,127 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:56,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1078123324, now seen corresponding path program 106 times [2022-04-15 05:59:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:56,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37459190] [2022-04-15 05:59:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:57,247 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-15 05:59:57,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-15 05:59:57,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-15 05:59:57,247 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-15 05:59:57,247 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-15 05:59:57,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-15 05:59:57,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-15 05:59:57,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-15 05:59:57,248 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-15 05:59:57,248 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-15 05:59:57,249 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-15 05:59:57,249 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-15 05:59:57,249 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-15 05:59:57,249 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-15 05:59:57,250 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-15 05:59:57,250 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-15 05:59:57,251 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-15 05:59:57,251 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-15 05:59:57,251 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-15 05:59:57,251 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-15 05:59:57,252 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-15 05:59:57,252 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-15 05:59:57,252 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-15 05:59:57,253 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-15 05:59:57,253 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-15 05:59:57,253 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-15 05:59:57,254 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-15 05:59:57,254 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-15 05:59:57,254 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-15 05:59:57,255 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-15 05:59:57,255 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-15 05:59:57,255 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-15 05:59:57,256 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-15 05:59:57,256 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-15 05:59:57,256 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-15 05:59:57,257 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-15 05:59:57,257 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-15 05:59:57,257 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-15 05:59:57,258 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-15 05:59:57,258 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-15 05:59:57,258 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-15 05:59:57,259 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-15 05:59:57,259 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-15 05:59:57,259 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-15 05:59:57,260 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-15 05:59:57,260 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-15 05:59:57,260 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-15 05:59:57,261 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-15 05:59:57,261 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-15 05:59:57,261 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-15 05:59:57,262 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-15 05:59:57,262 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-15 05:59:57,262 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-15 05:59:57,263 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-15 05:59:57,263 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-15 05:59:57,263 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-15 05:59:57,264 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-15 05:59:57,264 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-15 05:59:57,264 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-15 05:59:57,265 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-15 05:59:57,265 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-15 05:59:57,265 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-15 05:59:57,266 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-15 05:59:57,266 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-15 05:59:57,266 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-15 05:59:57,266 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-15 05:59:57,267 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-15 05:59:57,267 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-15 05:59:57,267 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-15 05:59:57,268 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-15 05:59:57,268 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-15 05:59:57,268 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-15 05:59:57,269 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-15 05:59:57,269 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-15 05:59:57,269 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-15 05:59:57,270 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-15 05:59:57,270 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-15 05:59:57,270 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-15 05:59:57,271 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-15 05:59:57,271 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-15 05:59:57,271 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-15 05:59:57,272 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-15 05:59:57,272 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-15 05:59:57,272 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-15 05:59:57,273 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-15 05:59:57,273 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-15 05:59:57,273 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-15 05:59:57,274 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-15 05:59:57,274 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-15 05:59:57,274 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-15 05:59:57,275 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-15 05:59:57,275 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-15 05:59:57,275 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-15 05:59:57,276 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-15 05:59:57,276 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-15 05:59:57,276 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-15 05:59:57,277 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-15 05:59:57,277 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-15 05:59:57,277 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-15 05:59:57,277 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-15 05:59:57,278 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-15 05:59:57,278 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-15 05:59:57,279 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-15 05:59:57,279 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-15 05:59:57,279 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-15 05:59:57,279 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-15 05:59:57,280 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-15 05:59:57,280 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-15 05:59:57,280 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-15 05:59:57,281 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-15 05:59:57,281 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-15 05:59:57,281 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-15 05:59:57,282 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-15 05:59:57,282 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-15 05:59:57,282 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-15 05:59:57,283 INFO L290 TraceCheckUtils]: 112: Hoare triple {48691#(<= main_~i~0 53)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-15 05:59:57,283 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-15 05:59:57,283 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-15 05:59:57,283 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-15 05:59:57,283 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-15 05:59:57,283 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-15 05:59:57,284 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-15 05:59:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37459190] [2022-04-15 05:59:57,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37459190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:57,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131961108] [2022-04-15 05:59:57,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:57,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:57,285 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-15 05:59:57,286 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-15 05:59:57,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:57,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:57,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 05:59:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:58,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {48633#true} call ULTIMATE.init(); {48633#true} is VALID [2022-04-15 05:59:58,353 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-15 05:59:58,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-15 05:59:58,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-15 05:59:58,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-15 05:59:58,353 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-15 05:59:58,354 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-15 05:59:58,354 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-15 05:59:58,354 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-15 05:59:58,355 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-15 05:59:58,355 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-15 05:59:58,355 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-15 05:59:58,356 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-15 05:59:58,356 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-15 05:59:58,356 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-15 05:59:58,357 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-15 05:59:58,357 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-15 05:59:58,357 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-15 05:59:58,358 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-15 05:59:58,358 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-15 05:59:58,358 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-15 05:59:58,359 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-15 05:59:58,359 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-15 05:59:58,359 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-15 05:59:58,360 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-15 05:59:58,360 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-15 05:59:58,360 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-15 05:59:58,361 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-15 05:59:58,361 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-15 05:59:58,361 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-15 05:59:58,361 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-15 05:59:58,362 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-15 05:59:58,362 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-15 05:59:58,363 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-15 05:59:58,363 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-15 05:59:58,363 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-15 05:59:58,363 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-15 05:59:58,364 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-15 05:59:58,364 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-15 05:59:58,364 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-15 05:59:58,365 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-15 05:59:58,365 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-15 05:59:58,365 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-15 05:59:58,366 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-15 05:59:58,366 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-15 05:59:58,366 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-15 05:59:58,367 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-15 05:59:58,367 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-15 05:59:58,367 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-15 05:59:58,368 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-15 05:59:58,368 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-15 05:59:58,368 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-15 05:59:58,369 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-15 05:59:58,369 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-15 05:59:58,369 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-15 05:59:58,370 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-15 05:59:58,370 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-15 05:59:58,370 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-15 05:59:58,371 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-15 05:59:58,371 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-15 05:59:58,371 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-15 05:59:58,372 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-15 05:59:58,372 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-15 05:59:58,372 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-15 05:59:58,373 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-15 05:59:58,373 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-15 05:59:58,373 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-15 05:59:58,374 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-15 05:59:58,374 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-15 05:59:58,374 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-15 05:59:58,375 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-15 05:59:58,375 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-15 05:59:58,375 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-15 05:59:58,376 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-15 05:59:58,376 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-15 05:59:58,376 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-15 05:59:58,377 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-15 05:59:58,377 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-15 05:59:58,377 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-15 05:59:58,378 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-15 05:59:58,378 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-15 05:59:58,378 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-15 05:59:58,379 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-15 05:59:58,379 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-15 05:59:58,379 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-15 05:59:58,380 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-15 05:59:58,380 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-15 05:59:58,380 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-15 05:59:58,381 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-15 05:59:58,381 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-15 05:59:58,381 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-15 05:59:58,382 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-15 05:59:58,382 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-15 05:59:58,382 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-15 05:59:58,383 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-15 05:59:58,383 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-15 05:59:58,383 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-15 05:59:58,384 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-15 05:59:58,384 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-15 05:59:58,384 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-15 05:59:58,385 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-15 05:59:58,385 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-15 05:59:58,385 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-15 05:59:58,386 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-15 05:59:58,386 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-15 05:59:58,386 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-15 05:59:58,387 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-15 05:59:58,387 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-15 05:59:58,387 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-15 05:59:58,388 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-15 05:59:58,388 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-15 05:59:58,388 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-15 05:59:58,389 INFO L290 TraceCheckUtils]: 112: Hoare triple {48691#(<= main_~i~0 53)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-15 05:59:58,389 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-15 05:59:58,389 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-15 05:59:58,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-15 05:59:58,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-15 05:59:58,389 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-15 05:59:58,389 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-15 05:59:58,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:01,759 INFO L290 TraceCheckUtils]: 117: Hoare triple {48634#false} assume !false; {48634#false} is VALID [2022-04-15 06:00:01,760 INFO L290 TraceCheckUtils]: 116: Hoare triple {48634#false} assume 0 == ~cond; {48634#false} is VALID [2022-04-15 06:00:01,760 INFO L290 TraceCheckUtils]: 115: Hoare triple {48634#false} ~cond := #in~cond; {48634#false} is VALID [2022-04-15 06:00:01,760 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-15 06:00:01,760 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-15 06:00:01,760 INFO L290 TraceCheckUtils]: 112: Hoare triple {49063#(< main_~i~0 2048)} assume !(~i~0 < 2048); {48634#false} is VALID [2022-04-15 06:00:01,761 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-15 06:00:01,761 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-15 06:00:01,761 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-15 06:00:01,762 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-15 06:00:01,762 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-15 06:00:01,762 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-15 06:00:01,763 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-15 06:00:01,763 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-15 06:00:01,763 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-15 06:00:01,764 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-15 06:00:01,764 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-15 06:00:01,767 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-15 06:00:01,768 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-15 06:00:01,768 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-15 06:00:01,769 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-15 06:00:01,769 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-15 06:00:01,769 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-15 06:00:01,770 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-15 06:00:01,770 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-15 06:00:01,771 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-15 06:00:01,771 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-15 06:00:01,772 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-15 06:00:01,772 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-15 06:00:01,772 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-15 06:00:01,773 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-15 06:00:01,773 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-15 06:00:01,774 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-15 06:00:01,774 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-15 06:00:01,775 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-15 06:00:01,775 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-15 06:00:01,775 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-15 06:00:01,776 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-15 06:00:01,776 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-15 06:00:01,776 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-15 06:00:01,777 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-15 06:00:01,777 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-15 06:00:01,777 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-15 06:00:01,778 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-15 06:00:01,778 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-15 06:00:01,778 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-15 06:00:01,779 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-15 06:00:01,779 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-15 06:00:01,779 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-15 06:00:01,780 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-15 06:00:01,780 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-15 06:00:01,780 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-15 06:00:01,781 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-15 06:00:01,781 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-15 06:00:01,783 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-15 06:00:01,784 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-15 06:00:01,784 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-15 06:00:01,784 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-15 06:00:01,785 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-15 06:00:01,785 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-15 06:00:01,785 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-15 06:00:01,786 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-15 06:00:01,786 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-15 06:00:01,786 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-15 06:00:01,787 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-15 06:00:01,787 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-15 06:00:01,787 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-15 06:00:01,788 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-15 06:00:01,788 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-15 06:00:01,788 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-15 06:00:01,789 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-15 06:00:01,789 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-15 06:00:01,789 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-15 06:00:01,790 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-15 06:00:01,790 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-15 06:00:01,790 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-15 06:00:01,791 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-15 06:00:01,791 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-15 06:00:01,791 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-15 06:00:01,792 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-15 06:00:01,792 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-15 06:00:01,792 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-15 06:00:01,793 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-15 06:00:01,793 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-15 06:00:01,793 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-15 06:00:01,794 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-15 06:00:01,794 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-15 06:00:01,794 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-15 06:00:01,795 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-15 06:00:01,795 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-15 06:00:01,795 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-15 06:00:01,795 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-15 06:00:01,796 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-15 06:00:01,796 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-15 06:00:01,797 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-15 06:00:01,797 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-15 06:00:01,797 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-15 06:00:01,797 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-15 06:00:01,798 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-15 06:00:01,798 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-15 06:00:01,799 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-15 06:00:01,799 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-15 06:00:01,799 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-15 06:00:01,799 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-15 06:00:01,800 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-15 06:00:01,800 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-15 06:00:01,801 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-15 06:00:01,801 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-15 06:00:01,801 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-15 06:00:01,801 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-15 06:00:01,802 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-15 06:00:01,802 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-15 06:00:01,803 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-15 06:00:01,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {48633#true} call #t~ret5 := main(); {48633#true} is VALID [2022-04-15 06:00:01,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48633#true} {48633#true} #44#return; {48633#true} is VALID [2022-04-15 06:00:01,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {48633#true} assume true; {48633#true} is VALID [2022-04-15 06:00:01,803 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-15 06:00:01,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {48633#true} call ULTIMATE.init(); {48633#true} is VALID [2022-04-15 06:00:01,804 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-15 06:00:01,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131961108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:01,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:01,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-15 06:00:01,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:01,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691701420] [2022-04-15 06:00:01,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691701420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:01,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:01,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:00:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361465477] [2022-04-15 06:00:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:01,805 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-15 06:00:01,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:01,805 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-15 06:00:01,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:01,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:00:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:00:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6107, Invalid=6325, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:00:01,882 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-15 06:00:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,093 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-15 06:00:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:00:04,094 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-15 06:00:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:04,094 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-15 06:00:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 128 transitions. [2022-04-15 06:00:04,095 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-15 06:00:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 128 transitions. [2022-04-15 06:00:04,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 128 transitions. [2022-04-15 06:00:04,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:04,192 INFO L225 Difference]: With dead ends: 128 [2022-04-15 06:00:04,192 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 06:00:04,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12102, Invalid=15288, Unknown=0, NotChecked=0, Total=27390 [2022-04-15 06:00:04,194 INFO L913 BasicCegarLoop]: 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-15 06:00:04,194 INFO L914 BasicCegarLoop]: 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-15 06:00:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 06:00:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 06:00:04,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:04,850 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-15 06:00:04,850 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-15 06:00:04,850 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-15 06:00:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,851 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-15 06:00:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2022-04-15 06:00:04,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:04,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:04,852 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-15 06:00:04,852 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-15 06:00:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,853 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2022-04-15 06:00:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2022-04-15 06:00:04,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:04,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:04,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:04,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:04,854 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-15 06:00:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2022-04-15 06:00:04,855 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2022-04-15 06:00:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:04,855 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2022-04-15 06:00:04,855 INFO L479 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-15 06:00:04,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 121 transitions. [2022-04-15 06:00:05,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2022-04-15 06:00:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-15 06:00:05,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:05,009 INFO L499 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:05,028 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-15 06:00:05,210 WARN L460 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-15 06:00:05,210 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1863483418, now seen corresponding path program 107 times [2022-04-15 06:00:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:05,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758550464] [2022-04-15 06:00:05,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:05,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:05,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1863483418, now seen corresponding path program 108 times [2022-04-15 06:00:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:05,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723495505] [2022-04-15 06:00:05,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:06,412 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-15 06:00:06,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-15 06:00:06,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-15 06:00:06,413 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-15 06:00:06,413 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-15 06:00:06,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-15 06:00:06,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-15 06:00:06,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-15 06:00:06,413 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-15 06:00:06,414 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-15 06:00:06,414 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-15 06:00:06,414 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-15 06:00:06,415 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-15 06:00:06,415 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-15 06:00:06,415 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-15 06:00:06,416 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-15 06:00:06,416 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-15 06:00:06,416 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-15 06:00:06,417 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-15 06:00:06,417 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-15 06:00:06,417 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-15 06:00:06,418 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-15 06:00:06,418 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-15 06:00:06,418 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-15 06:00:06,419 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-15 06:00:06,419 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-15 06:00:06,419 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-15 06:00:06,420 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-15 06:00:06,420 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-15 06:00:06,420 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-15 06:00:06,421 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-15 06:00:06,421 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-15 06:00:06,421 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-15 06:00:06,422 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-15 06:00:06,422 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-15 06:00:06,422 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-15 06:00:06,423 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-15 06:00:06,423 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-15 06:00:06,423 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-15 06:00:06,424 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-15 06:00:06,424 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-15 06:00:06,424 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-15 06:00:06,425 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-15 06:00:06,425 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-15 06:00:06,425 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-15 06:00:06,426 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-15 06:00:06,426 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-15 06:00:06,426 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-15 06:00:06,427 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-15 06:00:06,427 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-15 06:00:06,427 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-15 06:00:06,428 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-15 06:00:06,428 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-15 06:00:06,428 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-15 06:00:06,429 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-15 06:00:06,429 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-15 06:00:06,429 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-15 06:00:06,429 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-15 06:00:06,430 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-15 06:00:06,430 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-15 06:00:06,431 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-15 06:00:06,431 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-15 06:00:06,431 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-15 06:00:06,431 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-15 06:00:06,432 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-15 06:00:06,432 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-15 06:00:06,432 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-15 06:00:06,433 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-15 06:00:06,433 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-15 06:00:06,433 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-15 06:00:06,434 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-15 06:00:06,434 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-15 06:00:06,434 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-15 06:00:06,435 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-15 06:00:06,435 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-15 06:00:06,435 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-15 06:00:06,436 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-15 06:00:06,436 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-15 06:00:06,436 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-15 06:00:06,437 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-15 06:00:06,437 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-15 06:00:06,437 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-15 06:00:06,438 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-15 06:00:06,438 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-15 06:00:06,438 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-15 06:00:06,439 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-15 06:00:06,439 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-15 06:00:06,439 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-15 06:00:06,440 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-15 06:00:06,440 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-15 06:00:06,440 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-15 06:00:06,441 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-15 06:00:06,441 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-15 06:00:06,441 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-15 06:00:06,442 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-15 06:00:06,442 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-15 06:00:06,442 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-15 06:00:06,443 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-15 06:00:06,443 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-15 06:00:06,443 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-15 06:00:06,444 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-15 06:00:06,444 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-15 06:00:06,444 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-15 06:00:06,445 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-15 06:00:06,445 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-15 06:00:06,445 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-15 06:00:06,446 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-15 06:00:06,446 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-15 06:00:06,446 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-15 06:00:06,447 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-15 06:00:06,447 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-15 06:00:06,447 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-15 06:00:06,448 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-15 06:00:06,448 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-15 06:00:06,448 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-15 06:00:06,449 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-15 06:00:06,449 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-15 06:00:06,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {50364#(<= main_~i~0 54)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-15 06:00:06,449 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-15 06:00:06,449 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-15 06:00:06,450 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-15 06:00:06,450 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-15 06:00:06,450 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-15 06:00:06,450 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-15 06:00:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723495505] [2022-04-15 06:00:06,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723495505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477269422] [2022-04-15 06:00:06,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:06,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:06,452 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-15 06:00:06,452 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-15 06:01:09,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2022-04-15 06:01:09,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:09,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 06:01:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:09,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:10,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {50305#true} call ULTIMATE.init(); {50305#true} is VALID [2022-04-15 06:01:10,249 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-15 06:01:10,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-15 06:01:10,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-15 06:01:10,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-15 06:01:10,249 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-15 06:01:10,250 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-15 06:01:10,250 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-15 06:01:10,250 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-15 06:01:10,251 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-15 06:01:10,251 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-15 06:01:10,251 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-15 06:01:10,252 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-15 06:01:10,252 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-15 06:01:10,252 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-15 06:01:10,253 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-15 06:01:10,253 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-15 06:01:10,253 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-15 06:01:10,254 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-15 06:01:10,254 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-15 06:01:10,254 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-15 06:01:10,255 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-15 06:01:10,255 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-15 06:01:10,255 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-15 06:01:10,256 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-15 06:01:10,256 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-15 06:01:10,256 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-15 06:01:10,257 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-15 06:01:10,257 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-15 06:01:10,257 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-15 06:01:10,258 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-15 06:01:10,258 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-15 06:01:10,258 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-15 06:01:10,259 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-15 06:01:10,259 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-15 06:01:10,259 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-15 06:01:10,260 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-15 06:01:10,260 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-15 06:01:10,260 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-15 06:01:10,261 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-15 06:01:10,261 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-15 06:01:10,261 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-15 06:01:10,262 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-15 06:01:10,262 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-15 06:01:10,262 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-15 06:01:10,263 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-15 06:01:10,263 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-15 06:01:10,263 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-15 06:01:10,264 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-15 06:01:10,264 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-15 06:01:10,264 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-15 06:01:10,265 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-15 06:01:10,265 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-15 06:01:10,265 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-15 06:01:10,266 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-15 06:01:10,266 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-15 06:01:10,266 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-15 06:01:10,267 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-15 06:01:10,267 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-15 06:01:10,267 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-15 06:01:10,268 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-15 06:01:10,268 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-15 06:01:10,268 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-15 06:01:10,269 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-15 06:01:10,269 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-15 06:01:10,270 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-15 06:01:10,270 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-15 06:01:10,270 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-15 06:01:10,271 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-15 06:01:10,271 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-15 06:01:10,271 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-15 06:01:10,272 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-15 06:01:10,272 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-15 06:01:10,272 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-15 06:01:10,273 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-15 06:01:10,273 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-15 06:01:10,273 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-15 06:01:10,274 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-15 06:01:10,274 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-15 06:01:10,274 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-15 06:01:10,275 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-15 06:01:10,275 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-15 06:01:10,275 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-15 06:01:10,276 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-15 06:01:10,276 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-15 06:01:10,276 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-15 06:01:10,277 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-15 06:01:10,277 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-15 06:01:10,277 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-15 06:01:10,278 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-15 06:01:10,278 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-15 06:01:10,293 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-15 06:01:10,294 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-15 06:01:10,294 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-15 06:01:10,295 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-15 06:01:10,295 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-15 06:01:10,295 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-15 06:01:10,296 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-15 06:01:10,296 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-15 06:01:10,296 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-15 06:01:10,297 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-15 06:01:10,297 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-15 06:01:10,297 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-15 06:01:10,298 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-15 06:01:10,298 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-15 06:01:10,298 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-15 06:01:10,299 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-15 06:01:10,299 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-15 06:01:10,299 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-15 06:01:10,300 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-15 06:01:10,300 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-15 06:01:10,301 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-15 06:01:10,301 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-15 06:01:10,301 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-15 06:01:10,302 INFO L290 TraceCheckUtils]: 114: Hoare triple {50364#(<= main_~i~0 54)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-15 06:01:10,302 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-15 06:01:10,302 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-15 06:01:10,302 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-15 06:01:10,302 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-15 06:01:10,302 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-15 06:01:10,302 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-15 06:01:10,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:13,827 INFO L290 TraceCheckUtils]: 119: Hoare triple {50306#false} assume !false; {50306#false} is VALID [2022-04-15 06:01:13,827 INFO L290 TraceCheckUtils]: 118: Hoare triple {50306#false} assume 0 == ~cond; {50306#false} is VALID [2022-04-15 06:01:13,827 INFO L290 TraceCheckUtils]: 117: Hoare triple {50306#false} ~cond := #in~cond; {50306#false} is VALID [2022-04-15 06:01:13,827 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-15 06:01:13,828 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-15 06:01:13,828 INFO L290 TraceCheckUtils]: 114: Hoare triple {50742#(< main_~i~0 2048)} assume !(~i~0 < 2048); {50306#false} is VALID [2022-04-15 06:01:13,828 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-15 06:01:13,829 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-15 06:01:13,829 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-15 06:01:13,829 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-15 06:01:13,830 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-15 06:01:13,830 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-15 06:01:13,830 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-15 06:01:13,831 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-15 06:01:13,831 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-15 06:01:13,831 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-15 06:01:13,832 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-15 06:01:13,832 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-15 06:01:13,832 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-15 06:01:13,833 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-15 06:01:13,833 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-15 06:01:13,833 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-15 06:01:13,834 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-15 06:01:13,834 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-15 06:01:13,834 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-15 06:01:13,835 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-15 06:01:13,835 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-15 06:01:13,835 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-15 06:01:13,836 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-15 06:01:13,836 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-15 06:01:13,836 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-15 06:01:13,837 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-15 06:01:13,837 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-15 06:01:13,837 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-15 06:01:13,838 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-15 06:01:13,838 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-15 06:01:13,838 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-15 06:01:13,839 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-15 06:01:13,839 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-15 06:01:13,839 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-15 06:01:13,840 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-15 06:01:13,840 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-15 06:01:13,840 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-15 06:01:13,841 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-15 06:01:13,841 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-15 06:01:13,841 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-15 06:01:13,842 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-15 06:01:13,842 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-15 06:01:13,842 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-15 06:01:13,843 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-15 06:01:13,843 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-15 06:01:13,843 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-15 06:01:13,844 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-15 06:01:13,844 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-15 06:01:13,844 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-15 06:01:13,845 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-15 06:01:13,845 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-15 06:01:13,845 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-15 06:01:13,846 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-15 06:01:13,846 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-15 06:01:13,846 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-15 06:01:13,847 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-15 06:01:13,847 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-15 06:01:13,847 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-15 06:01:13,848 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-15 06:01:13,848 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-15 06:01:13,848 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-15 06:01:13,849 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-15 06:01:13,849 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-15 06:01:13,849 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-15 06:01:13,850 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-15 06:01:13,850 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-15 06:01:13,850 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-15 06:01:13,851 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-15 06:01:13,851 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-15 06:01:13,851 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-15 06:01:13,852 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-15 06:01:13,852 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-15 06:01:13,852 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-15 06:01:13,853 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-15 06:01:13,853 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-15 06:01:13,853 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-15 06:01:13,854 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-15 06:01:13,854 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-15 06:01:13,854 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-15 06:01:13,854 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-15 06:01:13,855 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-15 06:01:13,855 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-15 06:01:13,856 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-15 06:01:13,856 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-15 06:01:13,856 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-15 06:01:13,856 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-15 06:01:13,857 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-15 06:01:13,857 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-15 06:01:13,858 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-15 06:01:13,858 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-15 06:01:13,858 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-15 06:01:13,859 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-15 06:01:13,859 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-15 06:01:13,859 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-15 06:01:13,860 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-15 06:01:13,860 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-15 06:01:13,860 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-15 06:01:13,861 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-15 06:01:13,861 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-15 06:01:13,861 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-15 06:01:13,862 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-15 06:01:13,862 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-15 06:01:13,862 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-15 06:01:13,863 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-15 06:01:13,863 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-15 06:01:13,863 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-15 06:01:13,864 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-15 06:01:13,864 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-15 06:01:13,864 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-15 06:01:13,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {50305#true} call #t~ret5 := main(); {50305#true} is VALID [2022-04-15 06:01:13,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50305#true} {50305#true} #44#return; {50305#true} is VALID [2022-04-15 06:01:13,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {50305#true} assume true; {50305#true} is VALID [2022-04-15 06:01:13,865 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-15 06:01:13,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {50305#true} call ULTIMATE.init(); {50305#true} is VALID [2022-04-15 06:01:13,865 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-15 06:01:13,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477269422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:13,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:13,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-15 06:01:13,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:13,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758550464] [2022-04-15 06:01:13,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758550464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:13,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:13,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:01:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767340189] [2022-04-15 06:01:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:13,866 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-15 06:01:13,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:13,867 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-15 06:01:13,945 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-15 06:01:13,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:01:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:13,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:01:13,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 06:01:13,947 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-15 06:01:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:16,243 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-15 06:01:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:01:16,243 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-15 06:01:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:16,243 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-15 06:01:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 130 transitions. [2022-04-15 06:01:16,244 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-15 06:01:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 130 transitions. [2022-04-15 06:01:16,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 130 transitions. [2022-04-15 06:01:16,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:16,343 INFO L225 Difference]: With dead ends: 130 [2022-04-15 06:01:16,343 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 06:01:16,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 06:01:16,345 INFO L913 BasicCegarLoop]: 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-15 06:01:16,345 INFO L914 BasicCegarLoop]: 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-15 06:01:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 06:01:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-15 06:01:17,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:17,046 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-15 06:01:17,046 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-15 06:01:17,046 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-15 06:01:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:17,047 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-15 06:01:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-15 06:01:17,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:17,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:17,047 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-15 06:01:17,048 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-15 06:01:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:17,049 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2022-04-15 06:01:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2022-04-15 06:01:17,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:17,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:17,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:17,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:17,049 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-15 06:01:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2022-04-15 06:01:17,050 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2022-04-15 06:01:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:17,050 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2022-04-15 06:01:17,050 INFO L479 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-15 06:01:17,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 123 transitions. [2022-04-15 06:01:17,205 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-15 06:01:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2022-04-15 06:01:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:01:17,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:17,206 INFO L499 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:17,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-15 06:01:17,406 WARN L460 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-15 06:01:17,406 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash -680289656, now seen corresponding path program 109 times [2022-04-15 06:01:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:17,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27140100] [2022-04-15 06:01:17,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:17,409 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:17,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -680289656, now seen corresponding path program 110 times [2022-04-15 06:01:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:17,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661784455] [2022-04-15 06:01:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,747 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-15 06:01:18,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-15 06:01:18,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-15 06:01:18,748 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-15 06:01:18,748 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-15 06:01:18,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-15 06:01:18,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-15 06:01:18,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-15 06:01:18,749 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-15 06:01:18,749 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-15 06:01:18,749 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-15 06:01:18,749 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-15 06:01:18,750 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-15 06:01:18,750 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-15 06:01:18,751 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-15 06:01:18,751 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-15 06:01:18,751 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-15 06:01:18,751 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-15 06:01:18,752 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-15 06:01:18,752 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-15 06:01:18,753 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-15 06:01:18,753 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-15 06:01:18,753 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-15 06:01:18,753 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-15 06:01:18,754 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-15 06:01:18,754 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-15 06:01:18,755 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-15 06:01:18,755 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-15 06:01:18,755 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-15 06:01:18,755 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-15 06:01:18,756 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-15 06:01:18,756 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-15 06:01:18,757 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-15 06:01:18,757 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-15 06:01:18,757 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-15 06:01:18,757 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-15 06:01:18,758 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-15 06:01:18,758 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-15 06:01:18,759 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-15 06:01:18,759 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-15 06:01:18,759 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-15 06:01:18,760 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-15 06:01:18,760 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-15 06:01:18,760 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-15 06:01:18,761 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-15 06:01:18,761 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-15 06:01:18,761 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-15 06:01:18,762 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-15 06:01:18,762 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-15 06:01:18,762 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-15 06:01:18,763 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-15 06:01:18,763 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-15 06:01:18,763 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-15 06:01:18,764 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-15 06:01:18,764 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-15 06:01:18,764 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-15 06:01:18,765 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-15 06:01:18,765 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-15 06:01:18,765 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-15 06:01:18,766 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-15 06:01:18,766 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-15 06:01:18,766 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-15 06:01:18,767 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-15 06:01:18,767 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-15 06:01:18,767 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-15 06:01:18,768 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-15 06:01:18,768 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-15 06:01:18,768 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-15 06:01:18,769 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-15 06:01:18,769 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-15 06:01:18,769 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-15 06:01:18,769 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-15 06:01:18,770 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-15 06:01:18,770 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-15 06:01:18,771 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-15 06:01:18,771 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-15 06:01:18,771 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-15 06:01:18,771 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-15 06:01:18,772 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-15 06:01:18,772 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-15 06:01:18,773 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-15 06:01:18,773 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-15 06:01:18,773 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-15 06:01:18,774 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-15 06:01:18,774 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-15 06:01:18,774 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-15 06:01:18,775 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-15 06:01:18,775 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-15 06:01:18,775 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-15 06:01:18,776 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-15 06:01:18,776 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-15 06:01:18,776 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-15 06:01:18,777 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-15 06:01:18,777 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-15 06:01:18,777 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-15 06:01:18,778 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-15 06:01:18,778 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-15 06:01:18,778 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-15 06:01:18,779 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-15 06:01:18,779 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-15 06:01:18,779 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-15 06:01:18,780 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-15 06:01:18,780 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-15 06:01:18,780 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-15 06:01:18,781 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-15 06:01:18,781 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-15 06:01:18,781 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-15 06:01:18,782 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-15 06:01:18,782 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-15 06:01:18,782 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-15 06:01:18,783 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-15 06:01:18,783 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-15 06:01:18,783 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-15 06:01:18,784 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-15 06:01:18,784 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-15 06:01:18,784 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-15 06:01:18,785 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-15 06:01:18,785 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-15 06:01:18,785 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-15 06:01:18,786 INFO L290 TraceCheckUtils]: 116: Hoare triple {52065#(<= main_~i~0 55)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-15 06:01:18,786 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-15 06:01:18,786 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-15 06:01:18,786 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-15 06:01:18,786 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-15 06:01:18,786 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-15 06:01:18,787 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-15 06:01:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:18,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661784455] [2022-04-15 06:01:18,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661784455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:18,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933922623] [2022-04-15 06:01:18,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:18,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:18,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:18,788 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-15 06:01:18,789 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-15 06:01:19,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:19,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:19,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:01:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:19,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:19,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {52005#true} call ULTIMATE.init(); {52005#true} is VALID [2022-04-15 06:01:19,926 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-15 06:01:19,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-15 06:01:19,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-15 06:01:19,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-15 06:01:19,927 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-15 06:01:19,927 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-15 06:01:19,928 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-15 06:01:19,928 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-15 06:01:19,928 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-15 06:01:19,929 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-15 06:01:19,929 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-15 06:01:19,929 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-15 06:01:19,930 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-15 06:01:19,930 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-15 06:01:19,930 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-15 06:01:19,931 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-15 06:01:19,931 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-15 06:01:19,931 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-15 06:01:19,932 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-15 06:01:19,932 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-15 06:01:19,932 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-15 06:01:19,933 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-15 06:01:19,933 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-15 06:01:19,933 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-15 06:01:19,934 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-15 06:01:19,934 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-15 06:01:19,934 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-15 06:01:19,935 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-15 06:01:19,935 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-15 06:01:19,935 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-15 06:01:19,936 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-15 06:01:19,936 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-15 06:01:19,936 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-15 06:01:19,937 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-15 06:01:19,937 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-15 06:01:19,937 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-15 06:01:19,938 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-15 06:01:19,938 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-15 06:01:19,938 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-15 06:01:19,939 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-15 06:01:19,939 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-15 06:01:19,939 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-15 06:01:19,940 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-15 06:01:19,940 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-15 06:01:19,940 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-15 06:01:19,941 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-15 06:01:19,941 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-15 06:01:19,941 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-15 06:01:19,942 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-15 06:01:19,942 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-15 06:01:19,942 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-15 06:01:19,943 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-15 06:01:19,943 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-15 06:01:19,943 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-15 06:01:19,944 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-15 06:01:19,944 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-15 06:01:19,944 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-15 06:01:19,945 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-15 06:01:19,945 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-15 06:01:19,945 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-15 06:01:19,946 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-15 06:01:19,946 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-15 06:01:19,946 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-15 06:01:19,947 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-15 06:01:19,947 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-15 06:01:19,947 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-15 06:01:19,948 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-15 06:01:19,948 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-15 06:01:19,948 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-15 06:01:19,949 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-15 06:01:19,949 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-15 06:01:19,949 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-15 06:01:19,950 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-15 06:01:19,950 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-15 06:01:19,950 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-15 06:01:19,951 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-15 06:01:19,951 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-15 06:01:19,951 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-15 06:01:19,952 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-15 06:01:19,952 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-15 06:01:19,952 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-15 06:01:19,953 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-15 06:01:19,953 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-15 06:01:19,953 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-15 06:01:19,954 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-15 06:01:19,954 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-15 06:01:19,955 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-15 06:01:19,955 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-15 06:01:19,955 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-15 06:01:19,956 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-15 06:01:19,956 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-15 06:01:19,956 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-15 06:01:19,957 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-15 06:01:19,957 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-15 06:01:19,957 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-15 06:01:19,958 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-15 06:01:19,958 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-15 06:01:19,958 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-15 06:01:19,959 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-15 06:01:19,959 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-15 06:01:19,959 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-15 06:01:19,959 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-15 06:01:19,960 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-15 06:01:19,960 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-15 06:01:19,961 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-15 06:01:19,961 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-15 06:01:19,961 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-15 06:01:19,961 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-15 06:01:19,962 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-15 06:01:19,962 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-15 06:01:19,963 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-15 06:01:19,963 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-15 06:01:19,963 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-15 06:01:19,963 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-15 06:01:19,964 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-15 06:01:19,964 INFO L290 TraceCheckUtils]: 116: Hoare triple {52065#(<= main_~i~0 55)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-15 06:01:19,964 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-15 06:01:19,964 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-15 06:01:19,964 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-15 06:01:19,964 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-15 06:01:19,965 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-15 06:01:19,965 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-15 06:01:19,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:23,674 INFO L290 TraceCheckUtils]: 121: Hoare triple {52006#false} assume !false; {52006#false} is VALID [2022-04-15 06:01:23,674 INFO L290 TraceCheckUtils]: 120: Hoare triple {52006#false} assume 0 == ~cond; {52006#false} is VALID [2022-04-15 06:01:23,674 INFO L290 TraceCheckUtils]: 119: Hoare triple {52006#false} ~cond := #in~cond; {52006#false} is VALID [2022-04-15 06:01:23,674 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-15 06:01:23,674 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-15 06:01:23,675 INFO L290 TraceCheckUtils]: 116: Hoare triple {52449#(< main_~i~0 2048)} assume !(~i~0 < 2048); {52006#false} is VALID [2022-04-15 06:01:23,675 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-15 06:01:23,675 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-15 06:01:23,676 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-15 06:01:23,676 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-15 06:01:23,677 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-15 06:01:23,677 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-15 06:01:23,677 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-15 06:01:23,678 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-15 06:01:23,678 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-15 06:01:23,678 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-15 06:01:23,679 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-15 06:01:23,679 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-15 06:01:23,679 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-15 06:01:23,680 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-15 06:01:23,680 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-15 06:01:23,680 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-15 06:01:23,681 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-15 06:01:23,681 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-15 06:01:23,681 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-15 06:01:23,682 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-15 06:01:23,682 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-15 06:01:23,682 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-15 06:01:23,683 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-15 06:01:23,683 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-15 06:01:23,683 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-15 06:01:23,684 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-15 06:01:23,684 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-15 06:01:23,684 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-15 06:01:23,685 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-15 06:01:23,685 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-15 06:01:23,685 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-15 06:01:23,686 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-15 06:01:23,686 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-15 06:01:23,686 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-15 06:01:23,687 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-15 06:01:23,687 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-15 06:01:23,687 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-15 06:01:23,688 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-15 06:01:23,688 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-15 06:01:23,688 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-15 06:01:23,689 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-15 06:01:23,689 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-15 06:01:23,689 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-15 06:01:23,690 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-15 06:01:23,690 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-15 06:01:23,690 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-15 06:01:23,691 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-15 06:01:23,691 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-15 06:01:23,691 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-15 06:01:23,692 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-15 06:01:23,692 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-15 06:01:23,692 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-15 06:01:23,693 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-15 06:01:23,693 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-15 06:01:23,694 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-15 06:01:23,694 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-15 06:01:23,694 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-15 06:01:23,694 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-15 06:01:23,695 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-15 06:01:23,695 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-15 06:01:23,696 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-15 06:01:23,696 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-15 06:01:23,696 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-15 06:01:23,697 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-15 06:01:23,697 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-15 06:01:23,697 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-15 06:01:23,698 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-15 06:01:23,698 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-15 06:01:23,698 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-15 06:01:23,699 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-15 06:01:23,699 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-15 06:01:23,699 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-15 06:01:23,700 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-15 06:01:23,700 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-15 06:01:23,700 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-15 06:01:23,701 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-15 06:01:23,701 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-15 06:01:23,701 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-15 06:01:23,702 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-15 06:01:23,702 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-15 06:01:23,702 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-15 06:01:23,703 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-15 06:01:23,703 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-15 06:01:23,703 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-15 06:01:23,704 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-15 06:01:23,704 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-15 06:01:23,704 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-15 06:01:23,705 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-15 06:01:23,705 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-15 06:01:23,705 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-15 06:01:23,706 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-15 06:01:23,706 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-15 06:01:23,706 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-15 06:01:23,707 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-15 06:01:23,707 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-15 06:01:23,707 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-15 06:01:23,708 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-15 06:01:23,708 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-15 06:01:23,708 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-15 06:01:23,709 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-15 06:01:23,709 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-15 06:01:23,709 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-15 06:01:23,710 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-15 06:01:23,710 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-15 06:01:23,710 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-15 06:01:23,711 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-15 06:01:23,711 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-15 06:01:23,711 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-15 06:01:23,712 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-15 06:01:23,712 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-15 06:01:23,713 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-15 06:01:23,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {52005#true} call #t~ret5 := main(); {52005#true} is VALID [2022-04-15 06:01:23,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52005#true} {52005#true} #44#return; {52005#true} is VALID [2022-04-15 06:01:23,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {52005#true} assume true; {52005#true} is VALID [2022-04-15 06:01:23,713 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-15 06:01:23,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {52005#true} call ULTIMATE.init(); {52005#true} is VALID [2022-04-15 06:01:23,713 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-15 06:01:23,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933922623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:23,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:23,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 06:01:23,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:23,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27140100] [2022-04-15 06:01:23,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27140100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:23,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:23,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:01:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121814194] [2022-04-15 06:01:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:23,715 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-15 06:01:23,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:23,715 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-15 06:01:23,795 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-15 06:01:23,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:01:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:01:23,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:01:23,796 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-15 06:01:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:26,235 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-15 06:01:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:01:26,235 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-15 06:01:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:26,235 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-15 06:01:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 132 transitions. [2022-04-15 06:01:26,236 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-15 06:01:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 132 transitions. [2022-04-15 06:01:26,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 132 transitions. [2022-04-15 06:01:26,363 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-15 06:01:26,364 INFO L225 Difference]: With dead ends: 132 [2022-04-15 06:01:26,364 INFO L226 Difference]: Without dead ends: 126 [2022-04-15 06:01:26,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:01:26,366 INFO L913 BasicCegarLoop]: 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-15 06:01:26,367 INFO L914 BasicCegarLoop]: 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-15 06:01:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-15 06:01:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-04-15 06:01:27,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:27,078 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-15 06:01:27,079 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-15 06:01:27,079 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-15 06:01:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,080 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-15 06:01:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2022-04-15 06:01:27,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,080 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-15 06:01:27,080 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-15 06:01:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,082 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2022-04-15 06:01:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2022-04-15 06:01:27,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:27,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:27,082 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-15 06:01:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2022-04-15 06:01:27,084 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2022-04-15 06:01:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:27,084 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2022-04-15 06:01:27,084 INFO L479 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-15 06:01:27,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 125 transitions. [2022-04-15 06:01:27,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2022-04-15 06:01:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 06:01:27,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:27,251 INFO L499 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:27,270 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-15 06:01:27,452 WARN L460 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-15 06:01:27,452 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417814, now seen corresponding path program 111 times [2022-04-15 06:01:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719613866] [2022-04-15 06:01:27,455 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:27,455 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:27,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417814, now seen corresponding path program 112 times [2022-04-15 06:01:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:27,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417674718] [2022-04-15 06:01:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:28,762 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-15 06:01:28,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-15 06:01:28,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-15 06:01:28,763 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-15 06:01:28,763 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-15 06:01:28,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-15 06:01:28,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-15 06:01:28,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-15 06:01:28,763 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-15 06:01:28,763 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-15 06:01:28,764 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-15 06:01:28,764 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-15 06:01:28,764 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-15 06:01:28,765 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-15 06:01:28,765 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-15 06:01:28,765 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-15 06:01:28,766 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-15 06:01:28,766 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-15 06:01:28,766 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-15 06:01:28,767 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-15 06:01:28,767 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-15 06:01:28,767 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-15 06:01:28,768 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-15 06:01:28,768 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-15 06:01:28,768 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-15 06:01:28,769 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-15 06:01:28,769 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-15 06:01:28,769 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-15 06:01:28,770 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-15 06:01:28,770 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-15 06:01:28,770 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-15 06:01:28,771 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-15 06:01:28,771 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-15 06:01:28,771 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-15 06:01:28,772 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-15 06:01:28,772 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-15 06:01:28,772 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-15 06:01:28,773 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-15 06:01:28,773 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-15 06:01:28,773 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-15 06:01:28,774 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-15 06:01:28,774 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-15 06:01:28,786 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-15 06:01:28,786 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-15 06:01:28,787 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-15 06:01:28,787 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-15 06:01:28,788 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-15 06:01:28,788 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-15 06:01:28,788 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-15 06:01:28,788 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-15 06:01:28,789 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-15 06:01:28,789 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-15 06:01:28,789 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-15 06:01:28,790 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-15 06:01:28,790 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-15 06:01:28,790 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-15 06:01:28,791 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-15 06:01:28,791 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-15 06:01:28,792 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-15 06:01:28,792 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-15 06:01:28,792 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-15 06:01:28,792 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-15 06:01:28,793 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-15 06:01:28,793 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-15 06:01:28,793 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-15 06:01:28,794 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-15 06:01:28,794 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-15 06:01:28,794 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-15 06:01:28,795 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-15 06:01:28,795 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-15 06:01:28,796 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-15 06:01:28,796 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-15 06:01:28,796 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-15 06:01:28,796 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-15 06:01:28,797 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-15 06:01:28,797 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-15 06:01:28,798 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-15 06:01:28,798 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-15 06:01:28,798 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-15 06:01:28,798 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-15 06:01:28,799 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-15 06:01:28,799 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-15 06:01:28,800 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-15 06:01:28,800 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-15 06:01:28,800 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-15 06:01:28,800 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-15 06:01:28,801 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-15 06:01:28,801 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-15 06:01:28,801 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-15 06:01:28,802 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-15 06:01:28,802 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-15 06:01:28,802 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-15 06:01:28,803 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-15 06:01:28,803 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-15 06:01:28,804 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-15 06:01:28,804 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-15 06:01:28,804 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-15 06:01:28,804 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-15 06:01:28,805 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-15 06:01:28,805 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-15 06:01:28,806 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-15 06:01:28,806 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-15 06:01:28,806 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-15 06:01:28,806 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-15 06:01:28,807 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-15 06:01:28,807 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-15 06:01:28,807 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-15 06:01:28,808 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-15 06:01:28,808 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-15 06:01:28,808 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-15 06:01:28,809 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-15 06:01:28,809 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-15 06:01:28,809 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-15 06:01:28,810 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-15 06:01:28,810 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-15 06:01:28,810 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-15 06:01:28,811 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-15 06:01:28,811 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-15 06:01:28,811 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-15 06:01:28,812 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-15 06:01:28,812 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-15 06:01:28,812 INFO L290 TraceCheckUtils]: 118: Hoare triple {53794#(<= main_~i~0 56)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-15 06:01:28,813 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-15 06:01:28,813 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-15 06:01:28,813 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-15 06:01:28,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-15 06:01:28,813 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-15 06:01:28,813 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-15 06:01:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:28,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417674718] [2022-04-15 06:01:28,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417674718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:28,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267783856] [2022-04-15 06:01:28,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:28,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:28,815 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-15 06:01:28,818 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-15 06:01:29,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:29,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:29,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-15 06:01:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:29,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:29,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {53733#true} call ULTIMATE.init(); {53733#true} is VALID [2022-04-15 06:01:29,959 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-15 06:01:29,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-15 06:01:29,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-15 06:01:29,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-15 06:01:29,960 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-15 06:01:29,960 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-15 06:01:29,961 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-15 06:01:29,961 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-15 06:01:29,961 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-15 06:01:29,962 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-15 06:01:29,962 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-15 06:01:29,962 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-15 06:01:29,963 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-15 06:01:29,963 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-15 06:01:29,963 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-15 06:01:29,964 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-15 06:01:29,964 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-15 06:01:29,964 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-15 06:01:29,965 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-15 06:01:29,965 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-15 06:01:29,965 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-15 06:01:29,966 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-15 06:01:29,966 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-15 06:01:29,966 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-15 06:01:29,967 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-15 06:01:29,967 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-15 06:01:29,967 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-15 06:01:29,967 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-15 06:01:29,968 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-15 06:01:29,968 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-15 06:01:29,969 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-15 06:01:29,969 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-15 06:01:29,969 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-15 06:01:29,969 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-15 06:01:29,970 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-15 06:01:29,970 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-15 06:01:29,970 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-15 06:01:29,971 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-15 06:01:29,971 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-15 06:01:29,971 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-15 06:01:29,972 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-15 06:01:29,972 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-15 06:01:29,972 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-15 06:01:29,973 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-15 06:01:29,973 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-15 06:01:29,973 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-15 06:01:29,974 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-15 06:01:29,974 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-15 06:01:29,974 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-15 06:01:29,975 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-15 06:01:29,975 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-15 06:01:29,975 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-15 06:01:29,976 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-15 06:01:29,976 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-15 06:01:29,976 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-15 06:01:29,977 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-15 06:01:29,977 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-15 06:01:29,977 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-15 06:01:29,978 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-15 06:01:29,978 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-15 06:01:29,978 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-15 06:01:29,979 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-15 06:01:29,979 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-15 06:01:29,979 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-15 06:01:29,980 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-15 06:01:29,980 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-15 06:01:29,980 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-15 06:01:29,981 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-15 06:01:29,981 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-15 06:01:29,981 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-15 06:01:29,982 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-15 06:01:29,982 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-15 06:01:29,982 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-15 06:01:29,983 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-15 06:01:29,983 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-15 06:01:29,983 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-15 06:01:29,984 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-15 06:01:29,984 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-15 06:01:29,984 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-15 06:01:29,985 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-15 06:01:29,985 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-15 06:01:29,985 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-15 06:01:29,986 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-15 06:01:29,986 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-15 06:01:29,986 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-15 06:01:29,987 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-15 06:01:29,987 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-15 06:01:29,987 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-15 06:01:29,988 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-15 06:01:29,988 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-15 06:01:29,988 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-15 06:01:29,989 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-15 06:01:29,989 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-15 06:01:29,989 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-15 06:01:29,990 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-15 06:01:29,990 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-15 06:01:29,990 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-15 06:01:29,991 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-15 06:01:29,991 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-15 06:01:29,991 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-15 06:01:29,992 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-15 06:01:29,992 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-15 06:01:29,992 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-15 06:01:29,993 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-15 06:01:29,993 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-15 06:01:29,993 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-15 06:01:29,994 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-15 06:01:29,994 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-15 06:01:29,994 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-15 06:01:29,995 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-15 06:01:29,995 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-15 06:01:29,995 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-15 06:01:29,996 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-15 06:01:29,996 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-15 06:01:29,996 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-15 06:01:29,997 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-15 06:01:29,997 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-15 06:01:29,997 INFO L290 TraceCheckUtils]: 118: Hoare triple {53794#(<= main_~i~0 56)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-15 06:01:29,997 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-15 06:01:29,997 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-15 06:01:29,998 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-15 06:01:29,998 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-15 06:01:29,998 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-15 06:01:29,998 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-15 06:01:29,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:33,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {53734#false} assume !false; {53734#false} is VALID [2022-04-15 06:01:33,764 INFO L290 TraceCheckUtils]: 122: Hoare triple {53734#false} assume 0 == ~cond; {53734#false} is VALID [2022-04-15 06:01:33,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {53734#false} ~cond := #in~cond; {53734#false} is VALID [2022-04-15 06:01:33,764 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-15 06:01:33,764 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-15 06:01:33,764 INFO L290 TraceCheckUtils]: 118: Hoare triple {54184#(< main_~i~0 2048)} assume !(~i~0 < 2048); {53734#false} is VALID [2022-04-15 06:01:33,765 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-15 06:01:33,765 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-15 06:01:33,765 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-15 06:01:33,765 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-15 06:01:33,766 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-15 06:01:33,766 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-15 06:01:33,767 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-15 06:01:33,767 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-15 06:01:33,767 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-15 06:01:33,767 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-15 06:01:33,768 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-15 06:01:33,768 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-15 06:01:33,769 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-15 06:01:33,769 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-15 06:01:33,769 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-15 06:01:33,769 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-15 06:01:33,770 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-15 06:01:33,770 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-15 06:01:33,770 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-15 06:01:33,771 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-15 06:01:33,771 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-15 06:01:33,771 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-15 06:01:33,772 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-15 06:01:33,772 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-15 06:01:33,772 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-15 06:01:33,773 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-15 06:01:33,773 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-15 06:01:33,773 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-15 06:01:33,774 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-15 06:01:33,774 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-15 06:01:33,774 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-15 06:01:33,775 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-15 06:01:33,775 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-15 06:01:33,775 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-15 06:01:33,776 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-15 06:01:33,776 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-15 06:01:33,776 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-15 06:01:33,777 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-15 06:01:33,777 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-15 06:01:33,777 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-15 06:01:33,778 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-15 06:01:33,778 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-15 06:01:33,778 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-15 06:01:33,779 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-15 06:01:33,779 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-15 06:01:33,779 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-15 06:01:33,780 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-15 06:01:33,780 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-15 06:01:33,780 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-15 06:01:33,781 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-15 06:01:33,781 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-15 06:01:33,781 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-15 06:01:33,782 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-15 06:01:33,782 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-15 06:01:33,782 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-15 06:01:33,783 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-15 06:01:33,783 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-15 06:01:33,783 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-15 06:01:33,784 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-15 06:01:33,784 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-15 06:01:33,784 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-15 06:01:33,785 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-15 06:01:33,785 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-15 06:01:33,785 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-15 06:01:33,786 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-15 06:01:33,786 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-15 06:01:33,786 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-15 06:01:33,787 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-15 06:01:33,787 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-15 06:01:33,787 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-15 06:01:33,788 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-15 06:01:33,788 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-15 06:01:33,788 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-15 06:01:33,789 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-15 06:01:33,789 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-15 06:01:33,789 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-15 06:01:33,790 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-15 06:01:33,790 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-15 06:01:33,790 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-15 06:01:33,791 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-15 06:01:33,791 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-15 06:01:33,791 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-15 06:01:33,792 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-15 06:01:33,792 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-15 06:01:33,792 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-15 06:01:33,793 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-15 06:01:33,793 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-15 06:01:33,793 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-15 06:01:33,794 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-15 06:01:33,794 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-15 06:01:33,794 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-15 06:01:33,795 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-15 06:01:33,795 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-15 06:01:33,795 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-15 06:01:33,796 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-15 06:01:33,796 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-15 06:01:33,797 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-15 06:01:33,797 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-15 06:01:33,797 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-15 06:01:33,798 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-15 06:01:33,798 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-15 06:01:33,798 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-15 06:01:33,799 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-15 06:01:33,799 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-15 06:01:33,799 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-15 06:01:33,800 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-15 06:01:33,800 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-15 06:01:33,800 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-15 06:01:33,801 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-15 06:01:33,801 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-15 06:01:33,801 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-15 06:01:33,802 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-15 06:01:33,802 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-15 06:01:33,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {53733#true} call #t~ret5 := main(); {53733#true} is VALID [2022-04-15 06:01:33,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53733#true} {53733#true} #44#return; {53733#true} is VALID [2022-04-15 06:01:33,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {53733#true} assume true; {53733#true} is VALID [2022-04-15 06:01:33,802 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-15 06:01:33,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {53733#true} call ULTIMATE.init(); {53733#true} is VALID [2022-04-15 06:01:33,803 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-15 06:01:33,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267783856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:33,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:33,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-15 06:01:33,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:33,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719613866] [2022-04-15 06:01:33,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719613866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:33,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:01:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164473694] [2022-04-15 06:01:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:33,804 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-15 06:01:33,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:33,804 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-15 06:01:33,884 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-15 06:01:33,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:01:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:33,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:01:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6788, Invalid=7018, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:01:33,886 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-15 06:01:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:36,337 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-15 06:01:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:01:36,337 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-15 06:01:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:36,338 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-15 06:01:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 134 transitions. [2022-04-15 06:01:36,338 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-15 06:01:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 134 transitions. [2022-04-15 06:01:36,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 134 transitions. [2022-04-15 06:01:36,438 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-15 06:01:36,439 INFO L225 Difference]: With dead ends: 134 [2022-04-15 06:01:36,439 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 06:01:36,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=13458, Invalid=16992, Unknown=0, NotChecked=0, Total=30450 [2022-04-15 06:01:36,441 INFO L913 BasicCegarLoop]: 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-15 06:01:36,441 INFO L914 BasicCegarLoop]: 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-15 06:01:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 06:01:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-04-15 06:01:37,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:37,158 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-15 06:01:37,158 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-15 06:01:37,158 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-15 06:01:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:37,159 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-15 06:01:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2022-04-15 06:01:37,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:37,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:37,160 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-15 06:01:37,160 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-15 06:01:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:37,161 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2022-04-15 06:01:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2022-04-15 06:01:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:37,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:37,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:37,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:37,162 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-15 06:01:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2022-04-15 06:01:37,163 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2022-04-15 06:01:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:37,163 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2022-04-15 06:01:37,163 INFO L479 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-15 06:01:37,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 127 transitions. [2022-04-15 06:01:37,335 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-15 06:01:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2022-04-15 06:01:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 06:01:37,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:37,335 INFO L499 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:37,355 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-15 06:01:37,536 WARN L460 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-15 06:01:37,536 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1615753652, now seen corresponding path program 113 times [2022-04-15 06:01:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486362330] [2022-04-15 06:01:37,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:37,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:37,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1615753652, now seen corresponding path program 114 times [2022-04-15 06:01:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:37,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118288124] [2022-04-15 06:01:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:38,808 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-15 06:01:38,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-15 06:01:38,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-15 06:01:38,808 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-15 06:01:38,808 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-15 06:01:38,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-15 06:01:38,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-15 06:01:38,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-15 06:01:38,809 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-15 06:01:38,809 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-15 06:01:38,809 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-15 06:01:38,810 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-15 06:01:38,810 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-15 06:01:38,810 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-15 06:01:38,811 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-15 06:01:38,811 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-15 06:01:38,811 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-15 06:01:38,812 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-15 06:01:38,812 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-15 06:01:38,812 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-15 06:01:38,813 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-15 06:01:38,813 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-15 06:01:38,813 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-15 06:01:38,813 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-15 06:01:38,814 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-15 06:01:38,814 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-15 06:01:38,814 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-15 06:01:38,815 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-15 06:01:38,815 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-15 06:01:38,815 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-15 06:01:38,816 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-15 06:01:38,816 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-15 06:01:38,816 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-15 06:01:38,817 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-15 06:01:38,817 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-15 06:01:38,817 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-15 06:01:38,818 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-15 06:01:38,818 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-15 06:01:38,818 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-15 06:01:38,819 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-15 06:01:38,819 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-15 06:01:38,819 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-15 06:01:38,820 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-15 06:01:38,820 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-15 06:01:38,820 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-15 06:01:38,821 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-15 06:01:38,821 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-15 06:01:38,821 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-15 06:01:38,822 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-15 06:01:38,822 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-15 06:01:38,822 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-15 06:01:38,823 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-15 06:01:38,823 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-15 06:01:38,823 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-15 06:01:38,824 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-15 06:01:38,824 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-15 06:01:38,824 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-15 06:01:38,825 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-15 06:01:38,825 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-15 06:01:38,825 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-15 06:01:38,826 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-15 06:01:38,826 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-15 06:01:38,826 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-15 06:01:38,826 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-15 06:01:38,827 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-15 06:01:38,827 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-15 06:01:38,827 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-15 06:01:38,828 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-15 06:01:38,828 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-15 06:01:38,828 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-15 06:01:38,829 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-15 06:01:38,829 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-15 06:01:38,829 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-15 06:01:38,830 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-15 06:01:38,830 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-15 06:01:38,830 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-15 06:01:38,831 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-15 06:01:38,831 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-15 06:01:38,831 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-15 06:01:38,832 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-15 06:01:38,832 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-15 06:01:38,832 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-15 06:01:38,833 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-15 06:01:38,833 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-15 06:01:38,833 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-15 06:01:38,834 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-15 06:01:38,834 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-15 06:01:38,834 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-15 06:01:38,835 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-15 06:01:38,835 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-15 06:01:38,835 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-15 06:01:38,836 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-15 06:01:38,836 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-15 06:01:38,836 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-15 06:01:38,837 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-15 06:01:38,837 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-15 06:01:38,837 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-15 06:01:38,838 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-15 06:01:38,838 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-15 06:01:38,838 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-15 06:01:38,839 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-15 06:01:38,839 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-15 06:01:38,839 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-15 06:01:38,840 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-15 06:01:38,840 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-15 06:01:38,840 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-15 06:01:38,841 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-15 06:01:38,841 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-15 06:01:38,841 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-15 06:01:38,841 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-15 06:01:38,842 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-15 06:01:38,842 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-15 06:01:38,843 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-15 06:01:38,843 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-15 06:01:38,843 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-15 06:01:38,843 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-15 06:01:38,844 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-15 06:01:38,844 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-15 06:01:38,845 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-15 06:01:38,845 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-15 06:01:38,845 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-15 06:01:38,845 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-15 06:01:38,846 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-15 06:01:38,846 INFO L290 TraceCheckUtils]: 120: Hoare triple {55551#(<= main_~i~0 57)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-15 06:01:38,846 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-15 06:01:38,846 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-15 06:01:38,846 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-15 06:01:38,846 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-15 06:01:38,847 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-15 06:01:38,847 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-15 06:01:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:38,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118288124] [2022-04-15 06:01:38,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118288124] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:38,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9785520] [2022-04-15 06:01:38,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:38,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:38,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:38,849 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-15 06:01:38,849 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-15 06:02:47,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2022-04-15 06:02:47,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:47,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:02:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:47,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:48,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {55489#true} call ULTIMATE.init(); {55489#true} is VALID [2022-04-15 06:02:48,372 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-15 06:02:48,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-15 06:02:48,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-15 06:02:48,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-15 06:02:48,373 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-15 06:02:48,373 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-15 06:02:48,374 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-15 06:02:48,374 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-15 06:02:48,374 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-15 06:02:48,375 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-15 06:02:48,375 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-15 06:02:48,375 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-15 06:02:48,376 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-15 06:02:48,376 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-15 06:02:48,376 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-15 06:02:48,377 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-15 06:02:48,377 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-15 06:02:48,377 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-15 06:02:48,378 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-15 06:02:48,378 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-15 06:02:48,378 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-15 06:02:48,378 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-15 06:02:48,379 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-15 06:02:48,379 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-15 06:02:48,380 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-15 06:02:48,380 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-15 06:02:48,380 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-15 06:02:48,380 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-15 06:02:48,381 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-15 06:02:48,381 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-15 06:02:48,382 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-15 06:02:48,382 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-15 06:02:48,382 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-15 06:02:48,382 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-15 06:02:48,383 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-15 06:02:48,383 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-15 06:02:48,384 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-15 06:02:48,384 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-15 06:02:48,384 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-15 06:02:48,384 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-15 06:02:48,385 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-15 06:02:48,385 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-15 06:02:48,385 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-15 06:02:48,386 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-15 06:02:48,386 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-15 06:02:48,386 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-15 06:02:48,387 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-15 06:02:48,387 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-15 06:02:48,387 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-15 06:02:48,388 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-15 06:02:48,388 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-15 06:02:48,388 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-15 06:02:48,389 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-15 06:02:48,389 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-15 06:02:48,389 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-15 06:02:48,390 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-15 06:02:48,390 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-15 06:02:48,390 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-15 06:02:48,391 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-15 06:02:48,391 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-15 06:02:48,391 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-15 06:02:48,392 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-15 06:02:48,392 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-15 06:02:48,392 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-15 06:02:48,393 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-15 06:02:48,393 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-15 06:02:48,393 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-15 06:02:48,394 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-15 06:02:48,394 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-15 06:02:48,394 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-15 06:02:48,395 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-15 06:02:48,395 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-15 06:02:48,395 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-15 06:02:48,396 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-15 06:02:48,396 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-15 06:02:48,396 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-15 06:02:48,397 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-15 06:02:48,397 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-15 06:02:48,397 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-15 06:02:48,398 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-15 06:02:48,398 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-15 06:02:48,398 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-15 06:02:48,399 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-15 06:02:48,399 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-15 06:02:48,399 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-15 06:02:48,400 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-15 06:02:48,400 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-15 06:02:48,400 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-15 06:02:48,401 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-15 06:02:48,401 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-15 06:02:48,401 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-15 06:02:48,402 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-15 06:02:48,402 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-15 06:02:48,402 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-15 06:02:48,403 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-15 06:02:48,403 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-15 06:02:48,403 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-15 06:02:48,404 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-15 06:02:48,404 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-15 06:02:48,404 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-15 06:02:48,405 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-15 06:02:48,405 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-15 06:02:48,405 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-15 06:02:48,406 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-15 06:02:48,406 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-15 06:02:48,406 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-15 06:02:48,407 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-15 06:02:48,407 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-15 06:02:48,407 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-15 06:02:48,408 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-15 06:02:48,408 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-15 06:02:48,408 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-15 06:02:48,409 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-15 06:02:48,409 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-15 06:02:48,409 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-15 06:02:48,410 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-15 06:02:48,410 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-15 06:02:48,410 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-15 06:02:48,411 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-15 06:02:48,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {55551#(<= main_~i~0 57)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-15 06:02:48,411 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-15 06:02:48,411 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-15 06:02:48,411 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-15 06:02:48,411 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-15 06:02:48,411 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-15 06:02:48,412 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-15 06:02:48,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:52,268 INFO L290 TraceCheckUtils]: 125: Hoare triple {55490#false} assume !false; {55490#false} is VALID [2022-04-15 06:02:52,268 INFO L290 TraceCheckUtils]: 124: Hoare triple {55490#false} assume 0 == ~cond; {55490#false} is VALID [2022-04-15 06:02:52,268 INFO L290 TraceCheckUtils]: 123: Hoare triple {55490#false} ~cond := #in~cond; {55490#false} is VALID [2022-04-15 06:02:52,268 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-15 06:02:52,268 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-15 06:02:52,269 INFO L290 TraceCheckUtils]: 120: Hoare triple {55947#(< main_~i~0 2048)} assume !(~i~0 < 2048); {55490#false} is VALID [2022-04-15 06:02:52,269 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-15 06:02:52,269 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-15 06:02:52,270 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-15 06:02:52,270 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-15 06:02:52,270 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-15 06:02:52,282 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-15 06:02:52,283 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-15 06:02:52,283 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-15 06:02:52,283 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-15 06:02:52,284 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-15 06:02:52,284 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-15 06:02:52,284 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-15 06:02:52,285 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-15 06:02:52,285 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-15 06:02:52,285 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-15 06:02:52,286 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-15 06:02:52,286 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-15 06:02:52,286 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-15 06:02:52,287 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-15 06:02:52,287 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-15 06:02:52,287 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-15 06:02:52,288 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-15 06:02:52,288 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-15 06:02:52,288 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-15 06:02:52,289 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-15 06:02:52,289 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-15 06:02:52,289 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-15 06:02:52,290 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-15 06:02:52,290 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-15 06:02:52,290 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-15 06:02:52,291 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-15 06:02:52,291 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-15 06:02:52,291 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-15 06:02:52,292 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-15 06:02:52,292 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-15 06:02:52,292 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-15 06:02:52,293 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-15 06:02:52,293 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-15 06:02:52,293 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-15 06:02:52,294 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-15 06:02:52,294 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-15 06:02:52,294 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-15 06:02:52,295 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-15 06:02:52,295 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-15 06:02:52,295 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-15 06:02:52,296 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-15 06:02:52,296 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-15 06:02:52,296 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-15 06:02:52,297 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-15 06:02:52,297 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-15 06:02:52,297 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-15 06:02:52,298 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-15 06:02:52,298 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-15 06:02:52,298 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-15 06:02:52,299 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-15 06:02:52,299 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-15 06:02:52,299 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-15 06:02:52,300 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-15 06:02:52,300 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-15 06:02:52,300 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-15 06:02:52,301 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-15 06:02:52,301 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-15 06:02:52,301 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-15 06:02:52,302 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-15 06:02:52,302 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-15 06:02:52,302 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-15 06:02:52,303 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-15 06:02:52,303 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-15 06:02:52,303 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-15 06:02:52,304 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-15 06:02:52,304 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-15 06:02:52,304 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-15 06:02:52,305 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-15 06:02:52,305 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-15 06:02:52,305 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-15 06:02:52,306 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-15 06:02:52,306 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-15 06:02:52,306 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-15 06:02:52,307 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-15 06:02:52,307 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-15 06:02:52,307 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-15 06:02:52,308 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-15 06:02:52,308 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-15 06:02:52,308 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-15 06:02:52,309 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-15 06:02:52,309 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-15 06:02:52,309 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-15 06:02:52,310 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-15 06:02:52,310 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-15 06:02:52,310 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-15 06:02:52,311 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-15 06:02:52,311 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-15 06:02:52,311 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-15 06:02:52,312 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-15 06:02:52,312 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-15 06:02:52,312 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-15 06:02:52,313 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-15 06:02:52,313 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-15 06:02:52,313 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-15 06:02:52,314 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-15 06:02:52,314 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-15 06:02:52,314 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-15 06:02:52,315 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-15 06:02:52,315 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-15 06:02:52,315 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-15 06:02:52,316 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-15 06:02:52,316 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-15 06:02:52,316 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-15 06:02:52,317 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-15 06:02:52,317 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-15 06:02:52,317 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-15 06:02:52,318 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-15 06:02:52,318 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-15 06:02:52,318 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-15 06:02:52,319 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-15 06:02:52,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {55489#true} call #t~ret5 := main(); {55489#true} is VALID [2022-04-15 06:02:52,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55489#true} {55489#true} #44#return; {55489#true} is VALID [2022-04-15 06:02:52,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {55489#true} assume true; {55489#true} is VALID [2022-04-15 06:02:52,319 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-15 06:02:52,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {55489#true} call ULTIMATE.init(); {55489#true} is VALID [2022-04-15 06:02:52,320 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-15 06:02:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9785520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:52,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:52,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 06:02:52,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486362330] [2022-04-15 06:02:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486362330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:52,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:52,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:02:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143245923] [2022-04-15 06:02:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:52,321 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-15 06:02:52,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:52,321 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-15 06:02:52,402 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-15 06:02:52,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:02:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:52,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:02:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 06:02:52,404 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-15 06:02:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:54,960 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-15 06:02:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:02:54,961 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-15 06:02:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:54,961 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-15 06:02:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 136 transitions. [2022-04-15 06:02:54,962 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-15 06:02:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 136 transitions. [2022-04-15 06:02:54,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 136 transitions. [2022-04-15 06:02:55,064 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-15 06:02:55,065 INFO L225 Difference]: With dead ends: 136 [2022-04-15 06:02:55,065 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 06:02:55,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:02:55,067 INFO L913 BasicCegarLoop]: 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-15 06:02:55,067 INFO L914 BasicCegarLoop]: 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-15 06:02:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 06:02:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-15 06:02:55,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:55,828 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-15 06:02:55,829 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-15 06:02:55,829 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-15 06:02:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:55,830 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-15 06:02:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2022-04-15 06:02:55,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:55,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:55,830 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-15 06:02:55,830 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-15 06:02:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:55,831 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2022-04-15 06:02:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2022-04-15 06:02:55,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:55,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:55,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:55,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:55,832 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-15 06:02:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2022-04-15 06:02:55,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2022-04-15 06:02:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:55,833 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2022-04-15 06:02:55,833 INFO L479 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-15 06:02:55,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 129 transitions. [2022-04-15 06:02:55,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2022-04-15 06:02:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 06:02:55,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:55,999 INFO L499 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:56,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-15 06:02:56,199 WARN L460 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-15 06:02:56,199 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1164814190, now seen corresponding path program 115 times [2022-04-15 06:02:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851304346] [2022-04-15 06:02:56,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:56,201 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:56,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1164814190, now seen corresponding path program 116 times [2022-04-15 06:02:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106298746] [2022-04-15 06:02:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:57,529 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-15 06:02:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-15 06:02:57,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-15 06:02:57,530 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-15 06:02:57,530 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-15 06:02:57,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-15 06:02:57,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-15 06:02:57,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-15 06:02:57,530 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-15 06:02:57,531 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-15 06:02:57,531 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-15 06:02:57,531 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-15 06:02:57,532 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-15 06:02:57,532 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-15 06:02:57,532 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-15 06:02:57,533 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-15 06:02:57,533 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-15 06:02:57,533 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-15 06:02:57,534 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-15 06:02:57,534 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-15 06:02:57,534 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-15 06:02:57,535 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-15 06:02:57,535 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-15 06:02:57,535 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-15 06:02:57,536 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-15 06:02:57,536 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-15 06:02:57,536 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-15 06:02:57,537 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-15 06:02:57,537 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-15 06:02:57,537 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-15 06:02:57,538 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-15 06:02:57,538 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-15 06:02:57,538 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-15 06:02:57,539 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-15 06:02:57,539 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-15 06:02:57,539 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-15 06:02:57,540 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-15 06:02:57,540 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-15 06:02:57,540 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-15 06:02:57,541 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-15 06:02:57,541 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-15 06:02:57,541 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-15 06:02:57,542 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-15 06:02:57,542 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-15 06:02:57,542 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-15 06:02:57,542 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-15 06:02:57,543 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-15 06:02:57,554 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-15 06:02:57,555 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-15 06:02:57,555 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-15 06:02:57,555 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-15 06:02:57,556 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-15 06:02:57,556 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-15 06:02:57,556 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-15 06:02:57,557 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-15 06:02:57,557 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-15 06:02:57,557 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-15 06:02:57,558 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-15 06:02:57,558 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-15 06:02:57,558 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-15 06:02:57,559 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-15 06:02:57,559 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-15 06:02:57,559 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-15 06:02:57,560 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-15 06:02:57,560 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-15 06:02:57,560 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-15 06:02:57,561 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-15 06:02:57,561 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-15 06:02:57,561 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-15 06:02:57,562 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-15 06:02:57,562 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-15 06:02:57,562 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-15 06:02:57,563 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-15 06:02:57,563 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-15 06:02:57,563 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-15 06:02:57,564 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-15 06:02:57,564 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-15 06:02:57,564 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-15 06:02:57,565 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-15 06:02:57,565 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-15 06:02:57,565 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-15 06:02:57,566 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-15 06:02:57,566 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-15 06:02:57,566 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-15 06:02:57,567 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-15 06:02:57,567 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-15 06:02:57,567 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-15 06:02:57,568 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-15 06:02:57,568 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-15 06:02:57,568 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-15 06:02:57,569 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-15 06:02:57,569 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-15 06:02:57,569 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-15 06:02:57,570 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-15 06:02:57,570 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-15 06:02:57,570 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-15 06:02:57,571 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-15 06:02:57,571 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-15 06:02:57,571 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-15 06:02:57,572 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-15 06:02:57,572 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-15 06:02:57,572 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-15 06:02:57,573 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-15 06:02:57,573 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-15 06:02:57,573 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-15 06:02:57,574 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-15 06:02:57,574 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-15 06:02:57,574 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-15 06:02:57,575 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-15 06:02:57,575 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-15 06:02:57,575 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-15 06:02:57,575 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-15 06:02:57,576 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-15 06:02:57,576 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-15 06:02:57,576 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-15 06:02:57,577 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-15 06:02:57,577 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-15 06:02:57,577 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-15 06:02:57,578 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-15 06:02:57,578 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-15 06:02:57,578 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-15 06:02:57,579 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-15 06:02:57,579 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-15 06:02:57,579 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-15 06:02:57,580 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-15 06:02:57,580 INFO L290 TraceCheckUtils]: 122: Hoare triple {57336#(<= main_~i~0 58)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-15 06:02:57,580 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-15 06:02:57,580 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-15 06:02:57,580 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-15 06:02:57,580 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-15 06:02:57,581 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-15 06:02:57,581 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-15 06:02:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106298746] [2022-04-15 06:02:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106298746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429148179] [2022-04-15 06:02:57,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:57,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:57,583 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-15 06:02:57,583 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-15 06:02:58,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:58,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:58,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 06:02:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:58,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:58,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {57273#true} call ULTIMATE.init(); {57273#true} is VALID [2022-04-15 06:02:58,795 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-15 06:02:58,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-15 06:02:58,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-15 06:02:58,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-15 06:02:58,795 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-15 06:02:58,796 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-15 06:02:58,796 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-15 06:02:58,796 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-15 06:02:58,797 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-15 06:02:58,797 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-15 06:02:58,797 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-15 06:02:58,798 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-15 06:02:58,798 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-15 06:02:58,798 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-15 06:02:58,799 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-15 06:02:58,799 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-15 06:02:58,799 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-15 06:02:58,800 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-15 06:02:58,800 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-15 06:02:58,800 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-15 06:02:58,801 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-15 06:02:58,801 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-15 06:02:58,801 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-15 06:02:58,802 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-15 06:02:58,802 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-15 06:02:58,802 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-15 06:02:58,803 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-15 06:02:58,803 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-15 06:02:58,803 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-15 06:02:58,804 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-15 06:02:58,804 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-15 06:02:58,804 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-15 06:02:58,805 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-15 06:02:58,805 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-15 06:02:58,805 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-15 06:02:58,806 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-15 06:02:58,806 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-15 06:02:58,806 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-15 06:02:58,807 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-15 06:02:58,807 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-15 06:02:58,807 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-15 06:02:58,808 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-15 06:02:58,808 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-15 06:02:58,808 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-15 06:02:58,809 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-15 06:02:58,809 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-15 06:02:58,809 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-15 06:02:58,810 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-15 06:02:58,810 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-15 06:02:58,810 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-15 06:02:58,811 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-15 06:02:58,811 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-15 06:02:58,811 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-15 06:02:58,812 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-15 06:02:58,812 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-15 06:02:58,812 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-15 06:02:58,813 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-15 06:02:58,813 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-15 06:02:58,813 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-15 06:02:58,814 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-15 06:02:58,814 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-15 06:02:58,814 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-15 06:02:58,815 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-15 06:02:58,815 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-15 06:02:58,815 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-15 06:02:58,816 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-15 06:02:58,816 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-15 06:02:58,816 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-15 06:02:58,817 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-15 06:02:58,817 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-15 06:02:58,817 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-15 06:02:58,818 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-15 06:02:58,818 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-15 06:02:58,818 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-15 06:02:58,819 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-15 06:02:58,819 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-15 06:02:58,820 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-15 06:02:58,820 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-15 06:02:58,820 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-15 06:02:58,820 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-15 06:02:58,821 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-15 06:02:58,821 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-15 06:02:58,822 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-15 06:02:58,822 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-15 06:02:58,822 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-15 06:02:58,822 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-15 06:02:58,823 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-15 06:02:58,823 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-15 06:02:58,824 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-15 06:02:58,824 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-15 06:02:58,824 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-15 06:02:58,824 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-15 06:02:58,825 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-15 06:02:58,825 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-15 06:02:58,826 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-15 06:02:58,826 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-15 06:02:58,826 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-15 06:02:58,826 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-15 06:02:58,827 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-15 06:02:58,827 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-15 06:02:58,828 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-15 06:02:58,828 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-15 06:02:58,828 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-15 06:02:58,829 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-15 06:02:58,829 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-15 06:02:58,829 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-15 06:02:58,830 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-15 06:02:58,830 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-15 06:02:58,830 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-15 06:02:58,831 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-15 06:02:58,831 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-15 06:02:58,831 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-15 06:02:58,832 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-15 06:02:58,832 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-15 06:02:58,832 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-15 06:02:58,833 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-15 06:02:58,833 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-15 06:02:58,833 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-15 06:02:58,834 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-15 06:02:58,834 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-15 06:02:58,834 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-15 06:02:58,835 INFO L290 TraceCheckUtils]: 122: Hoare triple {57336#(<= main_~i~0 58)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-15 06:02:58,835 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-15 06:02:58,835 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-15 06:02:58,835 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-15 06:02:58,835 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-15 06:02:58,835 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-15 06:02:58,835 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-15 06:02:58,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:02,825 INFO L290 TraceCheckUtils]: 127: Hoare triple {57274#false} assume !false; {57274#false} is VALID [2022-04-15 06:03:02,825 INFO L290 TraceCheckUtils]: 126: Hoare triple {57274#false} assume 0 == ~cond; {57274#false} is VALID [2022-04-15 06:03:02,825 INFO L290 TraceCheckUtils]: 125: Hoare triple {57274#false} ~cond := #in~cond; {57274#false} is VALID [2022-04-15 06:03:02,825 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-15 06:03:02,825 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-15 06:03:02,826 INFO L290 TraceCheckUtils]: 122: Hoare triple {57738#(< main_~i~0 2048)} assume !(~i~0 < 2048); {57274#false} is VALID [2022-04-15 06:03:02,826 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-15 06:03:02,826 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-15 06:03:02,827 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-15 06:03:02,827 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-15 06:03:02,827 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-15 06:03:02,828 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-15 06:03:02,828 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-15 06:03:02,828 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-15 06:03:02,829 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-15 06:03:02,829 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-15 06:03:02,829 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-15 06:03:02,830 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-15 06:03:02,830 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-15 06:03:02,830 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-15 06:03:02,831 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-15 06:03:02,831 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-15 06:03:02,831 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-15 06:03:02,832 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-15 06:03:02,832 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-15 06:03:02,832 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-15 06:03:02,833 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-15 06:03:02,833 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-15 06:03:02,833 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-15 06:03:02,834 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-15 06:03:02,834 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-15 06:03:02,834 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-15 06:03:02,835 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-15 06:03:02,835 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-15 06:03:02,835 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-15 06:03:02,836 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-15 06:03:02,836 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-15 06:03:02,836 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-15 06:03:02,837 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-15 06:03:02,837 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-15 06:03:02,837 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-15 06:03:02,838 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-15 06:03:02,838 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-15 06:03:02,838 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-15 06:03:02,839 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-15 06:03:02,839 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-15 06:03:02,839 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-15 06:03:02,840 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-15 06:03:02,840 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-15 06:03:02,840 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-15 06:03:02,841 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-15 06:03:02,841 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-15 06:03:02,841 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-15 06:03:02,842 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-15 06:03:02,842 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-15 06:03:02,842 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-15 06:03:02,843 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-15 06:03:02,843 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-15 06:03:02,843 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-15 06:03:02,844 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-15 06:03:02,844 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-15 06:03:02,844 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-15 06:03:02,845 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-15 06:03:02,845 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-15 06:03:02,845 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-15 06:03:02,846 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-15 06:03:02,846 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-15 06:03:02,846 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-15 06:03:02,847 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-15 06:03:02,847 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-15 06:03:02,847 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-15 06:03:02,848 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-15 06:03:02,848 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-15 06:03:02,848 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-15 06:03:02,849 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-15 06:03:02,849 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-15 06:03:02,849 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-15 06:03:02,850 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-15 06:03:02,850 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-15 06:03:02,850 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-15 06:03:02,851 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-15 06:03:02,851 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-15 06:03:02,851 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-15 06:03:02,852 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-15 06:03:02,852 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-15 06:03:02,852 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-15 06:03:02,853 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-15 06:03:02,853 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-15 06:03:02,853 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-15 06:03:02,854 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-15 06:03:02,854 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-15 06:03:02,854 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-15 06:03:02,855 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-15 06:03:02,855 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-15 06:03:02,855 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-15 06:03:02,856 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-15 06:03:02,856 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-15 06:03:02,856 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-15 06:03:02,857 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-15 06:03:02,857 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-15 06:03:02,857 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-15 06:03:02,858 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-15 06:03:02,858 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-15 06:03:02,858 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-15 06:03:02,859 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-15 06:03:02,859 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-15 06:03:02,859 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-15 06:03:02,860 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-15 06:03:02,860 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-15 06:03:02,860 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-15 06:03:02,861 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-15 06:03:02,861 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-15 06:03:02,861 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-15 06:03:02,862 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-15 06:03:02,862 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-15 06:03:02,862 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-15 06:03:02,863 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-15 06:03:02,863 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-15 06:03:02,863 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-15 06:03:02,864 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-15 06:03:02,864 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-15 06:03:02,864 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-15 06:03:02,865 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-15 06:03:02,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {57273#true} call #t~ret5 := main(); {57273#true} is VALID [2022-04-15 06:03:02,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57273#true} {57273#true} #44#return; {57273#true} is VALID [2022-04-15 06:03:02,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {57273#true} assume true; {57273#true} is VALID [2022-04-15 06:03:02,865 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-15 06:03:02,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {57273#true} call ULTIMATE.init(); {57273#true} is VALID [2022-04-15 06:03:02,866 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-15 06:03:02,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429148179] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:02,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:02,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 06:03:02,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:02,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851304346] [2022-04-15 06:03:02,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851304346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:02,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:02,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:03:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275949061] [2022-04-15 06:03:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:02,867 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-15 06:03:02,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:02,867 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-15 06:03:02,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:02,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:03:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:03:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 06:03:02,951 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-15 06:03:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:05,540 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-15 06:03:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:03:05,540 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-15 06:03:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:05,540 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-15 06:03:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 138 transitions. [2022-04-15 06:03:05,541 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-15 06:03:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 138 transitions. [2022-04-15 06:03:05,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 138 transitions. [2022-04-15 06:03:05,644 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-15 06:03:05,645 INFO L225 Difference]: With dead ends: 138 [2022-04-15 06:03:05,645 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 06:03:05,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 06:03:05,647 INFO L913 BasicCegarLoop]: 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-15 06:03:05,647 INFO L914 BasicCegarLoop]: 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-15 06:03:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 06:03:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-04-15 06:03:06,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:06,427 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-15 06:03:06,427 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-15 06:03:06,427 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-15 06:03:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:06,428 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-15 06:03:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2022-04-15 06:03:06,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:06,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:06,429 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-15 06:03:06,429 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-15 06:03:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:06,430 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2022-04-15 06:03:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2022-04-15 06:03:06,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:06,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:06,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:06,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:06,431 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-15 06:03:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2022-04-15 06:03:06,433 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2022-04-15 06:03:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:06,433 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2022-04-15 06:03:06,433 INFO L479 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-15 06:03:06,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 131 transitions. [2022-04-15 06:03:06,634 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-15 06:03:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2022-04-15 06:03:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:03:06,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:06,635 INFO L499 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:06,663 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-15 06:03:06,846 WARN L460 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-15 06:03:06,846 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1820852240, now seen corresponding path program 117 times [2022-04-15 06:03:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854026776] [2022-04-15 06:03:06,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:06,848 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:06,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1820852240, now seen corresponding path program 118 times [2022-04-15 06:03:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:06,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044074094] [2022-04-15 06:03:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:08,165 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-15 06:03:08,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-15 06:03:08,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-15 06:03:08,165 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-15 06:03:08,166 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-15 06:03:08,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-15 06:03:08,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-15 06:03:08,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-15 06:03:08,166 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-15 06:03:08,166 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-15 06:03:08,167 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-15 06:03:08,167 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-15 06:03:08,167 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-15 06:03:08,168 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-15 06:03:08,168 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-15 06:03:08,168 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-15 06:03:08,169 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-15 06:03:08,169 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-15 06:03:08,169 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-15 06:03:08,170 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-15 06:03:08,170 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-15 06:03:08,170 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-15 06:03:08,171 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-15 06:03:08,171 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-15 06:03:08,171 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-15 06:03:08,172 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-15 06:03:08,172 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-15 06:03:08,172 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-15 06:03:08,173 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-15 06:03:08,173 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-15 06:03:08,173 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-15 06:03:08,174 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-15 06:03:08,174 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-15 06:03:08,174 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-15 06:03:08,175 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-15 06:03:08,175 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-15 06:03:08,175 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-15 06:03:08,175 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-15 06:03:08,176 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-15 06:03:08,176 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-15 06:03:08,176 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-15 06:03:08,177 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-15 06:03:08,177 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-15 06:03:08,177 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-15 06:03:08,178 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-15 06:03:08,178 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-15 06:03:08,178 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-15 06:03:08,179 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-15 06:03:08,179 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-15 06:03:08,179 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-15 06:03:08,180 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-15 06:03:08,180 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-15 06:03:08,180 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-15 06:03:08,181 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-15 06:03:08,181 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-15 06:03:08,181 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-15 06:03:08,182 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-15 06:03:08,182 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-15 06:03:08,182 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-15 06:03:08,183 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-15 06:03:08,183 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-15 06:03:08,183 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-15 06:03:08,184 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-15 06:03:08,184 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-15 06:03:08,184 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-15 06:03:08,185 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-15 06:03:08,185 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-15 06:03:08,185 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-15 06:03:08,186 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-15 06:03:08,186 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-15 06:03:08,186 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-15 06:03:08,187 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-15 06:03:08,187 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-15 06:03:08,187 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-15 06:03:08,188 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-15 06:03:08,188 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-15 06:03:08,188 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-15 06:03:08,189 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-15 06:03:08,189 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-15 06:03:08,189 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-15 06:03:08,190 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-15 06:03:08,190 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-15 06:03:08,190 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-15 06:03:08,191 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-15 06:03:08,191 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-15 06:03:08,191 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-15 06:03:08,192 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-15 06:03:08,192 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-15 06:03:08,192 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-15 06:03:08,192 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-15 06:03:08,193 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-15 06:03:08,193 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-15 06:03:08,193 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-15 06:03:08,194 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-15 06:03:08,194 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-15 06:03:08,194 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-15 06:03:08,195 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-15 06:03:08,195 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-15 06:03:08,195 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-15 06:03:08,196 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-15 06:03:08,196 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-15 06:03:08,196 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-15 06:03:08,197 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-15 06:03:08,197 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-15 06:03:08,197 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-15 06:03:08,198 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-15 06:03:08,198 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-15 06:03:08,198 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-15 06:03:08,199 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-15 06:03:08,199 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-15 06:03:08,199 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-15 06:03:08,200 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-15 06:03:08,200 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-15 06:03:08,200 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-15 06:03:08,201 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-15 06:03:08,201 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-15 06:03:08,201 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-15 06:03:08,202 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-15 06:03:08,202 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-15 06:03:08,202 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-15 06:03:08,203 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-15 06:03:08,203 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-15 06:03:08,203 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-15 06:03:08,204 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-15 06:03:08,204 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-15 06:03:08,204 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-15 06:03:08,205 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-15 06:03:08,205 INFO L290 TraceCheckUtils]: 124: Hoare triple {59149#(<= main_~i~0 59)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-15 06:03:08,205 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-15 06:03:08,205 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-15 06:03:08,205 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-15 06:03:08,205 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-15 06:03:08,205 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-15 06:03:08,206 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-15 06:03:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044074094] [2022-04-15 06:03:08,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044074094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049018873] [2022-04-15 06:03:08,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:08,207 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-15 06:03:08,208 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-15 06:03:08,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:08,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:08,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 06:03:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:08,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:09,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {59085#true} call ULTIMATE.init(); {59085#true} is VALID [2022-04-15 06:03:09,414 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-15 06:03:09,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-15 06:03:09,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-15 06:03:09,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-15 06:03:09,415 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-15 06:03:09,415 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-15 06:03:09,415 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-15 06:03:09,416 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-15 06:03:09,416 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-15 06:03:09,416 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-15 06:03:09,417 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-15 06:03:09,417 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-15 06:03:09,417 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-15 06:03:09,418 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-15 06:03:09,418 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-15 06:03:09,418 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-15 06:03:09,419 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-15 06:03:09,419 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-15 06:03:09,419 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-15 06:03:09,420 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-15 06:03:09,420 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-15 06:03:09,420 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-15 06:03:09,421 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-15 06:03:09,421 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-15 06:03:09,421 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-15 06:03:09,422 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-15 06:03:09,422 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-15 06:03:09,422 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-15 06:03:09,423 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-15 06:03:09,423 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-15 06:03:09,423 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-15 06:03:09,424 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-15 06:03:09,424 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-15 06:03:09,424 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-15 06:03:09,425 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-15 06:03:09,425 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-15 06:03:09,425 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-15 06:03:09,426 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-15 06:03:09,426 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-15 06:03:09,426 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-15 06:03:09,427 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-15 06:03:09,427 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-15 06:03:09,427 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-15 06:03:09,427 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-15 06:03:09,428 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-15 06:03:09,428 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-15 06:03:09,429 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-15 06:03:09,429 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-15 06:03:09,429 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-15 06:03:09,429 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-15 06:03:09,430 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-15 06:03:09,430 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-15 06:03:09,430 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-15 06:03:09,431 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-15 06:03:09,431 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-15 06:03:09,431 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-15 06:03:09,432 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-15 06:03:09,432 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-15 06:03:09,432 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-15 06:03:09,433 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-15 06:03:09,433 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-15 06:03:09,433 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-15 06:03:09,434 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-15 06:03:09,434 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-15 06:03:09,434 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-15 06:03:09,435 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-15 06:03:09,435 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-15 06:03:09,435 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-15 06:03:09,436 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-15 06:03:09,436 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-15 06:03:09,436 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-15 06:03:09,437 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-15 06:03:09,437 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-15 06:03:09,437 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-15 06:03:09,438 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-15 06:03:09,438 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-15 06:03:09,438 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-15 06:03:09,439 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-15 06:03:09,439 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-15 06:03:09,439 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-15 06:03:09,440 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-15 06:03:09,440 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-15 06:03:09,440 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-15 06:03:09,441 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-15 06:03:09,441 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-15 06:03:09,441 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-15 06:03:09,442 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-15 06:03:09,442 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-15 06:03:09,442 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-15 06:03:09,443 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-15 06:03:09,443 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-15 06:03:09,443 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-15 06:03:09,444 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-15 06:03:09,444 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-15 06:03:09,444 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-15 06:03:09,444 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-15 06:03:09,445 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-15 06:03:09,445 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-15 06:03:09,446 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-15 06:03:09,446 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-15 06:03:09,446 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-15 06:03:09,446 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-15 06:03:09,447 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-15 06:03:09,447 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-15 06:03:09,447 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-15 06:03:09,448 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-15 06:03:09,448 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-15 06:03:09,448 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-15 06:03:09,449 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-15 06:03:09,449 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-15 06:03:09,449 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-15 06:03:09,450 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-15 06:03:09,450 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-15 06:03:09,450 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-15 06:03:09,451 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-15 06:03:09,451 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-15 06:03:09,451 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-15 06:03:09,452 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-15 06:03:09,452 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-15 06:03:09,452 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-15 06:03:09,453 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-15 06:03:09,453 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-15 06:03:09,453 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-15 06:03:09,454 INFO L290 TraceCheckUtils]: 124: Hoare triple {59149#(<= main_~i~0 59)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-15 06:03:09,454 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-15 06:03:09,454 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-15 06:03:09,454 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-15 06:03:09,454 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-15 06:03:09,454 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-15 06:03:09,455 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-15 06:03:09,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:13,553 INFO L290 TraceCheckUtils]: 129: Hoare triple {59086#false} assume !false; {59086#false} is VALID [2022-04-15 06:03:13,553 INFO L290 TraceCheckUtils]: 128: Hoare triple {59086#false} assume 0 == ~cond; {59086#false} is VALID [2022-04-15 06:03:13,553 INFO L290 TraceCheckUtils]: 127: Hoare triple {59086#false} ~cond := #in~cond; {59086#false} is VALID [2022-04-15 06:03:13,553 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-15 06:03:13,553 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-15 06:03:13,554 INFO L290 TraceCheckUtils]: 124: Hoare triple {59557#(< main_~i~0 2048)} assume !(~i~0 < 2048); {59086#false} is VALID [2022-04-15 06:03:13,554 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-15 06:03:13,554 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-15 06:03:13,555 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-15 06:03:13,555 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-15 06:03:13,555 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-15 06:03:13,556 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-15 06:03:13,556 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-15 06:03:13,556 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-15 06:03:13,557 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-15 06:03:13,557 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-15 06:03:13,557 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-15 06:03:13,558 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-15 06:03:13,558 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-15 06:03:13,558 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-15 06:03:13,559 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-15 06:03:13,559 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-15 06:03:13,559 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-15 06:03:13,560 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-15 06:03:13,560 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-15 06:03:13,560 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-15 06:03:13,561 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-15 06:03:13,561 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-15 06:03:13,561 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-15 06:03:13,562 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-15 06:03:13,562 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-15 06:03:13,562 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-15 06:03:13,563 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-15 06:03:13,563 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-15 06:03:13,563 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-15 06:03:13,564 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-15 06:03:13,564 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-15 06:03:13,564 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-15 06:03:13,565 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-15 06:03:13,565 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-15 06:03:13,565 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-15 06:03:13,566 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-15 06:03:13,566 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-15 06:03:13,566 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-15 06:03:13,567 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-15 06:03:13,567 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-15 06:03:13,567 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-15 06:03:13,568 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-15 06:03:13,568 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-15 06:03:13,568 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-15 06:03:13,569 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-15 06:03:13,569 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-15 06:03:13,569 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-15 06:03:13,570 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-15 06:03:13,570 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-15 06:03:13,570 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-15 06:03:13,571 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-15 06:03:13,571 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-15 06:03:13,571 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-15 06:03:13,572 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-15 06:03:13,572 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-15 06:03:13,572 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-15 06:03:13,573 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-15 06:03:13,573 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-15 06:03:13,573 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-15 06:03:13,574 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-15 06:03:13,574 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-15 06:03:13,574 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-15 06:03:13,575 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-15 06:03:13,575 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-15 06:03:13,575 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-15 06:03:13,576 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-15 06:03:13,576 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-15 06:03:13,576 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-15 06:03:13,577 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-15 06:03:13,577 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-15 06:03:13,577 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-15 06:03:13,578 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-15 06:03:13,578 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-15 06:03:13,578 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-15 06:03:13,579 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-15 06:03:13,579 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-15 06:03:13,580 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-15 06:03:13,580 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-15 06:03:13,580 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-15 06:03:13,580 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-15 06:03:13,581 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-15 06:03:13,581 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-15 06:03:13,582 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-15 06:03:13,582 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-15 06:03:13,582 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-15 06:03:13,582 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-15 06:03:13,583 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-15 06:03:13,583 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-15 06:03:13,584 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-15 06:03:13,584 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-15 06:03:13,584 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-15 06:03:13,585 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-15 06:03:13,585 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-15 06:03:13,585 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-15 06:03:13,586 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-15 06:03:13,586 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-15 06:03:13,586 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-15 06:03:13,587 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-15 06:03:13,587 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-15 06:03:13,587 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-15 06:03:13,588 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-15 06:03:13,588 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-15 06:03:13,588 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-15 06:03:13,589 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-15 06:03:13,589 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-15 06:03:13,589 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-15 06:03:13,590 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-15 06:03:13,590 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-15 06:03:13,590 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-15 06:03:13,591 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-15 06:03:13,591 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-15 06:03:13,591 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-15 06:03:13,592 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-15 06:03:13,592 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-15 06:03:13,592 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-15 06:03:13,593 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-15 06:03:13,593 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-15 06:03:13,593 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-15 06:03:13,594 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-15 06:03:13,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {59085#true} call #t~ret5 := main(); {59085#true} is VALID [2022-04-15 06:03:13,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59085#true} {59085#true} #44#return; {59085#true} is VALID [2022-04-15 06:03:13,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {59085#true} assume true; {59085#true} is VALID [2022-04-15 06:03:13,594 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-15 06:03:13,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {59085#true} call ULTIMATE.init(); {59085#true} is VALID [2022-04-15 06:03:13,595 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-15 06:03:13,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049018873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:13,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:13,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-15 06:03:13,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:13,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854026776] [2022-04-15 06:03:13,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854026776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:13,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:03:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991183882] [2022-04-15 06:03:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:13,596 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-15 06:03:13,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:13,596 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-15 06:03:13,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:13,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:03:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:03:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7505, Invalid=7747, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 06:03:13,683 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-15 06:03:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:16,396 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-15 06:03:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:03:16,396 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-15 06:03:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:16,396 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-15 06:03:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 140 transitions. [2022-04-15 06:03:16,397 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-15 06:03:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 140 transitions. [2022-04-15 06:03:16,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 140 transitions. [2022-04-15 06:03:16,502 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-15 06:03:16,503 INFO L225 Difference]: With dead ends: 140 [2022-04-15 06:03:16,503 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 06:03:16,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=14886, Invalid=18786, Unknown=0, NotChecked=0, Total=33672 [2022-04-15 06:03:16,505 INFO L913 BasicCegarLoop]: 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-15 06:03:16,505 INFO L914 BasicCegarLoop]: 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-15 06:03:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 06:03:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-15 06:03:17,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:17,306 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-15 06:03:17,306 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-15 06:03:17,306 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-15 06:03:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:17,308 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-15 06:03:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2022-04-15 06:03:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:17,308 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-15 06:03:17,308 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-15 06:03:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:17,309 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2022-04-15 06:03:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2022-04-15 06:03:17,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:17,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:17,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:17,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:17,309 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-15 06:03:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2022-04-15 06:03:17,311 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2022-04-15 06:03:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:17,311 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2022-04-15 06:03:17,311 INFO L479 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-15 06:03:17,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 133 transitions. [2022-04-15 06:03:17,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2022-04-15 06:03:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 06:03:17,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:17,483 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:17,502 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-15 06:03:17,684 WARN L460 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-15 06:03:17,684 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 913225778, now seen corresponding path program 119 times [2022-04-15 06:03:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928232022] [2022-04-15 06:03:17,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:17,687 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:17,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:17,687 INFO L85 PathProgramCache]: Analyzing trace with hash 913225778, now seen corresponding path program 120 times [2022-04-15 06:03:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:17,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002859384] [2022-04-15 06:03:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,065 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-15 06:03:19,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-15 06:03:19,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-15 06:03:19,066 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-15 06:03:19,066 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-15 06:03:19,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-15 06:03:19,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-15 06:03:19,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-15 06:03:19,067 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-15 06:03:19,067 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-15 06:03:19,067 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-15 06:03:19,067 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-15 06:03:19,068 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-15 06:03:19,068 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-15 06:03:19,068 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-15 06:03:19,069 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-15 06:03:19,069 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-15 06:03:19,069 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-15 06:03:19,070 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-15 06:03:19,070 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-15 06:03:19,070 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-15 06:03:19,071 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-15 06:03:19,071 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-15 06:03:19,071 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-15 06:03:19,072 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-15 06:03:19,072 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-15 06:03:19,072 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-15 06:03:19,073 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-15 06:03:19,073 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-15 06:03:19,073 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-15 06:03:19,074 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-15 06:03:19,074 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-15 06:03:19,074 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-15 06:03:19,075 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-15 06:03:19,075 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-15 06:03:19,075 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-15 06:03:19,076 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-15 06:03:19,076 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-15 06:03:19,076 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-15 06:03:19,077 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-15 06:03:19,087 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-15 06:03:19,088 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-15 06:03:19,088 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-15 06:03:19,088 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-15 06:03:19,089 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-15 06:03:19,089 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-15 06:03:19,090 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-15 06:03:19,090 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-15 06:03:19,090 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-15 06:03:19,090 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-15 06:03:19,091 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-15 06:03:19,091 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-15 06:03:19,092 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-15 06:03:19,092 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-15 06:03:19,092 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-15 06:03:19,092 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-15 06:03:19,093 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-15 06:03:19,093 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-15 06:03:19,093 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-15 06:03:19,094 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-15 06:03:19,094 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-15 06:03:19,094 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-15 06:03:19,095 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-15 06:03:19,095 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-15 06:03:19,095 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-15 06:03:19,096 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-15 06:03:19,096 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-15 06:03:19,096 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-15 06:03:19,097 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-15 06:03:19,097 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-15 06:03:19,097 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-15 06:03:19,098 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-15 06:03:19,098 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-15 06:03:19,098 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-15 06:03:19,099 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-15 06:03:19,099 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-15 06:03:19,099 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-15 06:03:19,100 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-15 06:03:19,100 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-15 06:03:19,100 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-15 06:03:19,101 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-15 06:03:19,101 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-15 06:03:19,101 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-15 06:03:19,102 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-15 06:03:19,102 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-15 06:03:19,102 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-15 06:03:19,103 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-15 06:03:19,103 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-15 06:03:19,103 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-15 06:03:19,104 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-15 06:03:19,104 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-15 06:03:19,104 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-15 06:03:19,105 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-15 06:03:19,105 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-15 06:03:19,105 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-15 06:03:19,106 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-15 06:03:19,106 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-15 06:03:19,106 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-15 06:03:19,107 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-15 06:03:19,107 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-15 06:03:19,107 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-15 06:03:19,108 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-15 06:03:19,108 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-15 06:03:19,108 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-15 06:03:19,109 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-15 06:03:19,109 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-15 06:03:19,109 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-15 06:03:19,110 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-15 06:03:19,110 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-15 06:03:19,110 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-15 06:03:19,111 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-15 06:03:19,111 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-15 06:03:19,111 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-15 06:03:19,112 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-15 06:03:19,112 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-15 06:03:19,112 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-15 06:03:19,113 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-15 06:03:19,113 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-15 06:03:19,113 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-15 06:03:19,114 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-15 06:03:19,114 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-15 06:03:19,114 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-15 06:03:19,115 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-15 06:03:19,115 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-15 06:03:19,115 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-15 06:03:19,116 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-15 06:03:19,116 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-15 06:03:19,116 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-15 06:03:19,117 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-15 06:03:19,117 INFO L290 TraceCheckUtils]: 126: Hoare triple {60990#(<= main_~i~0 60)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-15 06:03:19,117 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-15 06:03:19,117 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-15 06:03:19,117 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-15 06:03:19,117 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-15 06:03:19,117 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-15 06:03:19,118 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-15 06:03:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:19,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002859384] [2022-04-15 06:03:19,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002859384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:19,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393498362] [2022-04-15 06:03:19,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:19,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:19,120 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-15 06:03:19,120 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-15 06:04:40,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2022-04-15 06:04:40,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:40,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-15 06:04:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:40,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:40,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {60925#true} call ULTIMATE.init(); {60925#true} is VALID [2022-04-15 06:04:40,970 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-15 06:04:40,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-15 06:04:40,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-15 06:04:40,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-15 06:04:40,971 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-15 06:04:40,971 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-15 06:04:40,971 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-15 06:04:40,972 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-15 06:04:40,972 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-15 06:04:40,972 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-15 06:04:40,973 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-15 06:04:40,973 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-15 06:04:40,973 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-15 06:04:40,974 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-15 06:04:40,974 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-15 06:04:40,974 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-15 06:04:40,975 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-15 06:04:40,975 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-15 06:04:40,975 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-15 06:04:40,976 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-15 06:04:40,976 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-15 06:04:40,976 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-15 06:04:40,977 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-15 06:04:40,977 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-15 06:04:40,977 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-15 06:04:40,978 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-15 06:04:40,978 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-15 06:04:40,978 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-15 06:04:40,979 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-15 06:04:40,979 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-15 06:04:40,979 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-15 06:04:40,980 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-15 06:04:40,980 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-15 06:04:40,980 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-15 06:04:40,981 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-15 06:04:40,981 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-15 06:04:40,981 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-15 06:04:40,982 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-15 06:04:40,982 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-15 06:04:40,982 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-15 06:04:40,983 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-15 06:04:40,983 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-15 06:04:40,983 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-15 06:04:40,984 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-15 06:04:40,984 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-15 06:04:40,984 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-15 06:04:40,985 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-15 06:04:40,985 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-15 06:04:40,985 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-15 06:04:40,986 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-15 06:04:40,986 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-15 06:04:40,986 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-15 06:04:40,987 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-15 06:04:40,987 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-15 06:04:40,987 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-15 06:04:40,988 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-15 06:04:40,988 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-15 06:04:40,988 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-15 06:04:40,989 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-15 06:04:40,989 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-15 06:04:40,989 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-15 06:04:40,989 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-15 06:04:40,990 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-15 06:04:40,990 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-15 06:04:40,991 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-15 06:04:40,991 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-15 06:04:40,991 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-15 06:04:40,991 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-15 06:04:40,992 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-15 06:04:40,992 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-15 06:04:40,993 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-15 06:04:40,993 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-15 06:04:40,993 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-15 06:04:40,993 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-15 06:04:40,994 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-15 06:04:40,994 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-15 06:04:40,994 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-15 06:04:40,995 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-15 06:04:40,995 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-15 06:04:40,995 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-15 06:04:40,996 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-15 06:04:40,996 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-15 06:04:40,996 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-15 06:04:40,997 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-15 06:04:40,997 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-15 06:04:40,997 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-15 06:04:40,998 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-15 06:04:40,998 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-15 06:04:40,998 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-15 06:04:40,999 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-15 06:04:40,999 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-15 06:04:40,999 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-15 06:04:41,000 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-15 06:04:41,000 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-15 06:04:41,000 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-15 06:04:41,001 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-15 06:04:41,001 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-15 06:04:41,001 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-15 06:04:41,002 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-15 06:04:41,002 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-15 06:04:41,002 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-15 06:04:41,003 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-15 06:04:41,003 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-15 06:04:41,003 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-15 06:04:41,004 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-15 06:04:41,004 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-15 06:04:41,004 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-15 06:04:41,005 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-15 06:04:41,005 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-15 06:04:41,005 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-15 06:04:41,006 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-15 06:04:41,006 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-15 06:04:41,006 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-15 06:04:41,007 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-15 06:04:41,007 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-15 06:04:41,007 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-15 06:04:41,008 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-15 06:04:41,008 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-15 06:04:41,008 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-15 06:04:41,009 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-15 06:04:41,009 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-15 06:04:41,009 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-15 06:04:41,010 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-15 06:04:41,010 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-15 06:04:41,027 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-15 06:04:41,027 INFO L290 TraceCheckUtils]: 126: Hoare triple {60990#(<= main_~i~0 60)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-15 06:04:41,027 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-15 06:04:41,027 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-15 06:04:41,027 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-15 06:04:41,027 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-15 06:04:41,027 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-15 06:04:41,028 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-15 06:04:41,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:45,210 INFO L290 TraceCheckUtils]: 131: Hoare triple {60926#false} assume !false; {60926#false} is VALID [2022-04-15 06:04:45,210 INFO L290 TraceCheckUtils]: 130: Hoare triple {60926#false} assume 0 == ~cond; {60926#false} is VALID [2022-04-15 06:04:45,210 INFO L290 TraceCheckUtils]: 129: Hoare triple {60926#false} ~cond := #in~cond; {60926#false} is VALID [2022-04-15 06:04:45,210 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-15 06:04:45,210 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-15 06:04:45,211 INFO L290 TraceCheckUtils]: 126: Hoare triple {61404#(< main_~i~0 2048)} assume !(~i~0 < 2048); {60926#false} is VALID [2022-04-15 06:04:45,211 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-15 06:04:45,211 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-15 06:04:45,212 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-15 06:04:45,212 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-15 06:04:45,212 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-15 06:04:45,213 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-15 06:04:45,213 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-15 06:04:45,213 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-15 06:04:45,214 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-15 06:04:45,214 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-15 06:04:45,214 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-15 06:04:45,215 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-15 06:04:45,215 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-15 06:04:45,215 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-15 06:04:45,216 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-15 06:04:45,216 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-15 06:04:45,216 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-15 06:04:45,217 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-15 06:04:45,217 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-15 06:04:45,217 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-15 06:04:45,218 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-15 06:04:45,218 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-15 06:04:45,218 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-15 06:04:45,219 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-15 06:04:45,219 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-15 06:04:45,219 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-15 06:04:45,220 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-15 06:04:45,220 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-15 06:04:45,220 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-15 06:04:45,221 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-15 06:04:45,221 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-15 06:04:45,221 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-15 06:04:45,222 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-15 06:04:45,222 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-15 06:04:45,222 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-15 06:04:45,223 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-15 06:04:45,223 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-15 06:04:45,223 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-15 06:04:45,224 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-15 06:04:45,224 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-15 06:04:45,224 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-15 06:04:45,225 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-15 06:04:45,225 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-15 06:04:45,225 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-15 06:04:45,226 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-15 06:04:45,226 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-15 06:04:45,226 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-15 06:04:45,227 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-15 06:04:45,227 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-15 06:04:45,227 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-15 06:04:45,228 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-15 06:04:45,228 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-15 06:04:45,228 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-15 06:04:45,229 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-15 06:04:45,229 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-15 06:04:45,229 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-15 06:04:45,230 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-15 06:04:45,230 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-15 06:04:45,230 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-15 06:04:45,231 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-15 06:04:45,231 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-15 06:04:45,231 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-15 06:04:45,232 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-15 06:04:45,232 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-15 06:04:45,232 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-15 06:04:45,233 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-15 06:04:45,233 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-15 06:04:45,233 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-15 06:04:45,234 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-15 06:04:45,234 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-15 06:04:45,234 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-15 06:04:45,235 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-15 06:04:45,235 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-15 06:04:45,235 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-15 06:04:45,236 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-15 06:04:45,236 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-15 06:04:45,236 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-15 06:04:45,237 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-15 06:04:45,237 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-15 06:04:45,237 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-15 06:04:45,238 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-15 06:04:45,238 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-15 06:04:45,238 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-15 06:04:45,239 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-15 06:04:45,239 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-15 06:04:45,239 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-15 06:04:45,240 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-15 06:04:45,240 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-15 06:04:45,240 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-15 06:04:45,241 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-15 06:04:45,241 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-15 06:04:45,241 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-15 06:04:45,242 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-15 06:04:45,242 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-15 06:04:45,242 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-15 06:04:45,243 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-15 06:04:45,243 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-15 06:04:45,243 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-15 06:04:45,244 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-15 06:04:45,244 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-15 06:04:45,244 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-15 06:04:45,245 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-15 06:04:45,245 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-15 06:04:45,245 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-15 06:04:45,246 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-15 06:04:45,246 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-15 06:04:45,246 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-15 06:04:45,247 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-15 06:04:45,247 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-15 06:04:45,247 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-15 06:04:45,248 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-15 06:04:45,248 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-15 06:04:45,248 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-15 06:04:45,248 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-15 06:04:45,261 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-15 06:04:45,261 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-15 06:04:45,261 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-15 06:04:45,262 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-15 06:04:45,262 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-15 06:04:45,262 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-15 06:04:45,263 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-15 06:04:45,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {60925#true} call #t~ret5 := main(); {60925#true} is VALID [2022-04-15 06:04:45,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60925#true} {60925#true} #44#return; {60925#true} is VALID [2022-04-15 06:04:45,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {60925#true} assume true; {60925#true} is VALID [2022-04-15 06:04:45,263 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-15 06:04:45,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {60925#true} call ULTIMATE.init(); {60925#true} is VALID [2022-04-15 06:04:45,264 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-15 06:04:45,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393498362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:45,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:45,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-15 06:04:45,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:45,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928232022] [2022-04-15 06:04:45,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928232022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:45,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:45,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:04:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130810102] [2022-04-15 06:04:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:45,265 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-15 06:04:45,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:45,265 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-15 06:04:45,349 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-15 06:04:45,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:04:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:45,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:04:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-15 06:04:45,351 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-15 06:04:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:48,055 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2022-04-15 06:04:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:04:48,055 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-15 06:04:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:48,055 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-15 06:04:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 142 transitions. [2022-04-15 06:04:48,056 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-15 06:04:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 142 transitions. [2022-04-15 06:04:48,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 142 transitions. [2022-04-15 06:04:48,191 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-15 06:04:48,193 INFO L225 Difference]: With dead ends: 142 [2022-04-15 06:04:48,193 INFO L226 Difference]: Without dead ends: 136 [2022-04-15 06:04:48,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-15 06:04:48,195 INFO L913 BasicCegarLoop]: 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-15 06:04:48,195 INFO L914 BasicCegarLoop]: 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-15 06:04:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-15 06:04:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-04-15 06:04:49,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:49,003 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-15 06:04:49,004 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-15 06:04:49,004 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-15 06:04:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:49,005 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-15 06:04:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2022-04-15 06:04:49,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:49,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:49,005 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-15 06:04:49,006 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-15 06:04:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:49,007 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2022-04-15 06:04:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2022-04-15 06:04:49,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:49,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:49,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:49,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:49,007 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-15 06:04:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2022-04-15 06:04:49,008 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2022-04-15 06:04:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:49,008 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2022-04-15 06:04:49,008 INFO L479 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-15 06:04:49,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 135 transitions. [2022-04-15 06:04:49,189 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-15 06:04:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2022-04-15 06:04:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 06:04:49,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:49,190 INFO L499 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:49,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-15 06:04:49,391 WARN L460 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-15 06:04:49,391 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 562556884, now seen corresponding path program 121 times [2022-04-15 06:04:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783447753] [2022-04-15 06:04:49,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:49,406 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:49,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash 562556884, now seen corresponding path program 122 times [2022-04-15 06:04:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062950685] [2022-04-15 06:04:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:50,812 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-15 06:04:50,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-15 06:04:50,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-15 06:04:50,813 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-15 06:04:50,813 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-15 06:04:50,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-15 06:04:50,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-15 06:04:50,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-15 06:04:50,813 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-15 06:04:50,814 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-15 06:04:50,814 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-15 06:04:50,814 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-15 06:04:50,815 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-15 06:04:50,815 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-15 06:04:50,815 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-15 06:04:50,816 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-15 06:04:50,816 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-15 06:04:50,816 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-15 06:04:50,817 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-15 06:04:50,817 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-15 06:04:50,817 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-15 06:04:50,817 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-15 06:04:50,818 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-15 06:04:50,818 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-15 06:04:50,818 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-15 06:04:50,819 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-15 06:04:50,819 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-15 06:04:50,819 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-15 06:04:50,820 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-15 06:04:50,820 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-15 06:04:50,820 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-15 06:04:50,821 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-15 06:04:50,821 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-15 06:04:50,821 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-15 06:04:50,822 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-15 06:04:50,822 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-15 06:04:50,822 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-15 06:04:50,823 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-15 06:04:50,823 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-15 06:04:50,823 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-15 06:04:50,824 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-15 06:04:50,824 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-15 06:04:50,824 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-15 06:04:50,825 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-15 06:04:50,825 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-15 06:04:50,825 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-15 06:04:50,826 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-15 06:04:50,826 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-15 06:04:50,826 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-15 06:04:50,827 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-15 06:04:50,827 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-15 06:04:50,827 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-15 06:04:50,828 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-15 06:04:50,828 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-15 06:04:50,828 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-15 06:04:50,828 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-15 06:04:50,829 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-15 06:04:50,829 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-15 06:04:50,829 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-15 06:04:50,830 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-15 06:04:50,830 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-15 06:04:50,830 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-15 06:04:50,831 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-15 06:04:50,831 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-15 06:04:50,831 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-15 06:04:50,832 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-15 06:04:50,832 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-15 06:04:50,832 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-15 06:04:50,833 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-15 06:04:50,833 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-15 06:04:50,833 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-15 06:04:50,834 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-15 06:04:50,834 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-15 06:04:50,834 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-15 06:04:50,835 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-15 06:04:50,835 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-15 06:04:50,835 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-15 06:04:50,836 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-15 06:04:50,836 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-15 06:04:50,836 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-15 06:04:50,837 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-15 06:04:50,837 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-15 06:04:50,837 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-15 06:04:50,838 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-15 06:04:50,838 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-15 06:04:50,838 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-15 06:04:50,839 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-15 06:04:50,839 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-15 06:04:50,839 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-15 06:04:50,840 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-15 06:04:50,840 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-15 06:04:50,840 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-15 06:04:50,841 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-15 06:04:50,841 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-15 06:04:50,841 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-15 06:04:50,841 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-15 06:04:50,842 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-15 06:04:50,842 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-15 06:04:50,843 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-15 06:04:50,843 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-15 06:04:50,843 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-15 06:04:50,843 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-15 06:04:50,844 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-15 06:04:50,844 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-15 06:04:50,844 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-15 06:04:50,845 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-15 06:04:50,845 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-15 06:04:50,845 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-15 06:04:50,846 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-15 06:04:50,846 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-15 06:04:50,846 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-15 06:04:50,847 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-15 06:04:50,847 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-15 06:04:50,847 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-15 06:04:50,848 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-15 06:04:50,848 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-15 06:04:50,848 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-15 06:04:50,849 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-15 06:04:50,849 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-15 06:04:50,849 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-15 06:04:50,850 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-15 06:04:50,850 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-15 06:04:50,850 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-15 06:04:50,851 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-15 06:04:50,851 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-15 06:04:50,851 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-15 06:04:50,852 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-15 06:04:50,852 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-15 06:04:50,852 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-15 06:04:50,853 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-15 06:04:50,853 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-15 06:04:50,853 INFO L290 TraceCheckUtils]: 128: Hoare triple {62859#(<= main_~i~0 61)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-15 06:04:50,853 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-15 06:04:50,853 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-15 06:04:50,854 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-15 06:04:50,854 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-15 06:04:50,854 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-15 06:04:50,854 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-15 06:04:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:50,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062950685] [2022-04-15 06:04:50,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062950685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:50,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291307959] [2022-04-15 06:04:50,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:50,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:50,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:50,856 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-15 06:04:50,856 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-15 06:04:51,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:51,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:51,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 06:04:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:51,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:52,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {62793#true} call ULTIMATE.init(); {62793#true} is VALID [2022-04-15 06:04:52,110 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-15 06:04:52,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-15 06:04:52,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-15 06:04:52,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-15 06:04:52,111 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-15 06:04:52,111 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-15 06:04:52,112 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-15 06:04:52,112 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-15 06:04:52,112 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-15 06:04:52,113 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-15 06:04:52,113 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-15 06:04:52,113 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-15 06:04:52,114 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-15 06:04:52,114 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-15 06:04:52,114 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-15 06:04:52,115 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-15 06:04:52,115 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-15 06:04:52,115 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-15 06:04:52,116 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-15 06:04:52,116 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-15 06:04:52,116 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-15 06:04:52,117 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-15 06:04:52,117 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-15 06:04:52,117 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-15 06:04:52,118 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-15 06:04:52,118 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-15 06:04:52,118 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-15 06:04:52,119 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-15 06:04:52,119 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-15 06:04:52,119 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-15 06:04:52,120 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-15 06:04:52,120 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-15 06:04:52,120 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-15 06:04:52,121 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-15 06:04:52,121 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-15 06:04:52,121 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-15 06:04:52,122 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-15 06:04:52,122 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-15 06:04:52,122 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-15 06:04:52,123 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-15 06:04:52,123 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-15 06:04:52,123 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-15 06:04:52,124 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-15 06:04:52,124 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-15 06:04:52,124 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-15 06:04:52,125 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-15 06:04:52,125 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-15 06:04:52,125 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-15 06:04:52,126 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-15 06:04:52,126 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-15 06:04:52,126 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-15 06:04:52,127 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-15 06:04:52,127 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-15 06:04:52,127 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-15 06:04:52,128 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-15 06:04:52,128 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-15 06:04:52,128 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-15 06:04:52,129 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-15 06:04:52,129 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-15 06:04:52,129 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-15 06:04:52,130 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-15 06:04:52,130 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-15 06:04:52,130 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-15 06:04:52,131 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-15 06:04:52,131 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-15 06:04:52,131 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-15 06:04:52,132 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-15 06:04:52,132 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-15 06:04:52,132 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-15 06:04:52,133 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-15 06:04:52,133 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-15 06:04:52,133 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-15 06:04:52,134 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-15 06:04:52,134 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-15 06:04:52,134 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-15 06:04:52,135 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-15 06:04:52,135 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-15 06:04:52,135 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-15 06:04:52,136 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-15 06:04:52,136 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-15 06:04:52,136 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-15 06:04:52,137 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-15 06:04:52,137 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-15 06:04:52,137 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-15 06:04:52,138 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-15 06:04:52,138 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-15 06:04:52,138 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-15 06:04:52,139 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-15 06:04:52,139 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-15 06:04:52,139 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-15 06:04:52,140 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-15 06:04:52,140 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-15 06:04:52,140 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-15 06:04:52,141 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-15 06:04:52,141 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-15 06:04:52,141 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-15 06:04:52,142 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-15 06:04:52,142 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-15 06:04:52,142 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-15 06:04:52,143 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-15 06:04:52,143 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-15 06:04:52,143 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-15 06:04:52,144 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-15 06:04:52,144 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-15 06:04:52,144 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-15 06:04:52,145 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-15 06:04:52,145 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-15 06:04:52,145 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-15 06:04:52,146 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-15 06:04:52,146 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-15 06:04:52,146 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-15 06:04:52,147 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-15 06:04:52,147 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-15 06:04:52,147 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-15 06:04:52,148 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-15 06:04:52,148 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-15 06:04:52,148 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-15 06:04:52,149 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-15 06:04:52,149 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-15 06:04:52,149 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-15 06:04:52,150 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-15 06:04:52,150 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-15 06:04:52,150 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-15 06:04:52,151 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-15 06:04:52,151 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-15 06:04:52,151 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-15 06:04:52,152 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-15 06:04:52,152 INFO L290 TraceCheckUtils]: 128: Hoare triple {62859#(<= main_~i~0 61)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-15 06:04:52,152 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-15 06:04:52,152 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-15 06:04:52,152 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-15 06:04:52,152 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-15 06:04:52,152 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-15 06:04:52,153 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-15 06:04:52,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:56,525 INFO L290 TraceCheckUtils]: 133: Hoare triple {62794#false} assume !false; {62794#false} is VALID [2022-04-15 06:04:56,525 INFO L290 TraceCheckUtils]: 132: Hoare triple {62794#false} assume 0 == ~cond; {62794#false} is VALID [2022-04-15 06:04:56,525 INFO L290 TraceCheckUtils]: 131: Hoare triple {62794#false} ~cond := #in~cond; {62794#false} is VALID [2022-04-15 06:04:56,525 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-15 06:04:56,525 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-15 06:04:56,526 INFO L290 TraceCheckUtils]: 128: Hoare triple {63279#(< main_~i~0 2048)} assume !(~i~0 < 2048); {62794#false} is VALID [2022-04-15 06:04:56,526 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-15 06:04:56,526 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-15 06:04:56,527 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-15 06:04:56,527 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-15 06:04:56,527 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-15 06:04:56,528 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-15 06:04:56,528 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-15 06:04:56,528 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-15 06:04:56,529 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-15 06:04:56,529 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-15 06:04:56,529 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-15 06:04:56,530 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-15 06:04:56,530 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-15 06:04:56,530 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-15 06:04:56,531 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-15 06:04:56,531 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-15 06:04:56,531 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-15 06:04:56,532 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-15 06:04:56,532 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-15 06:04:56,532 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-15 06:04:56,533 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-15 06:04:56,533 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-15 06:04:56,533 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-15 06:04:56,534 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-15 06:04:56,534 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-15 06:04:56,534 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-15 06:04:56,535 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-15 06:04:56,535 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-15 06:04:56,535 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-15 06:04:56,536 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-15 06:04:56,536 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-15 06:04:56,536 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-15 06:04:56,537 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-15 06:04:56,537 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-15 06:04:56,537 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-15 06:04:56,538 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-15 06:04:56,538 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-15 06:04:56,538 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-15 06:04:56,539 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-15 06:04:56,539 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-15 06:04:56,539 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-15 06:04:56,540 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-15 06:04:56,540 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-15 06:04:56,540 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-15 06:04:56,541 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-15 06:04:56,541 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-15 06:04:56,541 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-15 06:04:56,542 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-15 06:04:56,542 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-15 06:04:56,542 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-15 06:04:56,543 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-15 06:04:56,543 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-15 06:04:56,543 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-15 06:04:56,544 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-15 06:04:56,544 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-15 06:04:56,544 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-15 06:04:56,545 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-15 06:04:56,545 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-15 06:04:56,545 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-15 06:04:56,546 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-15 06:04:56,546 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-15 06:04:56,546 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-15 06:04:56,547 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-15 06:04:56,547 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-15 06:04:56,547 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-15 06:04:56,548 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-15 06:04:56,548 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-15 06:04:56,548 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-15 06:04:56,549 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-15 06:04:56,549 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-15 06:04:56,549 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-15 06:04:56,550 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-15 06:04:56,550 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-15 06:04:56,550 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-15 06:04:56,551 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-15 06:04:56,551 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-15 06:04:56,551 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-15 06:04:56,552 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-15 06:04:56,552 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-15 06:04:56,552 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-15 06:04:56,553 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-15 06:04:56,553 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-15 06:04:56,553 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-15 06:04:56,554 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-15 06:04:56,554 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-15 06:04:56,554 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-15 06:04:56,555 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-15 06:04:56,555 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-15 06:04:56,555 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-15 06:04:56,556 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-15 06:04:56,556 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-15 06:04:56,556 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-15 06:04:56,557 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-15 06:04:56,557 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-15 06:04:56,557 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-15 06:04:56,558 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-15 06:04:56,558 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-15 06:04:56,558 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-15 06:04:56,559 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-15 06:04:56,559 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-15 06:04:56,559 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-15 06:04:56,560 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-15 06:04:56,560 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-15 06:04:56,560 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-15 06:04:56,561 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-15 06:04:56,561 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-15 06:04:56,561 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-15 06:04:56,562 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-15 06:04:56,562 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-15 06:04:56,562 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-15 06:04:56,563 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-15 06:04:56,563 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-15 06:04:56,563 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-15 06:04:56,564 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-15 06:04:56,564 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-15 06:04:56,564 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-15 06:04:56,565 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-15 06:04:56,565 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-15 06:04:56,565 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-15 06:04:56,566 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-15 06:04:56,566 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-15 06:04:56,566 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-15 06:04:56,567 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-15 06:04:56,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {62793#true} call #t~ret5 := main(); {62793#true} is VALID [2022-04-15 06:04:56,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62793#true} {62793#true} #44#return; {62793#true} is VALID [2022-04-15 06:04:56,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {62793#true} assume true; {62793#true} is VALID [2022-04-15 06:04:56,567 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-15 06:04:56,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {62793#true} call ULTIMATE.init(); {62793#true} is VALID [2022-04-15 06:04:56,568 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-15 06:04:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291307959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:56,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 06:04:56,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:56,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783447753] [2022-04-15 06:04:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783447753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:56,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 06:04:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152872030] [2022-04-15 06:04:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:56,569 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-15 06:04:56,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:56,569 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-15 06:04:56,655 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-15 06:04:56,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 06:04:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 06:04:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:04:56,657 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-15 06:04:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:59,483 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2022-04-15 06:04:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:04:59,484 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-15 06:04:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:59,484 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-15 06:04:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2022-04-15 06:04:59,485 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-15 06:04:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2022-04-15 06:04:59,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 144 transitions. [2022-04-15 06:04:59,593 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-15 06:04:59,594 INFO L225 Difference]: With dead ends: 144 [2022-04-15 06:04:59,594 INFO L226 Difference]: Without dead ends: 138 [2022-04-15 06:04:59,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 06:04:59,596 INFO L913 BasicCegarLoop]: 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-15 06:04:59,596 INFO L914 BasicCegarLoop]: 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-15 06:04:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-15 06:05:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-04-15 06:05:00,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:00,453 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-15 06:05:00,453 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-15 06:05:00,454 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-15 06:05:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:00,455 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-15 06:05:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2022-04-15 06:05:00,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:00,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:00,456 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-15 06:05:00,456 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-15 06:05:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:00,457 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2022-04-15 06:05:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2022-04-15 06:05:00,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:00,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:00,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:00,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:00,458 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-15 06:05:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2022-04-15 06:05:00,460 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2022-04-15 06:05:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:00,460 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2022-04-15 06:05:00,460 INFO L479 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-15 06:05:00,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 137 transitions. [2022-04-15 06:05:00,646 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-15 06:05:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2022-04-15 06:05:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 06:05:00,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:00,647 INFO L499 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:00,666 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-15 06:05:00,851 WARN L460 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-15 06:05:00,851 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1422801162, now seen corresponding path program 123 times [2022-04-15 06:05:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36570753] [2022-04-15 06:05:00,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:00,855 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:00,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1422801162, now seen corresponding path program 124 times [2022-04-15 06:05:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:00,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235271162] [2022-04-15 06:05:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:02,424 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-15 06:05:02,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-15 06:05:02,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-15 06:05:02,425 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-15 06:05:02,425 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-15 06:05:02,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-15 06:05:02,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-15 06:05:02,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-15 06:05:02,425 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-15 06:05:02,426 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-15 06:05:02,426 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-15 06:05:02,426 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-15 06:05:02,427 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-15 06:05:02,427 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-15 06:05:02,428 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-15 06:05:02,428 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-15 06:05:02,428 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-15 06:05:02,428 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-15 06:05:02,429 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-15 06:05:02,429 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-15 06:05:02,429 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-15 06:05:02,430 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-15 06:05:02,430 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-15 06:05:02,430 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-15 06:05:02,431 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-15 06:05:02,431 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-15 06:05:02,431 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-15 06:05:02,432 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-15 06:05:02,432 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-15 06:05:02,432 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-15 06:05:02,433 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-15 06:05:02,433 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-15 06:05:02,433 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-15 06:05:02,434 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-15 06:05:02,434 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-15 06:05:02,434 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-15 06:05:02,435 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-15 06:05:02,435 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-15 06:05:02,435 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-15 06:05:02,436 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-15 06:05:02,436 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-15 06:05:02,436 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-15 06:05:02,437 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-15 06:05:02,437 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-15 06:05:02,437 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-15 06:05:02,438 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-15 06:05:02,438 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-15 06:05:02,438 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-15 06:05:02,439 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-15 06:05:02,439 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-15 06:05:02,439 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-15 06:05:02,440 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-15 06:05:02,440 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-15 06:05:02,440 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-15 06:05:02,441 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-15 06:05:02,441 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-15 06:05:02,441 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-15 06:05:02,442 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-15 06:05:02,442 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-15 06:05:02,442 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-15 06:05:02,443 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-15 06:05:02,443 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-15 06:05:02,443 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-15 06:05:02,444 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-15 06:05:02,444 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-15 06:05:02,444 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-15 06:05:02,445 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-15 06:05:02,445 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-15 06:05:02,445 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-15 06:05:02,446 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-15 06:05:02,446 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-15 06:05:02,446 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-15 06:05:02,447 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-15 06:05:02,447 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-15 06:05:02,447 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-15 06:05:02,448 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-15 06:05:02,448 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-15 06:05:02,448 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-15 06:05:02,449 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-15 06:05:02,449 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-15 06:05:02,449 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-15 06:05:02,450 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-15 06:05:02,450 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-15 06:05:02,450 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-15 06:05:02,451 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-15 06:05:02,451 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-15 06:05:02,451 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-15 06:05:02,452 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-15 06:05:02,452 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-15 06:05:02,452 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-15 06:05:02,453 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-15 06:05:02,453 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-15 06:05:02,453 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-15 06:05:02,454 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-15 06:05:02,454 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-15 06:05:02,454 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-15 06:05:02,455 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-15 06:05:02,455 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-15 06:05:02,455 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-15 06:05:02,456 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-15 06:05:02,456 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-15 06:05:02,456 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-15 06:05:02,457 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-15 06:05:02,457 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-15 06:05:02,457 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-15 06:05:02,458 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-15 06:05:02,458 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-15 06:05:02,458 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-15 06:05:02,459 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-15 06:05:02,459 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-15 06:05:02,459 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-15 06:05:02,460 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-15 06:05:02,460 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-15 06:05:02,460 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-15 06:05:02,461 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-15 06:05:02,461 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-15 06:05:02,461 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-15 06:05:02,462 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-15 06:05:02,462 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-15 06:05:02,462 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-15 06:05:02,463 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-15 06:05:02,463 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-15 06:05:02,463 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-15 06:05:02,464 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-15 06:05:02,464 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-15 06:05:02,464 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-15 06:05:02,465 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-15 06:05:02,465 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-15 06:05:02,465 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-15 06:05:02,466 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-15 06:05:02,466 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-15 06:05:02,466 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-15 06:05:02,467 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-15 06:05:02,467 INFO L290 TraceCheckUtils]: 130: Hoare triple {64756#(<= main_~i~0 62)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-15 06:05:02,467 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-15 06:05:02,467 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-15 06:05:02,467 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-15 06:05:02,467 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-15 06:05:02,467 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-15 06:05:02,468 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-15 06:05:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:02,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235271162] [2022-04-15 06:05:02,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235271162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:02,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951016939] [2022-04-15 06:05:02,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:05:02,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:02,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:02,469 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-15 06:05:02,470 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-15 06:05:02,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:05:02,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:02,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-15 06:05:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:02,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:03,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {64689#true} call ULTIMATE.init(); {64689#true} is VALID [2022-04-15 06:05:03,871 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-15 06:05:03,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-15 06:05:03,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-15 06:05:03,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-15 06:05:03,871 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-15 06:05:03,872 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-15 06:05:03,872 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-15 06:05:03,872 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-15 06:05:03,873 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-15 06:05:03,873 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-15 06:05:03,874 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-15 06:05:03,874 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-15 06:05:03,874 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-15 06:05:03,874 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-15 06:05:03,875 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-15 06:05:03,875 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-15 06:05:03,875 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-15 06:05:03,876 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-15 06:05:03,876 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-15 06:05:03,876 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-15 06:05:03,877 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-15 06:05:03,877 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-15 06:05:03,877 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-15 06:05:03,878 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-15 06:05:03,878 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-15 06:05:03,878 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-15 06:05:03,879 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-15 06:05:03,879 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-15 06:05:03,879 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-15 06:05:03,880 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-15 06:05:03,880 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-15 06:05:03,880 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-15 06:05:03,881 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-15 06:05:03,881 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-15 06:05:03,881 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-15 06:05:03,882 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-15 06:05:03,882 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-15 06:05:03,882 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-15 06:05:03,883 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-15 06:05:03,883 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-15 06:05:03,883 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-15 06:05:03,884 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-15 06:05:03,884 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-15 06:05:03,884 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-15 06:05:03,885 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-15 06:05:03,885 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-15 06:05:03,885 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-15 06:05:03,886 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-15 06:05:03,886 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-15 06:05:03,886 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-15 06:05:03,887 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-15 06:05:03,887 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-15 06:05:03,887 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-15 06:05:03,888 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-15 06:05:03,888 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-15 06:05:03,888 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-15 06:05:03,889 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-15 06:05:03,889 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-15 06:05:03,889 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-15 06:05:03,890 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-15 06:05:03,890 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-15 06:05:03,890 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-15 06:05:03,891 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-15 06:05:03,891 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-15 06:05:03,891 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-15 06:05:03,892 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-15 06:05:03,892 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-15 06:05:03,892 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-15 06:05:03,893 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-15 06:05:03,893 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-15 06:05:03,893 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-15 06:05:03,894 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-15 06:05:03,894 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-15 06:05:03,894 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-15 06:05:03,895 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-15 06:05:03,895 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-15 06:05:03,895 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-15 06:05:03,896 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-15 06:05:03,896 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-15 06:05:03,896 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-15 06:05:03,897 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-15 06:05:03,897 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-15 06:05:03,897 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-15 06:05:03,898 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-15 06:05:03,898 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-15 06:05:03,898 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-15 06:05:03,899 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-15 06:05:03,899 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-15 06:05:03,899 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-15 06:05:03,900 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-15 06:05:03,900 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-15 06:05:03,900 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-15 06:05:03,901 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-15 06:05:03,901 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-15 06:05:03,901 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-15 06:05:03,902 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-15 06:05:03,902 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-15 06:05:03,902 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-15 06:05:03,903 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-15 06:05:03,903 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-15 06:05:03,903 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-15 06:05:03,904 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-15 06:05:03,904 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-15 06:05:03,904 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-15 06:05:03,905 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-15 06:05:03,905 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-15 06:05:03,905 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-15 06:05:03,906 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-15 06:05:03,906 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-15 06:05:03,906 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-15 06:05:03,907 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-15 06:05:03,907 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-15 06:05:03,907 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-15 06:05:03,908 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-15 06:05:03,908 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-15 06:05:03,908 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-15 06:05:03,909 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-15 06:05:03,909 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-15 06:05:03,909 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-15 06:05:03,910 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-15 06:05:03,910 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-15 06:05:03,910 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-15 06:05:03,911 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-15 06:05:03,911 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-15 06:05:03,911 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-15 06:05:03,912 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-15 06:05:03,912 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-15 06:05:03,912 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-15 06:05:03,913 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-15 06:05:03,913 INFO L290 TraceCheckUtils]: 130: Hoare triple {64756#(<= main_~i~0 62)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-15 06:05:03,913 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-15 06:05:03,913 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-15 06:05:03,913 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-15 06:05:03,913 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-15 06:05:03,913 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-15 06:05:03,914 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-15 06:05:03,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:08,403 INFO L290 TraceCheckUtils]: 135: Hoare triple {64690#false} assume !false; {64690#false} is VALID [2022-04-15 06:05:08,404 INFO L290 TraceCheckUtils]: 134: Hoare triple {64690#false} assume 0 == ~cond; {64690#false} is VALID [2022-04-15 06:05:08,404 INFO L290 TraceCheckUtils]: 133: Hoare triple {64690#false} ~cond := #in~cond; {64690#false} is VALID [2022-04-15 06:05:08,404 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-15 06:05:08,404 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-15 06:05:08,404 INFO L290 TraceCheckUtils]: 130: Hoare triple {65182#(< main_~i~0 2048)} assume !(~i~0 < 2048); {64690#false} is VALID [2022-04-15 06:05:08,405 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-15 06:05:08,405 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-15 06:05:08,405 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-15 06:05:08,406 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-15 06:05:08,406 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-15 06:05:08,406 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-15 06:05:08,407 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-15 06:05:08,407 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-15 06:05:08,407 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-15 06:05:08,408 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-15 06:05:08,408 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-15 06:05:08,408 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-15 06:05:08,409 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-15 06:05:08,409 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-15 06:05:08,409 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-15 06:05:08,410 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-15 06:05:08,410 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-15 06:05:08,410 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-15 06:05:08,411 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-15 06:05:08,411 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-15 06:05:08,411 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-15 06:05:08,412 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-15 06:05:08,412 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-15 06:05:08,412 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-15 06:05:08,413 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-15 06:05:08,413 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-15 06:05:08,413 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-15 06:05:08,414 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-15 06:05:08,414 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-15 06:05:08,414 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-15 06:05:08,415 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-15 06:05:08,415 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-15 06:05:08,415 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-15 06:05:08,416 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-15 06:05:08,416 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-15 06:05:08,416 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-15 06:05:08,417 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-15 06:05:08,417 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-15 06:05:08,417 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-15 06:05:08,418 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-15 06:05:08,418 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-15 06:05:08,418 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-15 06:05:08,419 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-15 06:05:08,419 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-15 06:05:08,419 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-15 06:05:08,420 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-15 06:05:08,420 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-15 06:05:08,420 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-15 06:05:08,421 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-15 06:05:08,421 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-15 06:05:08,421 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-15 06:05:08,422 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-15 06:05:08,422 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-15 06:05:08,422 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-15 06:05:08,423 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-15 06:05:08,423 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-15 06:05:08,423 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-15 06:05:08,424 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-15 06:05:08,424 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-15 06:05:08,424 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-15 06:05:08,425 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-15 06:05:08,425 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-15 06:05:08,425 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-15 06:05:08,426 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-15 06:05:08,426 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-15 06:05:08,426 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-15 06:05:08,427 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-15 06:05:08,427 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-15 06:05:08,427 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-15 06:05:08,428 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-15 06:05:08,428 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-15 06:05:08,428 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-15 06:05:08,429 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-15 06:05:08,429 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-15 06:05:08,429 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-15 06:05:08,430 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-15 06:05:08,430 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-15 06:05:08,430 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-15 06:05:08,431 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-15 06:05:08,431 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-15 06:05:08,431 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-15 06:05:08,432 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-15 06:05:08,432 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-15 06:05:08,432 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-15 06:05:08,433 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-15 06:05:08,433 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-15 06:05:08,433 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-15 06:05:08,434 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-15 06:05:08,434 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-15 06:05:08,434 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-15 06:05:08,435 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-15 06:05:08,435 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-15 06:05:08,435 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-15 06:05:08,436 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-15 06:05:08,436 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-15 06:05:08,436 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-15 06:05:08,437 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-15 06:05:08,437 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-15 06:05:08,437 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-15 06:05:08,438 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-15 06:05:08,438 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-15 06:05:08,438 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-15 06:05:08,439 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-15 06:05:08,439 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-15 06:05:08,439 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-15 06:05:08,440 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-15 06:05:08,440 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-15 06:05:08,440 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-15 06:05:08,441 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-15 06:05:08,441 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-15 06:05:08,441 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-15 06:05:08,442 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-15 06:05:08,442 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-15 06:05:08,442 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-15 06:05:08,443 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-15 06:05:08,443 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-15 06:05:08,443 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-15 06:05:08,444 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-15 06:05:08,444 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-15 06:05:08,444 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-15 06:05:08,445 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-15 06:05:08,445 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-15 06:05:08,445 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-15 06:05:08,446 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-15 06:05:08,446 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-15 06:05:08,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {64689#true} call #t~ret5 := main(); {64689#true} is VALID [2022-04-15 06:05:08,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64689#true} {64689#true} #44#return; {64689#true} is VALID [2022-04-15 06:05:08,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {64689#true} assume true; {64689#true} is VALID [2022-04-15 06:05:08,447 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-15 06:05:08,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {64689#true} call ULTIMATE.init(); {64689#true} is VALID [2022-04-15 06:05:08,447 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-15 06:05:08,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951016939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:08,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:08,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 130 [2022-04-15 06:05:08,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:08,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36570753] [2022-04-15 06:05:08,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36570753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:08,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:08,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:05:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395053812] [2022-04-15 06:05:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:08,449 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-15 06:05:08,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:08,449 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-15 06:05:08,536 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-15 06:05:08,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:05:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:05:08,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8258, Invalid=8512, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:05:08,538 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-15 06:05:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:11,468 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2022-04-15 06:05:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 06:05:11,469 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-15 06:05:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:11,469 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-15 06:05:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 146 transitions. [2022-04-15 06:05:11,470 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-15 06:05:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 146 transitions. [2022-04-15 06:05:11,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 146 transitions. [2022-04-15 06:05:11,579 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-15 06:05:11,580 INFO L225 Difference]: With dead ends: 146 [2022-04-15 06:05:11,580 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 06:05:11,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=16386, Invalid=20670, Unknown=0, NotChecked=0, Total=37056 [2022-04-15 06:05:11,582 INFO L913 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:11,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 44 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:05:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 06:05:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-15 06:05:12,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:12,470 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-15 06:05:12,470 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-15 06:05:12,470 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-15 06:05:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:12,472 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-15 06:05:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2022-04-15 06:05:12,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:12,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:12,472 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-15 06:05:12,472 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-15 06:05:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:12,474 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2022-04-15 06:05:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2022-04-15 06:05:12,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:12,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:12,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:12,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:12,474 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-15 06:05:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2022-04-15 06:05:12,475 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2022-04-15 06:05:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:12,476 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2022-04-15 06:05:12,476 INFO L479 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-15 06:05:12,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 139 transitions. [2022-04-15 06:05:12,661 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-15 06:05:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2022-04-15 06:05:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 06:05:12,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:12,662 INFO L499 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:12,681 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-15 06:05:12,862 WARN L460 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-15 06:05:12,863 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1908563352, now seen corresponding path program 125 times [2022-04-15 06:05:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:12,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898158665] [2022-04-15 06:05:12,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:12,865 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:12,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1908563352, now seen corresponding path program 126 times [2022-04-15 06:05:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:12,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764733581] [2022-04-15 06:05:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:14,429 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-15 06:05:14,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {66613#true} assume true; {66613#true} is VALID [2022-04-15 06:05:14,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66613#true} {66613#true} #44#return; {66613#true} is VALID [2022-04-15 06:05:14,430 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-15 06:05:14,430 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-15 06:05:14,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {66613#true} assume true; {66613#true} is VALID [2022-04-15 06:05:14,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66613#true} {66613#true} #44#return; {66613#true} is VALID [2022-04-15 06:05:14,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {66613#true} call #t~ret5 := main(); {66613#true} is VALID [2022-04-15 06:05:14,431 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-15 06:05:14,431 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-15 06:05:14,431 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-15 06:05:14,432 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-15 06:05:14,432 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-15 06:05:14,432 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-15 06:05:14,433 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-15 06:05:14,433 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-15 06:05:14,433 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-15 06:05:14,434 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-15 06:05:14,434 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-15 06:05:14,434 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-15 06:05:14,435 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-15 06:05:14,435 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-15 06:05:14,435 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-15 06:05:14,436 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-15 06:05:14,436 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-15 06:05:14,436 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-15 06:05:14,437 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-15 06:05:14,437 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-15 06:05:14,437 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-15 06:05:14,438 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-15 06:05:14,438 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-15 06:05:14,438 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-15 06:05:14,439 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-15 06:05:14,439 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-15 06:05:14,439 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-15 06:05:14,440 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-15 06:05:14,440 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-15 06:05:14,440 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-15 06:05:14,441 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-15 06:05:14,441 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-15 06:05:14,441 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-15 06:05:14,441 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-15 06:05:14,442 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-15 06:05:14,442 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-15 06:05:14,443 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-15 06:05:14,443 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-15 06:05:14,443 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-15 06:05:14,443 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-15 06:05:14,444 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-15 06:05:14,444 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-15 06:05:14,445 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-15 06:05:14,445 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-15 06:05:14,445 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-15 06:05:14,445 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-15 06:05:14,446 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-15 06:05:14,446 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-15 06:05:14,446 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-15 06:05:14,447 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-15 06:05:14,447 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-15 06:05:14,447 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-15 06:05:14,448 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-15 06:05:14,448 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-15 06:05:14,448 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-15 06:05:14,449 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-15 06:05:14,449 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-15 06:05:14,449 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-15 06:05:14,450 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-15 06:05:14,450 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-15 06:05:14,450 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-15 06:05:14,451 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-15 06:05:14,451 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-15 06:05:14,451 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-15 06:05:14,452 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-15 06:05:14,452 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-15 06:05:14,452 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-15 06:05:14,453 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-15 06:05:14,453 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-15 06:05:14,453 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-15 06:05:14,454 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-15 06:05:14,454 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-15 06:05:14,454 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-15 06:05:14,455 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-15 06:05:14,455 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-15 06:05:14,455 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-15 06:05:14,456 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-15 06:05:14,456 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-15 06:05:14,456 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-15 06:05:14,457 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-15 06:05:14,457 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-15 06:05:14,457 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-15 06:05:14,458 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-15 06:05:14,458 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-15 06:05:14,458 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-15 06:05:14,459 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-15 06:05:14,459 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-15 06:05:14,459 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-15 06:05:14,460 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-15 06:05:14,460 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-15 06:05:14,460 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-15 06:05:14,461 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-15 06:05:14,461 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-15 06:05:14,461 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-15 06:05:14,462 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-15 06:05:14,462 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-15 06:05:14,462 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-15 06:05:14,463 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-15 06:05:14,463 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-15 06:05:14,463 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-15 06:05:14,464 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-15 06:05:14,464 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-15 06:05:14,464 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-15 06:05:14,465 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-15 06:05:14,465 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-15 06:05:14,465 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-15 06:05:14,466 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-15 06:05:14,466 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-15 06:05:14,466 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-15 06:05:14,466 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-15 06:05:14,467 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-15 06:05:14,467 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-15 06:05:14,468 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-15 06:05:14,468 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-15 06:05:14,468 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-15 06:05:14,468 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-15 06:05:14,469 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-15 06:05:14,469 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-15 06:05:14,469 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-15 06:05:14,470 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-15 06:05:14,470 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-15 06:05:14,470 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-15 06:05:14,471 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-15 06:05:14,471 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-15 06:05:14,471 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-15 06:05:14,472 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-15 06:05:14,472 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-15 06:05:14,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {66681#(<= main_~i~0 63)} assume !(~i~0 < 2048); {66614#false} is VALID [2022-04-15 06:05:14,472 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-15 06:05:14,473 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-15 06:05:14,473 INFO L290 TraceCheckUtils]: 135: Hoare triple {66614#false} ~cond := #in~cond; {66614#false} is VALID [2022-04-15 06:05:14,473 INFO L290 TraceCheckUtils]: 136: Hoare triple {66614#false} assume 0 == ~cond; {66614#false} is VALID [2022-04-15 06:05:14,473 INFO L290 TraceCheckUtils]: 137: Hoare triple {66614#false} assume !false; {66614#false} is VALID [2022-04-15 06:05:14,473 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-15 06:05:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:14,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764733581] [2022-04-15 06:05:14,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764733581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:14,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615675117] [2022-04-15 06:05:14,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:05:14,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:14,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:14,476 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-15 06:05:14,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process